Fages' Theorem and Answer Set Programming

Simple item page
dc.creatorBabovich, Yuliya
dc.creatorErdem, Esra
dc.creatorLifschitz, Vladimir
dc.date2000-03-09
dc.date.accessioned2026-07-07T03:16:02Z
dc.date.available2026-07-07T03:16:02Z
dc.descriptionWe generalize a theorem by Francois Fages that describes the relationship between the completion semantics and the answer set semantics for logic programs with negation 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 Niemelae is discussed as an example.
dc.identifierhttps://arxiv.org/abs/cs/0003042
dc.identifierhttp://arxiv.org/abs/cs/0003042
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30202
dc.subjectArtificial Intelligence
dc.subjectI.2.4
dc.titleFages' Theorem and Answer Set Programming
dc.typetext

Files

Collections

arXiv