Interactive Model Expansion in an Observable Environment

05/20/2023
by   Pierre Carbonnelle, et al.
0

Many practical problems can be understood as the search for a state of affairs that extends a fixed partial state of affairs, the environment, while satisfying certain conditions that are formally specified. Such problems are found in, e.g., engineering, law or economics. We study this class of problems in a context where some of the relevant information about the environment is not known by the user at the start of the search. During the search, the user may consider tentative solutions that make implicit hypotheses about these unknowns. To ensure that the solution is appropriate, these hypotheses must be verified by observing the environment. Furthermore, we assume that, in addition to knowledge of what constitutes a solution, knowledge of general laws of the environment is also present. We formally define partial solutions with enough verified facts to guarantee the existence of complete and appropriate solutions. Additionally, we propose an interactive system to assist the user in their search by determining 1) which hypotheses implicit in a tentative solution must be verified in the environment, and 2) which observations can bring useful information for the search. We present an efficient method to over-approximate the set of relevant information, and evaluate our implementation.

READ FULL TEXT
research
10/27/2020

Formally Verified SAT-Based AI Planning

We present an executable formally verified SAT encoding of classical AI ...
research
06/05/2022

Formally Verified Solution Methods for Infinite-Horizon Markov Decision Processes

We formally verify executable algorithms for solving Markov decision pro...
research
05/08/2023

Searching Mobile App Screens via Text + Doodle

Locating a specific mobile application screen from existing repositories...
research
07/20/2021

Verified Functional Programming of an Abstract Interpreter

Abstract interpreters are complex pieces of software: even if the abstra...
research
08/12/2023

Convergence analysis of a spectral-Galerkin-type search extension method for finding multiple solutions to semilinear problems

In this paper, we develop an efficient spectral-Galerkin-type search ext...
research
03/28/2019

Complete Disjoint coNP-Pairs but no Complete Total Polynomial Search Problems Relative to an Oracle

Consider the following conjectures: H1: the set TFNP of all total poly...
research
05/17/2022

Connection-minimal Abduction in EL via Translation to FOL – Technical Report

Abduction in description logics finds extensions of a knowledge base to ...

Please sign up or login with your details

Forgot password? Click here to reset