Author:
Cadoli Marco,Donini Francesco M.,Schaerf Marco
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. M. Cadoli. The complexity of model checking for circumscriptive formulae. Information Processing Letters, 44:113–118, 1992.
2. T. Eiter and G. Gottlob. Propositional circumscription and extended closed world reasoning are Π 2 p -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 12th ACM Sym. on Theory of Computing (STOC-80), pages 302–309, 1980.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Proof Complexity of Circumscription;Lecture Notes in Computer Science;1998
2. Reducing belief revision to circumscription (and vice versa);Artificial Intelligence;1997-06
3. Non-elementary speed-ups in default reasoning;Qualitative and Quantitative Practical Reasoning;1997
4. Automated reasoning with nonmonotonic logics;Logic Programming And Nonmonotonic Reasoning;1997
5. Is non-monotonic reasoning always harder;Logic Programming And Nonmonotonic Reasoning;1997