Connection methods have proven their value for efficient automated theorem proving in classical logics. However, these methods have not been extended to temporal logics due to the lack of a subformula property in existing proof procedures. We show that a slightly looser generalized subformula property exists for temporal logics. We then exploit this generalized subformula property to develop a ...

This paper is concerned with the possibilities of refining and improving calculi generated in the tableau synthesis framework [10]. A general method in the tableau synthesis framework allows to reduce the branching factor of tableau rules and preserves completeness if a general rule refinement condition holds. In this paper we consider two approaches to satisfy this general rule refinement cond...

linTAP is a tableau prover for the multiplicative and exponential fragment M?LL of Girards linear logic. It proves the validity of a given formula by constructing an analytic tableau and ensures the linear validity using prefix unification. We present the tableau calculus used by linTAP, an algorithm for prefix unification in linear logic, the linTAP implementation, and some experimental result...

The first step towards a wide-coverage tableau prover for natural logic is presented. We describe an automatized method for obtaining Lambda Logical Forms from surface forms and use this method with an implemented prover to hunt for new tableau rules in textual entailment data sets. The collected tableau rules are presented and their usage is also exemplified in several tableau proofs. The perf...