论文信息 - The Complexity of Closed World Reasoning and Circumscription

The Complexity of Closed World Reasoning and Circumscription

Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the computational complexity of the different forms of closed world reasoning for various fragments of propositional logic. The analysis allows us to draw a complete picture of the tractability/ intractability frontier for such a form of nonmonotonic reasoning. We also discuss how to use our results in order to characterize the computational complexity of other problems related to nonmonotonic inheritance, diagnosis, and default reasoning.

Maurizio Lenzerini | Marco Cadoli | M. Lenzerini | Marco Cadoli

[1] Hector J. Levesque,et al. Hard problems for simple default logics , 1992 .

[2] Teodor C. Przymusinski. An Algorithm to Compute Circumscription , 1989, Artif. Intell..

[3] John S. Schlipf,et al. When is Closed World Reasoning Tractable? , 1988, International Syposium on Methodologies for Intelligent Systems.

[4] Jean-Marie Jacquet,et al. Introduction to Logic Programming , 1993, ICLP Workshop on Construction of Logic Programs.

[5] Hector J. Levesque,et al. The Tractability of Path-Based Inheritance , 1989, IJCAI.

[6] John McCarthy,et al. Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[7] Jack Minker,et al. On Indefinite Databases and the Closed World Assumption , 1987, CADE.

[8] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.

[9] Dean Allemang,et al. Some Results Concerning the Computational Complexity of Abduction , 1989, KR.

[10] Michael Gelfond,et al. Negation as Failure: Careful Closure Procedure , 1986, Artif. Intell..

[11] Raymond Reiter,et al. A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[12] Raymond Reiter. On Closed World Data Bases , 1977, Logic and Data Bases.

[13] Teodor C. Przymusinski,et al. On the Relationship Between Circumscription and Negation as Failure , 1989, Artif. Intell..