UTCS Artificial Intelligence
courses
talks/events
demos
people
projects
publications
software/data
labs
areas
admin
Tight Logic Programs (2003)
Esra Erdem
and
Vladimir Lifschitz
This note is about the relationship between two theories of negation as failure one based on program completion, the other based on stable models, or answer sets. Francois Fages showed that if a logic program satisfies a certain syntactic condition, which is now called "tightness," then its stable models can be characterized as the models of its com- pletion. We extend the definition of tightness, and Fages' theorem, to programs with nested expressions in the bodies of rules, and study tight logic programs containing the definition of the transitive closure of a predicate.
View:
PS
Citation:
Theory and Practice of Logic Programming
, Vol. 3 (2003), pp. 499-518.
Bibtex:
@Article{erd03, title={Tight Logic Programs}, author={Esra Erdem and Vladimir Lifschitz}, volume={3}, journal={Theory and Practice of Logic Programming}, pages={499-518}, url="http://www.cs.utexas.edu/users/ai-lab/?erd03", year={2003} }
People
Esra Erdem
Ph.D. Alumni
esraerdem [at] sabanciuniv edu
Vladimir Lifschitz
Faculty
vl [at] cs utexas edu
Areas of Interest
Answer Set Programming
Nonmonotonic Reasoning
Labs
Texas Action Group