Tight Logic Programs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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 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.
To appear in Special Issue of the Theory and Practice of Logic Programming Journal on Answer Set Programming, 2003

Keywords

Artificial Intelligence, Logic in Computer Science, D.1.6; F.4.1; I.2.3

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/94834

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0302038
 http://arxiv.org/abs/cs/0302038
 Theory and Practice of Logic Programming, 3(4--5):499--518, 2003.

Collections

arXiv