Knowledge compilation of logic programs using approximation fixpoint theory

DOI10.1017/S1471068415000162zbMath1379.68045arXiv1507.06554OpenAlexW3104362192MaRDI QIDQ4592990

Guy Van den Broeck, Bart Bogaerts

Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.06554

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Theory of compilers and interpreters (68N20) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (3)

\(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs ⋮ Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT ⋮ IASCAR: incremental answer set counting by anytime refinement

Uses Software

• ASSAT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ordered completion for first-order logic programs on finite structures
• Approximating operators and semantics for abstract dialectical frameworks
• Ultimate approximation and its application in nonmonotonic knowledge representation systems
• ASSAT: computing answer sets of a logic program by SAT solvers
• Datalog extensions for database queries and updates
• Fixpoint semantics for logic programming a survey
• Propositional semantics for disjunctive logic programs
• On probabilistic inference by weighted model counting
• Hex Semantics via Approximation Fixpoint Theory
• Well-founded and stable semantics of logic programs with aggregates
• Computing Stable Models via Reductions to Difference Logic
• Some (in)translatability results for normal logic programs and propositional theories
• Graph-Based Algorithms for Boolean Function Manipulation
• The Semantics of Predicate Logic as a Programming Language
• The well-founded semantics for general logic programs
• Knowledge compilation and theory approximation
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• Why are there so many loop formulas?
• A Tarskian Informal Semantics for Answer Set Programming
• Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions
• On notation for ordinal numbers

This page was built for publication: Knowledge compilation of logic programs using approximation fixpoint theory