Proof-complexity results for nonmonotonic reasoning
ACM Transactions on Computational Logic (TOCL)
Sequent calculi for propositional nonmonotonic logics
ACM Transactions on Computational Logic (TOCL)
Resolution for Skeptical Stable Model Semantics
Journal of Automated Reasoning
On Proof Complexity of Circumscription
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Nonmonotonic reasoning: towards efficient calculi and implementations
Handbook of automated reasoning
Graphs and colorings for answer set programming
Theory and Practice of Logic Programming
| Hi-index | 0.00 |