Knowledge compilation of logic programs using approximation fixpoint theory

From MaRDI portal
Publication:4592990

DOI10.1017/S1471068415000162zbMATH Open1379.68045arXiv1507.06554OpenAlexW3104362192MaRDI QIDQ4592990FDOQ4592990


Authors: Bart Bogaerts, Guy Van den Broeck Edit this on Wikidata


Publication date: 9 November 2017

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

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.


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




Recommendations



Cites Work


Cited In (7)

Uses Software





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)