Annals of Mathematics and Artificial Intelligence

, Volume 25, Issue 3, pp 369–389

Nested expressions in logic programs

  • Vladimir Lifschitz
  • Lappoon R. Tang
  • Hudson Turner
Article

DOI: 10.1023/A:1018978005636

Cite this article as:
Lifschitz, V., Tang, L.R. & Turner, H. Annals of Mathematics and Artificial Intelligence (1999) 25: 369. doi:10.1023/A:1018978005636

Abstract

We extend the answer set semantics to a class of logic programs with nested expressions permitted in the bodies and heads of rules. These expressions are formed from literals using negation as failure, conjunction (,) and disjunction (;) that can be nested arbitrarily. Conditional expressions are introduced as abbreviations. The study of equivalent transformations of programs with nested expressions shows that any such program is equivalent to a set of disjunctive rules, possibly with negation as failure in the heads. The generalized answer set semantics is related to the Lloyd–Topor generalization of Clark’s completion and to the logic of minimal belief and negation as failure.

Copyright information

© Kluwer Academic Publishers 1999

Authors and Affiliations

  • Vladimir Lifschitz
    • 1
  • Lappoon R. Tang
    • 1
  • Hudson Turner
    • 2
  1. 1.Department of Computer SciencesUniversity of Texas at AustinAustinUSA
  2. 2.Department of Computer ScienceUniversity of Minnesota at DuluthDuluthUSA

Personalised recommendations