Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. M. Baaz and A. Leitsch. Complexity of Resolution Proofs and Function Introduction. Annals of Pure and Applied Logic, 57:181–215, 1992.
2. M. Baaz and A. Leitsch. On Skolemization and Proof Complexity. Fundamenta Informaticae, 20:353–379, 1994.
3. R. Ben-Eliyahu and R. Dechter. Default Logic, Propositional Logic and Constraints. In Proceedings of the AAAI National Conference on Artificial Intelligence, Los Altos, CA, 1991. Morgan Kaufmann.
4. W. Bibel. Deduction: Automated Logic. Academic Press, London, 1993.
5. P. A. Bonatti. Proof Systems for Default and Autoepistemic Logics. In P. Miglioli, U. Moscato, D. Mundici and M. Ornaghi, editors, Proceedings TABLEAUX'96, Springer LNCS 1071, pp. 127–142, 1996.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Proof-complexity results for nonmonotonic reasoning;ACM Transactions on Computational Logic;2001-07
2. On Proof Complexity of Circumscription;Lecture Notes in Computer Science;1998