On compact representations of propositional circumscription

Theoretical Computer Science

Volumn 182, Issue 1-2, 1997, Pages 183-202

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

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; EQUIVALENCE CLASSES; POLYNOMIALS;

POLYNOMIAL SIZE REPRESENTATIONS; PROPOSITIONAL CIRCUMSCRIPTION;

COMPUTATION THEORY;

EID: 0031207583     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00182-X     Document Type: Article

References (32)

1. M. Cadoli, The complexity of model checking for circumscriptive formulae, Inform. Process. Lett. 44 (1992) 113-118.
2. M. Cadoli, F.M. Donini, P. Liberatore and M. Schaerf, The size of a revised knowledge base, in: Proc. 14th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS-95) (1995) 151-162.
3. M. Cadoli, F.M. Donini and M. Schaerf, Is intractability of non-monotonic reasoning a real drawback?, in: Proc. 12th National Conf. on Artifical Intelligence (AAAI-94) (1994) 946-951. Extended version as RAP.09.95 DIS, Univ. of Roma "La Sapienza", 1995.
4. M. Cadoli, F.M. Donini and M. Schaerf, On compact representations of propositional circumscription, in: 12th Symp. on Theoretical Aspects of Computer Science (STACS-95) (1995) 205-216. Extended version as RAP. 14.95 DIS, Univ. of Roma "La Sapienza", July 1995.
5. M. Cadoli, F.M. Donini and M. Schaerf, Is intractability of non-monotonic reasoning a real drawback?, Artifical Intelligence J. 88 (1996) 215-251.
6. P. Doherty, W. Lukaszewicz and A. Szalas, Computing circumscription revisited: a reduction algorithm, in: Proc. 14th Internat. Joint Conf. on Artifical Intelligence (IJCAI-95) (1995) 1502-1508.
7. 2-complete, Theoret. Comput. Sci. 114 (1993) 231-245.
8. D. Gabbay and H.J. Ohlbach, Quantifier elimination in second-order predicate logic, in: Proc. 3rd Internat. Conf. on the Principles of Knowledge Representation and Reasoning (KR-92) (1992) 425-435.
9. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: Proc. 5th Logic Programming Symp. (MIT Press, Cambridge, MA, 1988) 1070-1080.
10. M. Gelfond, H. Przymusinska and T. Przymusinsky, On the relationship between circumscription and negation as failure, Artificial Intelligence J. 38 (1989) 49-73.
11. D.S. Johnson, A catalog of complexity classes, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. A, Ch. 2 (Elsevier, Amsterdam, 1990).
12. R.M. Karp and R.J. Lipton, Some connections between non-uniform and uniform complexity classes, in: Proc. 12th ACM Symp. on Theory of Computing (STOC-80) (1980) 302-309.
13. H.A. Kautz and B. Selman, Forming concepts for fast inference, in: Proc. 10th Natl. Conf. on Artifcial Intelligence (AAAI-92) (1992) 786-793.
14. P.G. Kolaitis and C.H. Papadimitriou, Some computational aspects of circumscription, J. ACM 37 (1990) 1-14.
15. T. Krishnaprasad, On the computability of circumscription, Inform. Process. Lett. 27 (1988) 237-243.
16. H.J. Levesque, Making believers out of computers, Artifical Intelligence J. 30 (1986) 81-108.
17. V. Lifschitz, Computing circumscription, in: Proc. 9th Internat. Joint Conf. on Artificial Intelligence (IJCAI-85) (1985) 121-127.
18. W. Marek and M. Truszczyński, Autoepistemic logic, J. ACM 38 (1991) 588-619.
19. J. McCarthy, Circumscription - a form of non-monotonic reasoning, Artifical Intelligence J. 13 (1980) 27-39.
20. J. McCarthy, Applications of circumscription to formalizing common-sense knowledge, Aritifical Intelligence J. 28 (1986) 89-116.
21. J. Minker, On indefinite databases and the closed world assumption, in: Proc. 6th Internat. Conf. on Automated Deduction (CADE-82) (1982) 292-308.
22. Y. Moses and M. Tennenholtz, Off-line reasoning for on-line efficiency, in: Proc. 13th Internat. Joint Conf. on Artifical Intelligence (IJCAI-93) (1993) 490-495.
23. A. Nerode, R.T. Ng and V.S. Subrahmanian, Computing circumscriptive databases. I: Theory and algorithms, Inform. and Comput. 116 (1995) 58-80.
24. M. Papalaskari and S. Weinstein, Minimal consequence in sentential logic, J. Logic Programming 9 (1990) 19-31.
25. M. Przymusinski, Stable semantics for disjunctive programs, New Generation Comput. 9 (1991) 401-424.
26. A. Rabinov, A generalization of collapsible cases of circumscription, Artificial Intelligence J. 38 (1989) 111-117.
27. R. Reiter, A logic for default reasoning, Artifical Intelligence J. 13 (1980) 81-132.
28. B. Selman and H.A. Kautz, Knowledge compilation using Horn approximations, in: Proc. 9th Natl. Conf. on Artifical Intelligence (AAAI-91) (1991) 904-909.
29. P.M. Spira, On time hardware complexity tradeoffs for boolean functions, in: Proc. 4th Hawaii Symp. on Systems Science (1971) 525-527.
30. A. van Gelder, K.A. Ross and J.S. Schlipf, The well-founded semantics for general logic programs, J. ACM 38 (1991) 620-650.
31. C.K. Yap, Some consequences of non-uniform conditions on uniform classes, Theoret. Comput. Sci. 26 (1983) 287-300.
32. A. Yahya and L.J. Henschen, Deduction in non-Horn databases, J. Autom. Reasoning 1 (1985) 141-160.