Document Type

Conference Proceeding

Publication Date

2000

Abstract

We generalize a theorem by François Fages that describes the relationship between the completion semantics and the answer set semantics for logic programs with negotiation as failure. The study of this relationship is important in connection with the emergence of answer set programming. Whenever the two semantics are equivalent, answer sets can be computed by a satisfiability solver, and the use of answer set solvers such as SMODELS and DLV is unnecessary. A logic programming representation of the blocks world due to Ilkka Niemelä is discussed as an example.

Comments

8th International Workshop on Non-Monotonic Reasoning (NMR): Declarative Processes and Systems Sub-Workshop

Download

Share

COinS