Space Efficiency of Propositional Knowledge Representation Formalisms

Journal of Artificial Intelligence Research

Volumn 13, Issue , 2000, Pages 1-31

  Cadoli, Marco ^a   Donini, Francesco M ^b   Liberatore, Paolo ^a   Schaerf, Marco ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b POLITECNICO DI BARI   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346977661     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.664     Document Type: Article

References (38)

1. Ben-Eliyahu, R., & Dechter, R. (1991). Default logic, propositional logic and constraints. In Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI'91), pp. 379-385.
2. Ben-Eliyahu, R., & Dechter, R. (1994). Propositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, 12, 53-87.
3. Boppana, R., & Sipser, M. (1990). The complexity of finite functions. In van Leeuwen, J. (Ed.), Handbook of Theoretical Computer Science, Vol. A, chap. 14, pp. 757-804. Elsevier Science Publishers (North-Holland), Amsterdam.
4. Cadoli, M. (1992). The complexity of model checking for circumscriptive formulae. Information Processing Letters, 44, 113-118.
5. Cadoli, M., Donini, F., Liberatore, P., & Schaerf, M. (1996a). Comparing space efficiency of propositional knowledge representation formalisms. In Proceedings of the Fifth International Conference on the Principles of Knowledge Representation and Reasoning (KR'96), pp. 364-373.
6. Cadoli, M., Donini, F. M., Liberatore, P., & Schaerf, M. (1996b). Feasibility and unfeasibility of off-line processing. In Proceedings of the Fourth Israeli Symposium on Theory of Computing and Systems (ISTCS'96), pp. 100-109. IEEE Computer Society Press. URL = ftp://ftp.dis.uniroma1.it/PUB/AI/papers/cado-etal-96.ps.gz.
7. Cadoli, M., Donini, F. M., Liberatore, P., & Schaerf, M. (1997). Preprocessing of intractable problems. Tech. rep. DIS 24-97, Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza". URL = http://ftp.dis.uniroma1.it/PUB/AI/papers/cado-etal-97-d-REVISED.ps.gz.
8. Cadoli, M., Donini, F. M., Liberatore, P., & Schaerf, M. (1999). The size of a revised knowledge base. Artificial Intelligence, 115(1), 25-64.
9. Cadoli, M., Donini, F. M., & Schaerf, M. (1995). On compact representations of propositional circumscription. In Proceedings of the Twelfth Symposium on Theoretical Aspects of Computer Science (STACS'95), pp. 205-216. Extended version as RAP.14.95 DIS, Univ. of Roma "La Sapienza", July 1995.
10. Cadoli, M., Donini, F. M., & Schaerf, M. (1996). Is intractability of non-monotonic reasoning a real drawback?. Artificial Intelligence, 88(1-2), 215-251.
11. Cadoli, M., Donini, F. M., Schaerf, M., & Silvestri, R. (1997). On compact representations of propositional circumscription. Theoretical Computer Science, 182, 183-202.
12. Cook, S. A. (1971). The complexity of theorem-proving procedures. In Proceedings of the Third ACM Symposium on Theory of Computing (STOC'71), pp. 151-158.
13. Eiter, T., & Gottlob, G. (1992). On the complexity of propositional knowledge base revision, updates and counterfactuals. Artificial Intelligence, 57, 227-270.
14. 2-complete. Theoretical Computer Science, 114, 231-245.
15. Etherington, D. V. (1987). Reasoning with incomplete information. Morgan Kaufmann, Los Altos, Los Altos, CA.
16. Fagin, R., Ullman, J. D., & Vardi, M. Y. (1983). On the semantics of updates in databases. In Proceedings of the Second ACM SIGACT SIGMOD Symposium on Principles of Database Systems (PODS'83), pp. 352-365.
17. Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco, Ca.
18. Gelfond, M., & Lifschitz, V. (1988). The stable model semantics for logic programming. In Proceedings of the Fifth Logic Programming Symposium, pp. 1070-1080. The MIT Press.
19. Gelfond, M., Przymusinska, H., & Przymusinsky, T. (1989). On the relationship between circumscription and negation as failure. Artificial Intelligence, 38, 49-73.
20. Ginsberg, M. L. (1986). Conterfactuals. Artificial Intelligence, 30, 35-79.
21. Gogic, G., Kautz, H. A., Papadimitriou, C., & Selman, B. (1995). The comparative linguistics of knowledge representation. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI'95), pp. 862-869.
22. Gottlob, G. (1992). Complexity results for nonmonotonic logics. Journal of Logic and Computation, 2, 397-425.
23. Gottlob, G. (1995). Translating default logic into standard autoepistemic logic. Journal of the ACM, 42, 711-740.
24. Liberatore, P., & Schaerf, M. (1998). The complexity of model checking for propositional default logics. In Proceedings of the Thirteenth European Conference on Artificial Intelligence (ECAI'98), pp. 18-22.
25. Liberatore, P., & Schaerf, M. (2000). The compactness of belief revision and update operators. Tech. rep., Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza".
26. Marek, W., & Truszczyński, M. (1991). Autoepistemic logic. Journal of the ACM, 38(3), 588-619.
27. McCarthy, J. (1980). Circumscription - A form of non-monotonic reasoning. Artificial Intelligence, 13, 27-39.
28. Minker, J. (1982). On indefinite databases and the closed world assumption. In Proceedings of the Sixth International Conference on Automated Deduction (CADE'82), pp. 292-308.
29. Moses, Y., & Tennenholtz, M. (1996). Off-line reasoning for on-line efficiency: knowledge bases. Artificial Intelligence, 83, 229-239.
30. Nebel, B. (1998). How hard is it to revise a belief base?. In Dubois, D., & Prade, H. (Eds.), Belief Change - Handbook of Defeasible Reasoning and Uncertainty Management Systems, Vol. 3. Kluwer Academic.
31. Reiter, R. (1980). A logic for default reasoning. Artificial Intelligence, 13, 81-132.
32. Schlipf, J. S. (1987). Decidability and definability with circumscription. Annals of Pure and Applied Logic, 35, 173-191.
33. Schlipf, J. S. (1995). A survey of complexity and undecidability results for logic programming. Annals of Mathematics and Artificial Intelligence, 15, 257-288.
34. Selman, B., & Kautz, H. A. (1996). Knowledge compilation and theory approximation. Journal of the ACM, 43, 193-224.
35. Stockmeyer, L. J. (1976). The polynomial-time hierarchy. Theoretical Computer Science, 3, 1-22.
36. Winslett, M. (1989). Sometimes updates are circumscription. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI'89), pp. 859-863.
37. Winslett, M. (1990). Updating Logical Databases. Cambridge University Press.
38. Yap, C. K. (1983). Some consequences of non-uniform conditions on uniform classes. Theoretical Computer Science, 26, 287-300.