de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

First-Order Tableaux with Sorts

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45719

Weidenbach,  Christoph
Automation of Logic, MPI for Informatics, Max Planck Society;
Programming Logics, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Weidenbach, C. (1994). First-Order Tableaux with Sorts. In Broda, Krysia, D'Agostino, Marcello, & e. al. (Eds.), TABLEAUX-'94, 3rd Workshop on Theorem Proving with Analytic Tableaux and Related Methods (pp. 247-261). Imperial College of Science Technology and Medicine, TR-94/5.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-AD7C-5
Abstract
Tableau and the free variable tableau are extended with sorts. Sorts are sets of unary predicates. They can be attached to variables. Semantically, the domain of a variable is restricted to the intersection of the denotations of the attached predicates. Syntactically, the sort information is exploited by modified $\gamma$ and $\delta$ rules. The standard unification algorithm of free variable tableau is replaced by a sorted unification algorithm. The resulting calculi, tableau with sorts and free variable tableau with sorts are proved sound, complete and more suitable for mechanization than their counterparts without sorts.