Definitions in Answer Set Programming

  • Selim T. Erdoğan
  • Vladimir Lifschitz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2916)

Abstract

The work described here is motivated by our interest in the methodology of answer set programming (ASP). The idea of ASP is to solve a problem by writing a logic program the answer sets of which correspond to solutions.

References

  1. [Ferraris and Lifschitz, 2003]
    Ferraris, P., Lifschitz, V.: Weight constraints as nested expressions. Theory and Practice of Logic Programming (2003) (to appear), http://www.cs.utexas.edu/users/vl/papers/weight.ps
  2. [Lifschitz and Turner, 1994]
    Lifschitz, V., Turner, H.: Splitting a logic program. In: Van Hentenryck, P., (ed.) Proc. Eleventh Int’l Conf. on Logic Programming, pp. 23–37 (1994)Google Scholar
  3. [Lifschitz et al., 1999]
    Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence 25, 369–389 (1999)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Selim T. Erdoğan
    • 1
  • Vladimir Lifschitz
    • 1
  1. 1.Department of Computer SciencesUniversity of TexasAustinUSA

Personalised recommendations