Abstract: Knowledge-based systems use forms of reasoning that do not satisfy the monotonicity property of classical logical reasoning. Therefore, several nonmonotonic logics have been developed for the investigation of theoretical foundations of knowledge-based systems. This work investigates efficient inference procedures for knowledge representation using the framework of nonmonotonic logics. Recent results show that nonmonotonic reasoning cannot be brought to tractable level by restricting merely the form of the formulae. In this work the impact of the structural property of stratification on the complexity of nonmonotonic reasoning is investigated. Autoepistemic logic is used as the framework for establishing the results, because several other nonmonotonic formalisms can be embedded in it. The main result of the work is that in stratified cases the complexity of nonmonotonic reasoning is approximately the same as that of corresponding classical monotonic reasoning. This is shown by giving a general decision procedure for stratified autoepistemic theories and analyzing its complexity with respect to the complexity of the classical theorem-proving required. It turns out that for theories for which the classical theorem-proving is polynomial time, also the decision procedure runs in polynomial time. As an example of this, two tractable
|
2005
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
1224
|
Some philosophical problems from the standpoint of arti cial intelligence
– McCarthy, Hayes
- 1969
|
|
1177
|
A logic for default reasoning
– Reiter
- 1979
|
|
1126
|
The Stable Model Semantics for Logic Programming
– Gelfond, Lifschitz
- 1988
|
|
683
|
Circumscription - a form of nonmonotonic reasoning
– McCarthy
- 1980
|
|
557
|
Towards a theory of Declarative Knowledge
– Apt, Blair, et al.
- 1988
|
|
534
|
A truth maintenance system
– Doyle
- 1979
|
|
412
|
Applications of circumscription to formalizing common-sense knowledge
– McCarthy
- 1986
|
|
398
|
Semantical considerations on non-monotonic logic
– Moore
- 1985
|
|
320
|
A catalog of complexity classes
– Johnson
- 1990
|
|
211
|
On closed world data bases
– Reiter
- 1978
|
|
210
|
First-order logic
– Smullyan
- 1968
|
|
200
|
Unfounded sets and well-founded semantics for general logic programs
– Gelder, Ross, et al.
- 1991
|
|
189
|
Non-monotonic logic I
– McDermott, Doyle
- 1978
|
|
182
|
Autoepistemic logic
– Marek, Truszczynski
- 1991
|
|
170
|
Complexity results for nonmonotonic logics
– Gottlob
- 1992
|
|
133
|
Default reasoning, nonmonotonic logics and frame problem
– Hanks, McDermott
- 1986
|
|
126
|
On the relation between default and autoepistemic logic
– Konolige
- 1988
|
|
118
|
Negation as failure using tight derivations for general logic programs
– Gelder
- 1986
|
|
104
|
On Stratified Autoepistemic Theories
– Gelfond
- 1987
|
|
99
|
Generalized stable models: a semantics for abduction
– Kakas, Mancarella
- 1990
|
|
78
|
clause queries and generalizations
– Horn
- 1985
|
|
67
|
General logical databases and programs, default logic semantics, and stratification
– Bidoit, Froixdevaux
|
|
55
|
Semantic issues in deductive databases and logic programs
– Przymusinska
- 1990
|
|
48
|
Formalizing Nonmonotonic Reasoning Systems
– Etherington
- 1987
|
|
48
|
Relating autoepistemic and default logics
– Marek, Truszczyński
- 1989
|
|
45
|
The complexity of propositional default logics
– Stillman
- 1992
|
|
43
|
Rule-based systems
– Hayes-Roth
- 1985
|
|
39
|
A rational reconstruction of nonmonotonic truth maintenance systems
– Elkan
- 1990
|
|
33
|
A linear time algorithm for testing the truth of certain quantified boolean formulas
– Aspvall, Plass, et al.
- 1979
|
|
32
|
Depth rst search and linear graph algorithms
– Tarjan
- 1972
|
|
30
|
Autoepistemic logic and formalization of commonsense reasoning
– Gelfond
- 1988
|
|
27
|
Computing the extensions of autoepistemic and default logics with a truth maintenance system
– Junker, Konolige
- 1990
|
|
21
|
On the relation between autoepistemic logic and circumscription
– Konolige
- 1989
|
|
13
|
A note on non-monotonic modal logic
– Stalnaker
- 1993
|
|
11
|
Propositional semantics for default logic
– Ben-Eliyahu, Dechter
- 1992
|
|
9
|
Structural Complexity I
– Balczar, Daz, et al.
- 1988
|
|
9
|
Towards automatic autoepistemic reasoning
– Niemel
- 1990
|
|
6
|
Linear-time algorithms for testing the satisability of propositional Horn formulae
– Dowling, Gallier
- 1984
|
|
6
|
On the impact of stratication on the complexity of nonmonotonic reasoning
– Niemel, Rintanen
- 1992
|
|
5
|
Constructive tightly grounded autoepistemic reasoning
– Niemel
- 1991
|
|
5
|
It is not my default: the complexity of reasoning in default logic
– Stillman
- 1990
|
|
4
|
On the declarative semantics of Deductive Databases and
– Przymusinski
- 1988
|
|
4
|
The complexity of satisability problems
– Schaefer
- 1978
|
|
2
|
Inference in inheritance networks using propositional logic and constraints networks techniques
– Ben-Eliyahu, Dechter
- 1992
|
|
2
|
Polynomially solvable satisability problems
– Gallo, Scutell
- 1988
|
|
2
|
problems for simple default theories
– Hard
- 1991
|
|
2
|
Stratication and knowledge base management
– Lassez, McAloon, et al.
- 1987
|
|
2
|
Formalizing non-monotonic truth maintenance systems
– Urbanski
- 1988
|
