Encodings for Equilibrium Logic and Logic Programs with Nested Expressions

  • David Pearce
  • Hans Tompits
  • Stefan Woltran
Conference paper

DOI: 10.1007/3-540-45329-6_31

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2258)
Cite this paper as:
Pearce D., Tompits H., Woltran S. (2001) Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. In: Brazdil P., Jorge A. (eds) Progress in Artificial Intelligence. EPIA 2001. Lecture Notes in Computer Science, vol 2258. Springer, Berlin, Heidelberg

Abstract

Equilibrium logic is an approach to nonmonotonic reasoning that generalises the stable model and answer set semantics for logic programs. We present a method to implement equilibrium logic and, as a special case, stable models for logic programs with nested expressions, based on polynomial reductions to quantified Boolean formulas (QBFs). Since there now exist efficient QBF-solvers, this reduction technique yields a practically relevant approach to rapid prototyping. The reductions for logic programs with nested expressions generalise previous results presented for other types of logic programs. We use these reductions to derive complexity results for the systems in question. In particular, we show that deciding whether a program with nested expressions has a stable model is Σin2sup complete.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • David Pearce
    • 1
  • Hans Tompits
    • 2
  • Stefan Woltran
    • 2
  1. 1.European Commission, DG Information SocietyFuture and Emerging TechnologiesUK
  2. 2.Institut für Informationssysteme, Abt.Wissensbasierte Systeme 184/3Technische UniversitätWienViennaAustria

Personalised recommendations