Datalog Programs and Their Stable Models

  • Vladimir Lifschitz
Conference paper

DOI: 10.1007/978-3-642-24206-9_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6702)
Cite this paper as:
Lifschitz V. (2011) Datalog Programs and Their Stable Models. In: de Moor O., Gottlob G., Furche T., Sellers A. (eds) Datalog Reloaded. Lecture Notes in Computer Science, vol 6702. Springer, Berlin, Heidelberg

Abstract

This paper is about the functionality of software systems used in answer set programming (ASP). ASP languages are viewed here, in the spirit of Datalog, as mechanisms for characterizing intensional (output) predicates in terms of extensional (input) predicates. Our approach to the semantics of ASP programs is based on the concept of a stable model defined in terms of a modification of parallel circumscription.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Vladimir Lifschitz
    • 1
  1. 1.Department of Computer ScienceUniversity of Texas at AustinUSA

Personalised recommendations