Handbook of logic in artificial intelligence and logic programming (vol. 1)
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Combining Hilbert Style and Semantic Reasoning in a Resolution Framework
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
First-order modal logic theorem proving and functional simulation
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
A set-theoretic approach to automated deduction in graded modal logics
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
| Hi-index | 0.00 |
Two of the most active research areas in automated deduction in modal logic are the use of translation methods to reduce its derivability problem to that of classical logic and the extension of existing automated reasoning techniques, developed initially for the propositional case, to first-order modal logics. This paper addresses both issues by extending the translation method for propositional modal logics known as □-as-Pow (read "box-as-powerset") to a widely used class of first-order modal logics, namely, the class of locally quantified modal logics. To do this, we prove a more general result that allows us to separate (classical) first-order from modal (propositional) reasoning. Our translation can be seen as an example application of this result, in both definition and proof of adequateness.