In this paper, we review recent work aimed at the application of declarative logic programming to knowledge representation in artificial intelligence. We consider extensions of the language of definite logic programs by classical (strong) negation, disjunction, and some modal operators and show how each of the added features extends the representational power of the language. We also discuss extensions of logic programming allowing abductive reasoning, meta-reasoning and reasoning in open domains. We investigate the methodology of using these languages for representing various forms of nonmonotonic reasoning and for describing knowledge in specific domains. We also address recent work on properties of programs needed for sucessful applications of this methodology such as consistency, categoricity and complexity. 1 Contents 1 Introduction 1 1.1 Historical Perspective : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 1.2 Structure of the Paper : : : : : : : : :...
|
1626
|
Foundations of Logic Programming
– Lloyd
- 1984
|
|
1220
|
Some philosophical problems from the standpoint of artificial intelligence
– McCarthy, Hayes
- 1969
|
|
1163
|
A logic for default reasoning
– Reiter
- 1980
|
|
1122
|
The Stable Model Semantics for Logic Programming
– GELFOND, LIFSCHITZ
- 1988
|
|
773
|
Negation as failure
– Clark
- 1978
|
|
685
|
The Well-Founded Semantics for General Logic Programs
– Gelder, Ross, et al.
- 1991
|
|
681
|
Circumscription - a form of nonmonotonic reasoning
– McCarthy
- 1980
|
|
679
|
A theory of diagnosis from first principles
– Reiter
- 1987
|
|
604
|
The semantics of Predicate Logic as a Programming Language
– Emden, Kowalski
- 1976
|
|
567
|
Classical Negation in Logic Programs and Disjunctive Databases
– Gelfond, Lifschitz
|
|
542
|
Towards a Theory of Declarative Knowledge
– Apt, Blair, et al.
- 1988
|
|
538
|
A truth maintenance system
– Doyle
- 1979
|
|
460
|
ALogic-Based Calculus of Events
– Kowalski, Sergot
- 1986
|
|
411
|
Applications of circumscription to formalizing commonsense reasoning
– McCarthy
|
|
396
|
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
– Dung
- 1995
|
|
396
|
Abductive Logic Programming
– KAKAS, KOWALSKI, et al.
- 1992
|
|
388
|
Semantical considerations on nonmonotonic logic
– Moore
- 1985
|
|
366
|
Logic programming
– Apt
- 1990
|
|
330
|
A Logical Framework for Default Reasoning
– Poole
- 1988
|
|
324
|
A Kripke-Kleene Semantics for Logic Programs
– Fitting
- 1985
|
|
323
|
Logic for Problem Solving
– Kowalski
- 1979
|
|
292
|
Logic Programs with classical negation
– Gelfond, Lifschitz
- 1990
|
|
280
|
Computing Circumscription
– Lifschitz
- 1985
|
|
266
|
Programs with common sense
– McCarthy
- 1959
|
|
226
|
Nonmonotonic logic and temporal projection
– Hanks, McDermott
- 1987
|
|
225
|
On the Declarative Semantics of Deductive Databases and Logic Programs
– Rondogiannis, Przymusinski, et al.
- 1988
|
|
214
|
On closed world data bases
– Reiter
- 1978
|
|
210
|
Negation in Logic Programming
– Kunen
- 1987
|
|
196
|
Non-monotonic logic I
– McDermott, Doyle
- 1980
|
|
193
|
What does a conditional knowledge base entail
– Lehmann, Magidor
- 1992
|
|
193
|
Unfold/fold transformation of logic programs
– Tamaki, Sato
- 1984
|
|
178
|
OLDT resolution with tabulation
– Tamaki, Sato
- 1986
|
|
177
|
The Alternating Fixpoint of Logic Programs with Negation
– Gelder
- 1993
|
|
176
|
Abduction compare with negation as failure
– Eshghi, Kowalski
- 1989
|
|
173
|
Mathematical logic
– Shoenfield
- 1967
|
|
171
|
Overview of Disjunctive Logic Programming
– Minker
- 1994
|
|
165
|
HiLog: A foundation for higher-order logic programming
– Chen, Kifer, et al.
- 1993
|
|
165
|
Autoepistemic logic
– Marek, Truszczyński
- 1991
|
|
161
|
Complexity results for nonmonotonic logics
– Gottlob
- 1992
|
|
158
|
Theoretical Foundations for Non-monotonic Reasoning in Expert Systems." Appearing in
– Gabbay
- 1985
|
|
155
|
Acyclic programs
– Apt, Bezem
- 1990
|
|
148
|
On the Relationship Between Abduction and Deduction
– CONSOLE, DUPRÉ, et al.
- 1991
|
|
147
|
The Mathematics of Inheritance Systems
– Touretzky
- 1986
|
|
128
|
On the complexity of propositional knowledge base revision, updates and counterfactuals
– Eiter, Gottlob
- 1992
|
|
125
|
Prediction is deduction but explanation is abduction
– Shanahan
- 1989
|
|
124
|
The complexity of logic-based abduction
– Eiter, Gottlob
- 1995
|
|
122
|
Propositional semantics for disjunctive logic programs
– Ben-Eliyahu, Dechter
- 1994
|
|
120
|
Well-founded Semantics Coincides With Three-Valued Stable Semantics
– Przymusinski
- 1990
|
|
118
|
Every Logic Program has a Natural Stratification and an Iterated Fixed Point Model
– Przymusinski
- 1989
|
|
118
|
Stable models and non-determinism in logic programs with negation
– Sacca, Zaniolo
- 1990
|
|
