Proof-complexity results for nonmonotonic reasoning
ACM Transactions on Computational Logic (TOCL)
Sequent calculi for propositional nonmonotonic logics
ACM Transactions on Computational Logic (TOCL)
On Proof Complexity of Circumscription
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Hi-index | 0.00 |