Search Results for author:
Found 16 papers, 1 papers with code
An epistemic logic for modeling decisions in the context of incomplete knowledge
A challenging problem is that of expressing decision knowledge in the context of incomplete knowledge.
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.
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.
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.
Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
The problem of selecting an appropriate formalisation of aggregates for answer set programming (ASP) remains unsettled.
Justifications and a Reconstruction of Parity Game Solving Algorithms
Parity games are infinite two-player games played on directed graphs.
Logic in Computer Science
Exploiting Game Theory for Analysing Justifications
We show that justification frameworks can be seen as a special type of games.
The informal semantics of Answer Set Programming: A Tarskian perspective
In 1999, the seminal papers on answer set programming proposed to use this logic for a different purpose, namely, to model and solve search problems.
Implementing a Relevance Tracker Module
PC(ID) extends propositional logic with inductive definitions: rule sets under the well-founded semantics.
The KB paradigm and its application to interactive configuration
The knowledge base paradigm aims to express domain knowledge in a rich formal language, and to use this domain knowledge as a knowledge base to solve various problems and tasks that arise in the domain by applying multiple forms of inference.
Visualising interactive inferences with IDPD3
A large part of the use of knowledge base systems is the interpretation of the output by the end-users and the interaction with these users.
FO(C): A Knowledge Representation Language of Causality
Cause-effect relations are an important part of human knowledge.
Grounding FO and FO(ID) with Bounds
We first present our method for classical first-order logic (FO) theories.
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.
