Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases

Sylvie Coste-Marquis, Pierre Marquis. Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases. In Thomas Dean, editor, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 99, Stockholm, Sweden, July 31 - August 6, 1999. 2 Volumes, 1450 pages. pages 24-29, Morgan Kaufmann, 1999.

Abstract

Abstract is missing.