MSPASS: Modal Reasoning by Translation and First-Order Resolution
TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A New Clausal Class Decidable by Hyperresolution
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Resolution decision procedures
Handbook of automated reasoning
Hyperresolution for guarded formulae
Journal of Symbolic Computation - Special issue: First order theorem proving
The design and implementation of VAMPIRE
AI Communications - CASC
The axiomatic translation principle for modal logic
ACM Transactions on Computational Logic (TOCL)
System Description: Spass Version 3.0
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
On the relation of resolution and tableaux proof systems for description logics
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
A new methodology for developing deduction methods
Annals of Mathematics and Artificial Intelligence
Automated Synthesis of Tableau Calculi
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Using tableau to decide expressive description logics with role negation
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
A Tableau Method for Checking Rule Admissibility in S4
Electronic Notes in Theoretical Computer Science (ENTCS)
Blocking and other enhancements for bottom-up model generation methods
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
| Hi-index | 0.00 |
This paper gives an overview of two methods for automatically or semi-automatically generating deduction calculi from the semantic specification of a logic. One approach is based on simulating deduction approaches with techniques of automated reasoning and first-order resolution. The second approach synthesises sound, complete and terminating tableau calculi directly from the semantic specification of a logic.