JTabWb: a Java Framework for Implementing Terminating Sequent and Tableau Calculi

Issue title: Special Issue on the 29th Italian Conference on Computational Logic: CILC 2014

Guest editors: Laura Giordano, Valentina Gliozzi, Alberto Pettorossi and Gian Luca Pozzato

Article type: Research Article

Authors: Ferrari, Mauro^{a; *} | Fiorentini, Camillo^b | Fiorino, Guido^c

Affiliations: [a] Università degli Studi dell’Insubria, Via Mazzini, 5, 21100, Varese, Italy. mauro.ferrari@uninsubria.it | [b] Università degli Studi di Milano, Via Comelico, 39, 20135, Milano, Italy. fiorentini@di.unimi.it | [c] Università degli Studi di Milano-Bicocca, Viale Sarca, 336, 20126, Milano, Italy. guido.fiorino@unimib.it

Correspondence: [*] Address for correspondence: Dipartimento di Scienze Teoriche e Applicate, Università degli Studi dell’Insubria, Via Mazzini, 5, 21100, Varese, Italy

Abstract: JTabWb is a Java framework for developing provers based on sequent or tableau calculi. It provides a generic engine which searches for proof of a given goal driven by a user-defined prover. The user is required to define the components of a prover by implementing suitable Java interfaces. In this paper we describe the structure of the framework and the role of its components through a running example. To show the generality of the framework we review some of the provers implemented in JTabWb. Finally, to corroborate the fact that the framework can be used to generate efficient provers, we compare the performances of one of the implemented provers with the state-of-the-art provers for Intuitionistic Propositional Logic.

Keywords: Theorem provers, Java frameworks

DOI: 10.3233/FI-2017-1462

Journal: Fundamenta Informaticae, vol. 150, no. 1, pp. 119-142, 2017