Automated Synthesis of Tableau Calculi

Schmidt, R. A. and Tishkovsky, D. (2011)

Logical Methods in Computer Science 7 (2) 1-32, BiBTeX, Link to journal, arXiv Link.

This paper presents a method for synthesising sound and complete tableau calculi. Given a specification of the formal semantics of a logic, the method generates a set of tableau inference rules that can then be used to reason within the logic. The method guarantees that the generated rules form a calculus which is sound and constructively complete. If the logic can be shown to admit finite filtration with respect to a well-defined first-order semantics then adding a general blocking mechanism provides a terminating tableau calculus. The process of generating tableau rules can be completely automated and produces, together with the blocking mechanism, an automated procedure for generating tableau decision procedures. For illustration we show the workability of the approach for a description logic with transitive roles and propositional intuitionistic logic.


Renate A. Schmidt
Home | Publications | Tools | FM Group | School | Man Univ

Last modified: 16 May 11
Copyright © 2011 Renate A. Schmidt, School of Computer Science, Man Univ, schmidt@cs.man.ac.uk