(Enter summary)
Abstract: We propose a new declarative semantics for logic programs with negation. Its formulation is quite simple; at the same time, it is more general than the iterated fixed point semantics for stratified programs, and is applicable to some useful programs that are not stratified. (Update)
Cited by: More
Creating Objects in the Flexible Authorization - Framework Nicola Zannone
(Correct)
Security and Trust Requirements Engineering - Paolo Giorgini Fabio
(Correct)
Expressing preferences declaratively in logic-based.. - Costantini..
(Correct)
Active bibliography (related documents): More All
0.5: Quantitative Deduction And Its Fixpoint Theory - van Emden (1986)
(Correct)
0.1: Many-Valued Disjunctive Logic Programs with Probabilistic.. - Lucasiewicz (1999)
(Correct)
0.1: Verifying CTL Properties of Infinite State Systems.. - Fioravanti.. (2001)
(Correct)
Similar documents based on text: More All
0.2: Autoepistemic Logic and Introspective Circumscription - Gelfond, Lifschitz, al.
(Correct)
0.2: Reasoning about Actions with SLG - Lifschitz, McCain, Turner (1993)
(Correct)
0.2: Splitting a Logic Program - Lifschitz, Turner (1994)
(Correct)
Related documents from co-citation: More All
42: The Well-Founded Semantics for General Logic Programs
- Van Gelder, Ross et al. - 1991
35: Negation as Failure (context) - Clark - 1978
33: Foundations of Logic Programming (context) - Lloyd - 1987
BibTeX entry: (Update)
Gelfond, M., and V. Lifschitz. 1988. The Stable Model Semantics for Logic Programming. In Proceedings of the 5th International Conference on Logic Programming, 1070--1080. Seattle, USA, August. The MIT Press. http://citeseer.ist.psu.edu/gelfond88stable.html More
@inproceedings{ gelfond88stable,
author = "Michael Gelfond and Vladimir Lifschitz",
title = "The Stable Model Semantics for Logic Programming",
booktitle = "Proceedings of the Fifth International Conference on Logic Programming",
publisher = "The {MIT} Press",
address = "Cambridge, Massachusetts",
editor = "Robert A. Kowalski and Kenneth Bowen",
pages = "1070--1080",
year = "1988",
url = "citeseer.ist.psu.edu/gelfond88stable.html" }
Citations (may not include all citations):
435
Towards a theory of declarative knowledge (context) - Apt, Blair et al. - 1988
311
Semantical considerations on nonmonotonic logic (context) - Moore - 1985
297
Applications of circumscription to formalizing commonsense k..
- McCarthy - 1986
248
The semantics of predicate logic as a programming language (context) - van Emden, Kowalski - 1976
118
Unfounded sets and well-founded semantics for general logic .. (context) - Van Gelder, Ross et al. - 1988
94
the relation between default and autoepistemic logic (context) - Konolige - 1987
90
Horn clause queries and generalizations (context) - Chandra, Harel - 1985
67
Negation as failure using tight derivations for general logi.. (context) - Van Gelder - 1988
52
the declarative semantics of logic programs with negation (context) - Lifschitz - 1988
38
Design overview of the NAIL (context) - Morris, Ullman et al. - 1986
12
On stratied autoepistemic theories (context) - Gelfond - 1987
11
Stable Theories in Autoepistemic Logic (context) - Marek - 1986
6
the declarative semantics of stratied deductive databases an.. (context) - Przymusinski - 1988
2
The logic of two-person games (context) - van Emden, Clark - 1984
1
personal communication (context) - Przymusinski - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://net.cs.utexas.edu/users/vl/papers.html): More
Representing Transition Systems by Logic Programs - Lifschitz, Turner (1999)
(Correct)
Answer Set Programming and Plan Generation - Lifschitz (2002)
(Correct)
Fluents with Numerical Values - Lee, Lifschitz (2000)
(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