(Enter summary)
Abstract: Termination of logic programs with negated body atoms (here called general logic
programs) is an important topic. One reason is that many computational mechanisms
used to process negated atoms, like Clark's negation as failure and Chan's constructive
negation, are based on termination conditions. This paper introduces a methodology for
proving termination of general logic programs w.r.t. the Prolog selection rule. The idea is to
distinguish parts of the program depending on whether or not their ... (Update)
Context of citations to this paper: More
.... novel methodology that overcomes some of the difficulties of this method due to the use of the semantic information, has been introduced in [22]. In [30] a sufficient criterion for termination of normal logic programs is presented. This criterion suffers from the same drawback...
Cited by: More
Proving Existential Termination of Normal Logic Programs - Marchiori (1996)
(Correct)
Similar documents (at the sentence level):
9.4%: A Methodology for Proving Termination of General Logic Programs - Marchiori (1995)
(Correct)
Active bibliography (related documents): More All
0.5: Acceptable Programs Revisited - Hitzler, Seda (1999)
(Correct)
0.3: Reasoning about Physical Systems with the Situation Calculus - Kelley (1995)
(Correct)
0.3: Goals and Rational Action in the Situation.. - Shapiro.. (1995)
(Correct)
Similar documents based on text: More All
0.1: An account of negated sentences in the DRT framework - Amsili, Le Draoulec (1996)
(Correct)
0.1: Formal and Lexical Semantics and the Genitive in Negated.. - Borschev, al. (1997)
(Correct)
0.1: The Morphosyntax of Polish Verbal Negation: Towards an HPSG Account - Kupsc (1999)
(Correct)
BibTeX entry: (Update)
E. Marchiori. Practical methods for proving termination of general logic programs. The Journal of Artificial Intelligence Research, 1996. To appear. http://citeseer.ist.psu.edu/marchiori96practical.html More
@article{ marchiori96practical,
author = "Elena Marchiori",
title = "Practical Methods for Proving Termination of General Logic Programs",
journal = "Journal of Artificial Intelligence Research",
volume = "4",
pages = "179-208",
year = "1996",
url = "citeseer.ist.psu.edu/marchiori96practical.html" }
Citations (may not include all citations):
440
The Art of Prolog (context) - Sterling, Shapiro - 1994
410
Principles of Artificial Intelligence (context) - Nilsson - 1982
180
Logic programming and negation: a survey
- Apt, Bol - 1994
149
Logic programming and knowledge representation
- Baral, Gelfond - 1994
129
Termination of rewriting (context) - Dershowitz - 1987
127
PROLOG Programming for Artificial Intelligence (context) - Bratko - 1986
109
Constructive negation based on the completed database (context) - Chan - 1988
78
Acyclic programs (context) - Apt, Bezem - 1991
77
Termination of logic programs: The never-ending story (context) - De Schreye, Decorte - 1994
41
Proving termination of general prolog programs (context) - Apt, Pedreschi - 1991
33
Negation as failure as an approach to the hanks and mcdermot.. (context) - Evans - 1990
3
Some philosophical problems from the standpoint of artificia.. (context) - of, Programming et al. - 1969
2
A methodology for proving termination of general logic progr..
- Marchiori - 1995
1
Logic and Databases (context) - Clark - 1978
Documents on the same site (http://www.cs.washington.edu/research/jair/contents/complete-with-abstracts.html): More
A Uniform Framework for Concept Definitions in Description.. - De Giacomo, Lenzerini (1997)
(Correct)
Lifeworld Analysis - Agre, Horswill (1997)
(Correct)
The Design and Experimental Analysis of Algorithms for.. - van Beek, Manchak (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC