A many-sorted calculus based on resolution and paramodulation
A many-sorted calculus based on resolution and paramodulation
Computational aspects of an order-sorted logic with term declarations
Computational aspects of an order-sorted logic with term declarations
First-order logic and automated theorem proving (2nd ed.)
First-order logic and automated theorem proving (2nd ed.)
Rigid E-Unification Simplified
TABLEAUX '95 Proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Reasoning with Preorders and Dynamic Sorts Using Free Variable Tableaux
AISMC-3 Proceedings of the International Conference AISMC-3 on Artificial Intelligence and Symbolic Mathematical Computation
Simultaneous Rigid Sorted Unification
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
| Hi-index | 0.00 |
We study free variable tableau methods for logics with term declarations. We show how to define a substitutivity rule preserving the soundness of the tableaux and we prove that some other attempts lead to unsound systems. Based on this rule, we define a sound and complete free variable tableau system and we show how to restrict its application to close branches by defining a sorted unification calculus.