Knowledge compilation of logic programs using approximation fixpoint theory
From MaRDI portal
Publication:4592990
Abstract: To appear in Theory and Practice of Logic Programming (TPLP), Proceedings of ICLP 2015 Recent advances in knowledge compilation introduced techniques to compile emph{positive} logic programs into propositional logic, essentially exploiting the constructive nature of the least fixpoint computation. This approach has several advantages over existing approaches: it maintains logical equivalence, does not require (expensive) loop-breaking preprocessing or the introduction of auxiliary variables, and significantly outperforms existing algorithms. Unfortunately, this technique is limited to emph{negation-free} programs. In this paper, we show how to extend it to general logic programs under the well-founded semantics. We develop our work in approximation fixpoint theory, an algebraical framework that unifies semantics of different logics. As such, our algebraical results are also applicable to autoepistemic logic, default logic and abstract dialectical frameworks.
Recommendations
Cites work
- scientific article; zbMATH DE number 4199656 (Why is no real title available?)
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- scientific article; zbMATH DE number 1368933 (Why is no real title available?)
- A Tarskian informal semantics for answer set programming
- ASSAT: computing answer sets of a logic program by SAT solvers
- Approximating operators and semantics for abstract dialectical frameworks
- Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
- Computing Stable Models via Reductions to Difference Logic
- Datalog extensions for database queries and updates
- Fixpoint semantics for logic programming a survey
- Graph-Based Algorithms for Boolean Function Manipulation
- Hex semantics via approximation fixpoint theory
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Knowledge compilation and theory approximation
- On notation for ordinal numbers
- On probabilistic inference by weighted model counting
- Ordered completion for first-order logic programs on finite structures
- Propositional semantics for disjunctive logic programs
- Some (in)translatability results for normal logic programs and propositional theories
- The Semantics of Predicate Logic as a Programming Language
- The well-founded semantics for general logic programs
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
- Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions
- Well-founded and stable semantics of logic programs with aggregates
- Why are there so many loop formulas?
Cited in
(7)- A kind of logical compilation for knowledge bases
- Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT
- Compact representation of knowledge bases in inductive logic programming
- \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
- Embedding justification theory in approximation fixpoint theory
- IASCAR: incremental answer set counting by anytime refinement
- IASCAR: incremental answer set counting by anytime refinement
This page was built for publication: Knowledge compilation of logic programs using approximation fixpoint theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4592990)
