Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks

@inproceedings{Eiter2002ModalNL,
  title={Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks},
  author={Thomas Eiter and Volker Klotz and Hans Tompits and Stefan Woltran},
  booktitle={TABLEAUX},
  year={2002}
}
Modal nonmonotonic logics constitute a well-known family of knowledge-representation formalisms capturing ideally rational agents reasoning about their own beliefs. Although these formalisms are extensively studied from a theoretical point of view, most of these approaches lack generally available solvers thus far. In this paper, we show how variants of Moore's autoepistemic logic can be axiomatised by means of quantified Boolean formulas (QBFs). More specifically, we provide polynomial… 
Expressing default abduction problems as quantified Boolean formulas
TLDR
This paper provides polynomial-time constructible reductions mapping a given abduction problem into a quantified Boolean formula (QBF) such that the satisfying truth assignments to the free variables of the latter determine the solutions of the original problem.
Representing Paraconsistent Reasoning via Quantified Propositional Logic
TLDR
It is shown how certain paraconsistent reasoning principles can be naturally formulated or reformulated by means of quantified Boolean formulas, and polynomial-time constructible encodings providing axiomatisations of the given reasoning tasks are described.
Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems
TLDR
This paper shows how the family of corresponding paraconsistent consequence relations can be axiomatised by means of quantified Boolean formulas, furnishing an axiomatic specification of paracons consistent reasoning within the framework of signed systems.
Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas
TLDR
A generic approach to implement propositional argumentation frameworks by means of quantified Boolean formulas (QBFs) and the definition of suitable QBF modules provides us with a tool box in order to capture a broad range of reasoning tasks associated to formal argumentation.
Comparing Different Prenexing Strategies for Quantified Boolean Formulas
TLDR
Experimental results show that different prenexing strategies influence the evaluation time in different ways across different solvers, in particular, some solvers are robust to the chosen strategies while others are not.
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2
TLDR
This paper presents polynomial reductions of the main reasoning tasks associated with equilibrium logic and nested logic programs into quantified propositional Logic, an extension of classical propositional logic where quantifications over atomic formulas are permitted.
Decision Procedures for the Propositional Cases of Second Order Logic and Z Modal Logic Representations
Decision procedures for the propositional cases of two different logical representations for an L-Predicate Logic generalizing Autoepistemic Logic to handle quantified variables over modal scopes are
Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming
TLDR
This paper describes an approach to compute program correspondences in this general framework by means of linear-time constructible reductions to quantified propositional logic and describes how the translations provide a method to construct counterexamples in case a program correspondence does not hold.
Representation and Evaluation of QBFs in Prenex-NNF
TLDR
This paper shows how Zero-Suppressed Binary De-cision Diagram (abbreviated by ZBDD or ZDD) can be used to represent QBFs given in prenex-NNF and evaluatethem efficiently.
FZQSAT: A QSAT Solver for QBFs in Prenex NNF (A Useful Tool for Circuit Verification)
TLDR
This paper presents FZQSAT, which is an algorithm for evaluating quantified Boolean formulas presented in negation normal form (NNF), which manages to solve some standard QBF benchmark problems faster than best existing QSAT solvers.
...
...

References

SHOWING 1-10 OF 49 REFERENCES
Sequent calculi for propositional nonmonotonic logics
A uniform proof-theoretic reconstruction of the major nonmonotonic logics is introduced. It consists of analytic sequent calculi where the details of nonmonotonic assumption making are modelled by an
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas
TLDR
This work presents translations of several well-known reasoning tasks from the area of nonmonotonic reasoning into QBFs, and compares their implementation in the prototype system QUIP with established NMRprovers.
Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results
TLDR
Experimental results show reasonable performance of the QBF approach and indicate possible improvements of QUIP by exploiting different QBFsolvers as underlying inference engines.
Semantical Considerations on Nonmonotonic Logic
An Algorithm to Evaluate Quantified Boolean Formulae
TLDR
Evaluate, an algorithm for evaluating Quantified Boolean Formulae, a language that extends propositional logic in a way such that many advanced forms of propositional reasoning can be easily formulated as evaluation of a QBF, is proposed.
Encodings for Equilibrium Logic and Logic Programs with Nested Expressions
TLDR
The method to implement equilibrium logic and stable models for logic programs with nested expressions, based on polynomial reductions to quantified Boolean formulas (QBFs), yields a practically relevant approach to rapid prototyping.
Constructing Conditional Plans by a Theorem-Prover
TLDR
This paper approaches conditional planning from a new viewpoint that is motivated by the use of satisfiability algorithms in classical planning and translates conditional planning to quantified Boolean formulae in the propositional logic.
Improvements to the Evaluation of Quantified Boolean Formulae
TLDR
A number of techniques for reducing the amount of search that is needed are presented, and their effectiveness is evaluated by running the algorithm on a collection of formulae obtained from planning and generated randomly.
Default Reasoning System DeReS
TLDR
It is shown that a choice of a propositional prover is critical for the efficiency of DeReS, and a general technique is presented that eliminates the need for some global consistency checks and results in substantial speedups.
A Deductive System for Non-Monotonic Reasoning
TLDR
A thorough investigation of disjunctive Deductive Databases is a basic requirement for building systems which render previous foundational work on DDDBs useful for practice.
...
...