Document Open Access Logo

Circumscription and Projection as Primitives of Logic Programming

Author Christoph Wernhard

Thumbnail PDF


  • Filesize: 338 kB
  • 10 pages

Document Identifiers

Author Details

Christoph Wernhard

Cite AsGet BibTex

Christoph Wernhard. Circumscription and Projection as Primitives of Logic Programming. In Technical Communications of the 26th International Conference on Logic Programming. Leibniz International Proceedings in Informatics (LIPIcs), Volume 7, pp. 202-211, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)


KWe pursue a representation of logic programs as classical first-order sentences. Different semantics for logic programs can then be expressed by the way in which they are wrapped into - semantically defined - operators for circumscription and projection. (Projection is a generalization of second-order quantification.) We demonstrate this for the stable model semantics, Clark's completion and a three-valued semantics based on the Fitting operator. To represent the latter, we utilize the polarity sensitiveness of projection, in contrast to second-order quantification, and a variant of circumscription that allows to express predicate minimization in parallel with maximization. In accord with the aim of an integrated view on different logic-based representation techniques, the material is worked out on the basis of first-order logic with a Herbrand semantics.


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail