Abstract
We prove that — unless the polynomial hierarchy collapses at the second level — the size of a purely propositional representation of the circumscription CIRC(T) of a propositional formula T grows faster than any polynomial as the size of T increases. We then analyze the significance of this result in the related field of closed-world reasoning.
This work has been supported by the ESPRIT Basic Research Action N.6810 (COMPULOG 2) and by the Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo of the CNR (Italian Research Council), LdR “Ibridi”.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Cadoli. The complexity of model checking for circumscriptive formulae. Information Processing Letters, 44:113–118, 1992.
T. Eiter and G. Gottlob. Propositional circumscription and extended closed world reasoning are Π p2 -complete. Theoretical Computer Science, pages 231–245, 1993.
M. Gelfond, H. Przymusinska, and T. Przymusinsky. On the relationship between circumscription and negation as failure. Artificial Intelligence Journal, 38:49–73, 1989.
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.
R. M. Karp and R. J. Lipton. Some connections between non-uniform and uniform complexity classes. In Proc. of the 12th ACM Sym. on Theory of Computing (STOC-80), pages 302–309, 1980.
H. A. Kautz and B. Selman. Forming concepts for fast inference. In Proc. of the 10th Nat. Conf. on Artificial Intelligence (AAAI-92), pages 786–793, 1992.
P. G. Kolaitis and C. H. Papadimitriou. Some computational aspects of circumscription. Journal of the ACM, 37(1):1–14, 1990.
T. Krishnaprasad. On the computability of circumscription. Information Processing Letters, 27:237–243, 1988.
H. J. Levesque. Making believers out of computers. Artificial Intelligence Journal, 30:81–108, 1986.
V. Lifschitz. Computing circumscription. In Proc. of the 9th Int. Joint Conf. on Artificial Intelligence (IJCAI-85), pages 121–127, 1985.
J. McCarthy. Circumscription — A form of non-monotonic reasoning. Artificial Intelligence Journal, 13:27–39, 1980.
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.
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.
A. Rabinov. A generalization of collapsible cases of circumscription. Artificial Intelligence Journal, 38:111–117, 1989.
A. Yahya and L. J. Henschen. Deduction in non-Horn databases. Journal of Automated Reasoning, 1:141–160, 1985.
C. K. Yap. Some consequences of non-uniform conditions on uniform classes. Theoretical Computer Science, 26:287–300, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cadoli, M., Donini, F.M., Schaerf, M. (1995). On compact representations of propositional circumscription. In: Mayr, E.W., Puech, C. (eds) STACS 95. STACS 1995. Lecture Notes in Computer Science, vol 900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_74
Download citation
DOI: https://doi.org/10.1007/3-540-59042-0_74
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59042-2
Online ISBN: 978-3-540-49175-0
eBook Packages: Springer Book Archive