Hostname: page-component-586b7cd67f-dsjbd Total loading time: 0 Render date: 2024-11-27T11:59:46.906Z Has data issue: false hasContentIssue false
  • English
  • Français

Tight logic programs

Published online by Cambridge University Press:  31 July 2003

ESRA ERDEM  and
VLADIMIR LIFSCHITZ
ESRA ERDEM
Affiliation:
Department of Computer Science, University of Toronto, 6 King's College Road, Toronto, ON M5S 3H5, Canada (e-mail: [email protected])
VLADIMIR LIFSCHITZ
Affiliation:
Department of Computer Sciences, University of Texas at Austin, Austin, TX 78712, USA (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

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. François 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 completion. 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.

Type
Regular Papers
Information
Theory and Practice of Logic Programming , Volume 3 , Issue 4-5 , July 2003 , pp. 499 - 518
Copyright
© 2003 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)