A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
Logics of time and computation
Logics of time and computation
An optimality result for clause form translation
Journal of Symbolic Computation
The resolution calculus
Modal tableaux with propagation rules and structural rules
Fundamenta Informaticae
Modal logic
Single Step Tableaux for Modal Logics
Journal of Automated Reasoning
Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation
Journal of Automated Reasoning
Using Resolution for Testing Modal Satisfiability and Building Models
Journal of Automated Reasoning
On the Relation of Resolution and Tableaux Proof Systems for Description Logics
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Normal Forms and Proofs in Combined Modal and Temporal Logics
FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
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
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Superposition with Simplification as a Desision Procedure for the Monadic Class with Equality
KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
A New Clausal Class Decidable by Hyperresolution
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Combining Hilbert Style and Semantic Reasoning in a Resolution Framework
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
A Resolution Decision Procedure for Fluted Logic
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
DCTP - A Disconnection Calculus Theorem Prover - System Abstract
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Deciding the guarded fragments by resolution
Journal of Symbolic Computation
Handbook of automated reasoning
Handbook of automated reasoning
Encoding two-valued nonclassical logics in classical logic
Handbook of automated reasoning
The Two-Variable Guarded Fragment with Transitive Relations
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A Superposition Decision Procedure for the Guarded Fragment with Equality
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
AI Communications - CASC
Deduction Systems
Logical Engineering with Instance-Based Methods
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
A new methodology for developing deduction methods
Annals of Mathematics and Artificial Intelligence
Simulation and Synthesis of Deduction Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
On the translation from quantified modal logic into the counterpart theory revisited
KSEM'11 Proceedings of the 5th international conference on Knowledge Science, Engineering and Management
Hi-index | 0.00 |
In this paper we present a translation principle, called the axiomatic translation, for reducing propositional modal logics with background theories, including triangular properties such as transitivity, Euclideanness and functionality, to decidable fragments of first-order logic. The goal of the axiomatic translation principle is to find simplified theories, which capture the inference problems in the original theory, but in a way that can be readily automated and is easier to deal with by existing (first-order) theorem provers than the standard translation. The principle of the axiomatic translation is conceptually very simple and can be almost completely automated. Soundness is automatic under reasonable assumptions, general decidability results can be stated and termination of ordered resolution is easily achieved. The non-trivial part of the approach is proving completeness. We prove results of completeness, decidability, model generation, the small model property and the interpolation property for a number of common and less common modal logics. We also present results of experiments with a number of first-order logic theorem provers which are very encouraging.