z-logo
open-access-imgOpen Access
An improved method for adding equality to free variable semantic tableaux
Author(s) -
Bernhard Beckert,
Reiner Hähnle
Publication year - 1992
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-55602-8
DOI - 10.1007/3-540-55602-8_188
Subject(s) - soundness , completeness (order theory) , cover (algebra) , computer science , object (grammar) , theoretical computer science , programming language , mathematics , artificial intelligence , mathematical analysis , engineering , mechanical engineering
Tableau-Based theorem provers can be extended to cover many of the nonclassical logics currently used in AI research. For both, classical and nonclassical first-order logic, equality is a crucial feature to increase ex- pressivity of the object language. Unfortunately, all so far existing attempts of adding equality to semantic tableaux have been more or less experimental and turn out to be useless in practice. In the present work we introduce an approach that leads much further and sets the stage for more advanced developments. We identify the problems that stem specifically from choosing semantic tableaux as a framework and state soundness and completeness results for our method.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom