On compact representations of propositional circumscription

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 900, Issue , 1995, Pages 205-216

  Cadoli, Marco ^a   Donini, Francesco M ^a   Schaerf, Marco ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COMPACT REPRESENTATION; POLYNOMIAL HIERARCHIES; PROPOSITIONAL FORMULAS; SECOND LEVEL;

ARTIFICIAL INTELLIGENCE;

EID: 70349874962     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-59042-0_74     Document Type: Conference Paper

References (16)

1. M. Cadoli. The complexity of model checking for circumscriptive formulae. Information Processing Letters, 44:113-118, 1992.
2. 2-complete. Theoretical Computer Science, pages 231-245, 1993.
3. M. Gelfond, H. Przymusinska, and T. Przymusinsky. On the relationship between circumscription and negation as failure. Artificial Intelligence Journal, 38:49-73, 1989.
4. D. S. Johnson. A catalog of complexity classes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, chapter 2. Elsevier Science Publishers (North-Holland), Amsterdam, 1990.
5. R.. M. Karp and R. J. Lipton. Some connections between non-uniform and uniform complexity classes. In Proc. of the 1Pth ACM Sym. on Theory of Computing (STOC-80), pages 302-309, 1980.
6. H. A. Kautz and B. Selman. Forming concepts for fast inference. In Proc. of the lOth Nat. Conf. on Artificial Intelligence (AAAI-9P), pages 786-793, 1992.
7. P. G. Kolaitis and C. H. Papadimitriou. Some computational aspects of circumscription. Journal of the ACM, 37(1):1-14, 1990.
8. T. Krishnaprasad. On the computability of circumscription. Information Processing Letters, 27:237-243, 1988.
9. H. J. Levesque. Making believers out of computers. Artificial Intelligence Journal, 30:81-108, 1986.
10. V. Lifschitz. Computing circumscription. In Proc. of the 9th Int. Joint Conf. on Artificial Intelligence (IJCAI-85), pages 121-127, 1985.
11. J. McCarthy. Circumscription - A form of non-monotonic reasoning. Artificial Intelligence Journal, 13:27-39, 1980.
12. J. Minker. On indefinite databases and the closed world assumption. In Proc. of the 6th Conf. on Automated Deduction (CADE-82), pages 292-308, 1982.
13. Y. Moses and M. Tennenholtz. Off-line reasoning for on-line efficiency. In Proc. of the 13th Int. Joint Conf. on Artificial Intelligence (IJCAI-93), pages 490-495, 1993.
14. A. Rabinov. A generalization of collapsible cases of circumscription. Artificial Intelligence Journal, 38:111-117, 1989.
15. A. Yahya and L. J. Henschen. Deduction in non-Horn databases. Journal of Automated Reasoning, 1:141-160, 1985.
16. C. K. Yap. Some consequences of non-uniform conditions on uniform classes. Theoretical Computer Science, 26:287-300, 1983.