(Enter summary)
Abstract: this paper is to illustrate applications of some recent developments
in the theory of logic programming to knowledge representation and reasoning
in common sense domains. We are especially interested in better understanding the
process of development of such representations together with their specifications (Update)
Similar documents (at the sentence level):
58.4%: Building a Knowledge Base: An Example - Gelfond, Gabaldon (1999)
(Correct)
10.9%: From Functional Specifications to Logic Programs - Michael Gelfond
(Correct)
Active bibliography (related documents): More All
0.8: Representing Knowledge in A-Prolog - Gelfond (2001)
(Correct)
0.4: An Argument-Based Approach to Reasoning with Specificity - Dung, Son (2001)
(Correct)
0.4: Default Reasoning with Specificity - Dung, Son
(Correct)
Similar documents based on text: More All
0.7: Towards a Systematic Approach to Representing Knowledge in.. - Michael Gelfond
(Correct)
0.5: Towards a Theory of Elaboration Tolerance: Logic.. - Gelfond, Przymusinska (1995)
(Correct)
0.4: Formalizing Narratives Using Nested Circumscription - Baral, Gabaldon, Provetti (1998)
(Correct)
BibTeX entry: (Update)
@article{ gelfond99building,
author = "Michael Gelfond and Alfredo Gabaldon",
title = "Building a Knowledge Base: An Example",
journal = "Annals of Mathematics and Artificial Intelligence",
volume = "25",
number = "3-4",
pages = "165-199",
year = "1999",
url = "citeseer.ist.psu.edu/article/gelfond00building.html" }
Citations (may not include all citations):
858
The stable model semantics for logic programming
- Gelfond, Lifschitz - 1988
850
A Logic for Default Reasoning (context) - Reiter
759
Negation as failure (context) - Clark - 1978
435
Towards a theory of declarative knowledge (context) - Apt, Blair et al. - 1988
374
Classical negation in logic programs and disjunctive databas..
- Gelfond, Lifschitz - 1991
295
On closed world data bases (context) - Reiter - 1978
270
Logic programs with classical negation (context) - Gelfond, Lifschitz - 1990
234
The well-founded semantics for general logic programs
- Van Gelder, Ross et al. - 1991
149
Logic programming and knowledge representation
- Baral, Gelfond - 1994
110
Well-founded semantics for logic programs with explicit nega.. (context) - ereira, Alferes - 1992
109
Constructive Negation Based on the Completed Databases (context) - Chan - 1988
107
The mathematics of inheritance systems (context) - Touretzky - 1986
91
Splitting a Logic Program
- Lifschitz, Turner - 1994
82
Signed data dependencies in logic programs (context) - Kunen - 1989
79
Logic Programming: systematic program development (context) - Deville - 1990
74
A skeptical theory of inheritance in nonmonotonic semantic n.. (context) - Horty, Thomason et al. - 1990
64
A deductive system for nonmonotonic reasoning
- Eiter, Leone et al. - 1997
60
Efficient implementation of the well-founded and stable mode..
- Niemela, Simons - 1996
54
Consistency of Clark's completion and existence of stable mo..
- Fages - 1994
48
Efficient top-down computation of queries under the well-fou..
- Chen, Swift et al. - 1995
47
Some direct theories of non-monotonic inheritance (context) - Horty - 1994
46
On inheritance hierarchies with exceptions (context) - Etherington, Reiter - 1983
41
Proving termination in general Prolog programs (context) - Apt, Pedreschi - 1991
39
i and J. Maluszynski. AND-parallelism with intelligent backt.. (context) - Dembinsk - 1985
38
Foundations of logic programming
- Lifschitz - 1996
38
Minimalism subsumes default logic and circumscription (context) - Bidoit, Froidevaux - 1987
34
Restricted Monotonicity
- Lifschitz - 1993
25
The relationship between logic program semantics and non--mo.. (context) - Marek, Subrahmanian - 1989
24
Resolving ambiguity in non-monotonic inheritance hierarchies (context) - Stein - 1992
23
Default reasoning system DeReS
- Cholewinski, Marek et al. - 1996
18
Signed Logic Programs
- Turner - 1994
14
A monotonicity theorem for extended logic programs
- Turner - 1993
13
A study of nonmonotonic reasoning (context) - Lin - 1991
10
Language Independence and Language Tolerance in Logic Progra..
- McCain, Turner - 1994
9
A completeness result for SLDNF-resolution (context) - Stroetmann - 1993
9
Towards a theory of elaboration tolerance: logic programming..
- Gelfond, Przymusinska - 1996
7
Extending Prolog with Nonmonotonic Reasoning
- Chen - 1996
7
the Occur-check Free Logic Programs (context) - Apt, Pellegrini - 1994
6
From functional specifications to logic programs
- Gelfond, Gabaldon
6
and logic programming (context) - Dung, Son et al. - 1995
6
On consistency and completeness of autoepistemic theories (context) - Gelfond, Przymusinska - 1992
5
Lecture Notes in Artificial Intelligence (context) - Alferes, Pereira et al. - 1996
5
A default interpretation of defeasible network
- Wang, You et al. - 1997
5
An argumentation-theoretic approach to reasoning with specif..
- Dung, Son - 1996
4
Expanding queries to incomplete databases by interpolating g..
- Baral, Gelfond et al. - 1998
2
On constructive negation in logic programming (context) - Przymusinki - 1989
1
Fundamenta Informaticae (context) - Inheritance, autoepistemic - 1990
Documents on the same site (http://www.cs.toronto.edu/~alfredo/papers.html): More
Non-Markovian Control in the Situation Calculus - Gabaldon (2000)
(Correct)
Formalizing Narratives Using Nested Circumscription - Baral, Gabaldon, Provetti (1998)
(Correct)
Formalizing Narratives using Nested Circumscription - Chitta Baral (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