AbstractWe study free variable tableau methods for logics with term declarations. We show how to define a substitutivity rule preserving the soundness of the tableaux and we prove that some other attempts lead to unsound systems. Based on this rule, we define a sound and complete free variable tableau system and we show how to restrict its application to close branches by defining a sorted unification calculus
We present a sound and complete tableau calculus for the class of regular grammar logics. Our tablea...
Even though higher-order calculi for automated theorem proving are rather old, tableau calculi have ...
This paper provides two results concerning Order-Sorted Logic with Term Declarations. First, we show...
AbstractWe study free variable tableau methods for logics with term declarations. We show how to def...
Abstract. The tableau substitution rule in free variable tableau reasoning is destruc-tive, for in g...
The paper provides a tableau approach to definite descriptions. We focus on several formalizations o...
The proof of properties of formal systems including inequalities is currently evolving into an incre...
Tableau and the free variable tableau are extended with sorts. Sorts are sets of unary predicates. T...
We derive tableau calculi as solutions to the word problem for the free semilattice, the free distri...
Abstract. In this paper we have a closer look at one of the rules of the tableau calculus presented ...
We prove the syntactic soundness of classical tableaux with free variables and on-the-fly Skolemizat...
This paper presents a method for synthesising sound and complete tableaucalculi. Given a specificati...
A generic tableau prover has been implemented and integrated with Isabelle (Paulson, 1994). Compared...
Abstract. We present a sound and complete tableau calculus for the class of regular grammar logics. ...
In this paper we apply the methodology of Labelled Deductive Systems to the tableau method in order ...
We present a sound and complete tableau calculus for the class of regular grammar logics. Our tablea...
Even though higher-order calculi for automated theorem proving are rather old, tableau calculi have ...
This paper provides two results concerning Order-Sorted Logic with Term Declarations. First, we show...
AbstractWe study free variable tableau methods for logics with term declarations. We show how to def...
Abstract. The tableau substitution rule in free variable tableau reasoning is destruc-tive, for in g...
The paper provides a tableau approach to definite descriptions. We focus on several formalizations o...
The proof of properties of formal systems including inequalities is currently evolving into an incre...
Tableau and the free variable tableau are extended with sorts. Sorts are sets of unary predicates. T...
We derive tableau calculi as solutions to the word problem for the free semilattice, the free distri...
Abstract. In this paper we have a closer look at one of the rules of the tableau calculus presented ...
We prove the syntactic soundness of classical tableaux with free variables and on-the-fly Skolemizat...
This paper presents a method for synthesising sound and complete tableaucalculi. Given a specificati...
A generic tableau prover has been implemented and integrated with Isabelle (Paulson, 1994). Compared...
Abstract. We present a sound and complete tableau calculus for the class of regular grammar logics. ...
In this paper we apply the methodology of Labelled Deductive Systems to the tableau method in order ...
We present a sound and complete tableau calculus for the class of regular grammar logics. Our tablea...
Even though higher-order calculi for automated theorem proving are rather old, tableau calculi have ...
This paper provides two results concerning Order-Sorted Logic with Term Declarations. First, we show...
DOI
Add to ORKG