Many-sorted inferences in automated theorem proving
Proceedings of the workshop on Sorts and types in artificial intelligence
Resolution Strategies as Decision Procedures
Journal of the ACM (JACM)
Modal logic
Decidability by Resolution for Propositional Modal Logics
Journal of Automated Reasoning
A Resolution Calculus for Modal Logics
Proceedings of the 9th International Conference on Automated Deduction
Proceedings of the 9th International Conference on Automated Deduction
Combining superposition, sorts and splitting
Handbook of automated reasoning
System Description: Spass Version 3.0
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Modal theorem proving: an equational viewpoint
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
In this article we first show how the functional and the optimized functional translation from modal logic to many-sorted first-order logic can be naturally extended to the hybrid language H(@,@7). The translation is correct not only when reasoning over the class of all models, but for any first-order definable class. We then show that sorts can be safely removed (i.e., without affecting the satisfiability status of the formula) for frame classes that can be defined in the basic modal language, and show a counterexample for a frame class defined using nominals.