Skip to main content
Article thumbnail
Location of Repository

Computing Answer Sets of a Logic Programvia-enumeration of SAT certificates

By 

Abstract

Abstract Answer set programming is a new programming paradigm proposed in [1] and [2], andbased on the answer set semantics of Prolog [3]. It is well known that an answer set for a logic program is also a model of the program's completion [4]. The converse is true whenthe logic program is "tight " [6, 5]. Lin and Zhao [7] showed that for non-tight programs the models of completion which do not correspond to answer sets can be eliminated byadding to the completion what they called "loop formulas". Nevertheless, their solver ASSAT1 has some disadvantages: it can work only with basic rules, and it can computeonly one answer set. Answer set solver CMODELS-12 [12] is a system that computesanswer sets for logic programs that are tight or can be transformed into tight programs, and does not suffer from these limitations.We are going to present a new syste

Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.133.9015
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.mrg.dist.unige.it/~... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.