Complexity results for propositional closed world reasoning and circumscription from tractable knowledge bases

IJCAI International Joint Conference on Artificial Intelligence

Volumn 1, Issue , 1999, Pages 24-29

  Coste Marquis, Sylvie ^a   Marquis, Pierre ^a  

^a UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY RESULTS; HORN FORMULAS; KNOWLEDGE BASIS; KNOWLEDGE BASIS (KBS); KNOWLEDGE COMPILATION; TARGET CLASS;

ARTIFICIAL INTELLIGENCE;

EID: 0003319357     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. R. Ben-Eliyahu and R. Dechter. Default reasoning using classical logic. Artificial Intelligence,84:113-150,1996. (Pubitemid 126365323)
2. A. Blake. Canonical expressions in boolean algebra. PhD thesis, University of Chicago, Chicago (IL), 1937.
3. Y. Boufkhad, E. Gregoire, P. Marquis, B. Mazure, and L. SaSs. TVactable cover compilations. In Proc. of IJCAP97, pages 122-127, Nagoya, 1997.
4. Y. Boufkhad. Algorithms for propositional KB approximation. In Proc. of AAAI98, pages 280-285, Madison (WI), 1998.
5. M. Cadoli and F.M. Donini. A survey on knowledge compilation. AI Communications, 1998. (in press).
6. M. Cadoli and M. Lenzerini. The complexity of propositional closed world reasoning and circumscription. Journal of Computer and System Sciences, 48:255-310,1994. (Pubitemid 124013291)
7. M. Cadoli, F.M. Donini, and M. Schaerf. Is intractability of non-monotonic reasoning a real drawback? Artificial Intelligence, 88:215-251, 1996. (Pubitemid 126371543)
8. M. Cadoli, F.M. Donini, P. Liberatore, and M. Schaerf. Preprocessing of intractable problems. Technical Report DIS 24-97, Dipartimento di Informatica e Sistemistica, University di Roma "La Sapienza", 1997.
9. M. Cadoli, F.M. Donini, M. Schaerf, and R. Silvestri. On compact representations of propositional circumscription. Theoretical Computer Science, 182:183-202,1997. (Pubitemid 127455848)
10. Th. Castell, C. Cayrol, M. Cayrol, and D. Le Berre. Using the Davis and Putnam procedure for an efficient computation of preferred models. In Proc. of ECAV96, pages 350-354, Budapest, 1996.
11. S. Coste-Marquis and P. Marquis. Complexity results for propositional closed world reasoning and circumscription from tractable knowledge bases. Technical fteport 99-SC/PM-01, CRIL, University d'Artois, 1999.
12. W. Dowling and J.H. Gallier. Linear time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming, 1(3):267-284,1984. (Pubitemid 15564552)
13. Th. Eiter and G. Gottlob. Propositional circumscription and extended closed-world reasoning are -complete. Theoretical Computer Science, 114:231-245,1993.
14. M. Gelfond and H. Przymusinska. Negation as failure: careful closure procedure. Artificial Intelligence, 30:273-287,1986. (Pubitemid 17491949)
15. M. Gelfond, H. Przymusinska, and T. Przymusinski. On the relationship between circumscription and negation as failure. Artificial Intelligence, 38:49-73, 1989.
16. H.A. Kautz and B. Selman. Hard problems for simple default logic. Artificial Intelligence, 49:243-279, 1991. (Pubitemid 21679931)
17. H.A. Kautz and B. Selman. Forming concepts for fast inference. In Proc. of AAAV92, pages 786-793, San Jose (CA), 1992.
18. H.R. Lewis. Renaming a set of clauses as a horn set. Journal of the Association for Computing Machinery, 25:134-135,1978.
19. P. Liberatore. On the corapilability of diagnosis, planning, reasoning about actions, belief revision, etc. In Proc. of KR'98, pages 144-155, Trento, 1998.
20. P. Marquis, Consequence finding algorithms, volume 5 of The Handbook for Uncertain and Defeasible Reasoning, chapter Algorithms for Uncertain and Defeasible Reasoning. Kluwer Academic Publishers, 1999. (to appear).
21. J. McCarthy. Applications of circumscription to formalizing common-sense knowledge. Artificial Intelligence, 28:89-116, 1986. (Pubitemid 16503926)
22. J. Minker. On indefinite databases and the closed world assumption. In Proc. of CADE'82, pages 292-308,1982.
23. A. Nerode, R.T. Ng, and V.S. Subrahmanian. Computing circumscriptive databases, i: Theory and algorithms. Information and Computation, 116:58-80,1995.
24. Ch. H. Papadimitriou. Computational complexity. Addison-Wesley, 1994.
25. O. Raiman and J. de Kleer. A minimality maintenance system. In Proc. ofKRW, pages 532-538, Cambridge (MA), 1992.
26. R. Reiter and J. de Kleer. Foundations of assumption-based truth maintenance systems: preliminary report. In Proc. of AAAV81, pages 183-188, Seattle (WA), 1987.
27. R. Reiter. Logic and Data Bases, chapter On closed world data bases, pages 119-140. Plenum Press, 1978.
28. R. Schrag. Compilation for critically constrained knowledge bases. In Proc. of AAAV96, pages 510-515, Portland (OR), 1996.
29. A. Yahya and L.J. Henschen. Deduction in non-Horn databases. Journal of Automated Reasoning, 1:141-160, 1985.