Search Results for author:
Found 4 papers, 1 papers with code
Using Symmetries to Lift Satisfiability Checking
Thus, we propose a 2-step novel method: (i) the sentence to be satisfied is automatically translated into an equisatisfiable sentence over a ``lifted'' vocabulary that allows domain compression; (ii) satisfiability of the lifted sentence is checked by growing the (initially unknown) compressed domain until a satisfying structure is found.
Interactive Model Expansion in an Observable Environment
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.
Quantification and Aggregation over Concepts of the Ontology
To avoid nonsensical sentences in this formalism, we refine the concept of well-formed sentences, and propose a method to verify well-formedness with a complexity that is linear with the number of tokens in the formula.
Interactive configurator with FO(.) and IDP-Z3
Industry abounds with interactive configuration problems, i. e., constraint solving problems interactively solved by persons with the assistance of a computer.
