Abstract Recent advances in knowledge compilation introduced techniques to compile 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 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.

@article{BogaertsICLP15,
  author = {Bogaerts, Bart and Van den Broeck, Guy},
  title = {Knowledge Compilation of Logic Programs Using Approximation Fixpoint Theory},
  journal = {Theory and Practice of Logic Programming},
  volume = {15},
  issue = {Special Issue 4-5},
  month = {7},
  year = {2015},
  issn = {1475-3081},
  pages = {464--480},
  numpages = {17},
  doi = {10.1017/S1471068415000162},
  url       = {http://starai.cs.ucla.edu/papers/BogaertsICLP15.pdf},
  keywords   = {journal}
}