Search Results for author:
Found 22 papers, 2 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.
Non-deterministic approximation operators: ultimate operators, semi-equilibrium semantics and aggregates (full version)
Approximation fixpoint theory (AFT) is an abstract and general algebraic framework for studying the semantics of non-monotonic logics.
Efficiently Explaining CSPs with Unsatisfiable Subset Optimization (extended algorithms and examples)
We build on a recently proposed method for stepwise explaining solutions of Constraint Satisfaction Problems (CSP) in a human-understandable way.
Distributed Subweb Specifications for Traversing the Web
In existing ltqp approaches, the burden of finding sources to query is entirely in the hands of the data consumer.
Non-Deterministic Approximation Fixpoint Theory and Its Application in Disjunctive Logic Programming
Approximation fixpoint theory (AFT) is an abstract and general algebraic framework for studying the semantics of nonmonotonic logics.
Tree-Like Justification Systems are Consistent
Justification theory is an abstract unifying formalism that captures semantics of various non-monotonic logics.
On Nested Justification Systems (full version)
Justification theory is a general framework for the definition of semantics of rule-based languages that has a high explanatory potential.
Certified Symmetry and Dominance Breaking for Combinatorial Optimisation
Symmetry and dominance breaking can be crucial for solving hard combinatorial search and optimisation problems, but the correctness of these techniques sometimes relies on subtle arguments.
Fixpoint Semantics for Recursive SHACL
In this paper, we argue that for defining and studying semantics of recursive SHACL, lessons can be learned from years of research in non-monotonic reasoning.
Proceedings 37th International Conference on Logic Programming (Technical Communications)
ICLP is the premier international event for presenting research in logic programming.
Efficiently Explaining CSPs with Unsatisfiable Subset Optimization
We build on a recently proposed method for explaining solutions of constraint satisfaction problems.
LP2PB: Translating Answer Set Programs into Pseudo-Boolean Theories
Answer set programming (ASP) is a well-established knowledge representation formalism.
Exploiting Game Theory for Analysing Justifications
We show that justification frameworks can be seen as a special type of games.
A framework for step-wise explaining how to solve constraint satisfaction problems
We propose the use of a cost function to quantify how simple an individual explanation of an inference step is, and identify the explanation-production problem of finding the best sequence of explanations of a CSP.
Proceedings 35th International Conference on Logic Programming (Technical Communications)
Since the first conference held in Marseille in 1982, ICLP has been the premier international event for presenting research in logic programming.
BreakID: Static Symmetry Breaking for ASP (System Description)
Symmetry breaking has been proven to be an efficient preprocessing technique for satisfiability solving (SAT).
Implementing a Relevance Tracker Module
PC(ID) extends propositional logic with inductive definitions: rule sets under the well-founded semantics.
Stable-Unstable Semantics: Beyond NP with Normal Logic Programs
In this paper, we present a novel logic programming--based modeling paradigm that combines the best features of ASP and QBFs.
Propagators and Solvers for the Algebra of Modular Systems
In this paper, we construct a solver for the model expansion task for a complex modular systems from an expression in the algebra and black-box propagators or solvers for the primitive modules.
FO(C): A Knowledge Representation Language of Causality
Cause-effect relations are an important part of human knowledge.
Predicate Logic as a Modeling Language: Modeling and Solving some Machine Learning and Data Mining Problems with IDP3
This paper provides a gentle introduction to problem solving with the IDP3 system.
