Download now Free registration required
The class of non-monotonic logic programs under the answer-set semantics, with which the authors are dealing with in this paper, represents the canonical and, due to the availability of efficient answer-set solvers, arguably most widely used approach to Answer-Set Programming (ASP). The latter is based on the idea that problems are encoded in terms of theories such that the solutions of a given problem are determined by the models ("Answer sets") of the corresponding theory. In previous work, a general framework for specifying correspondences between logic programs under the answer-set semantics has been introduced.
- Format: PDF
- Size: 66.2 KB