Add to ORKGInternational audienceA tableau calculus is proposed, based on a compressed representation of clauses, where literals sharing a similar shape may be merged. The inferences applied on these literals are fused when possible, which can reduce the size of the proof. It is shown that the obtained proof procedure is sound, refutationally complete and can reduce the size of the tableau by an exponential factor. The approach is compatible with all usual refinements of tableaux
This paper introduces a variant of clausal normal form tableaux that we call "hyper tableaux&qu...
Proof procedures based on model elimination or the connection tableau calculus have become more and ...
Over the past decades, a number of calculi for automated reasoning have been proposed that share som...
International audienceA tableau calculus is proposed, based on a compressed representation of clause...
The current first-order automatic prover FAUST, embedded in HOL, is based on a sequent calculus whic...
. This paper extends a calculus for first-order logic that combines the inference mechanism of hyper...
. In this paper techniques are developed and compared which increase the inferential power of tablea...
http://www.tableaux11.unibe.ch/index.php?n=Site.ProceedingsInternational audienceTwo distinct algori...
We introduce a tableau calculus for Haíek’s Basic Logic BL. This calculus has many of the desirable ...
Abstract. In this paper we have a closer look at one of the rules of the tableau calculus presented ...
International audienceDeduction modulo is a formalism introduced to separate cleanly computations an...
We introduce a tableau calculus for Hajek's Basic Logic BL. This calculus has many of the desirable ...
Colloque avec actes et comité de lecture. internationale.International audienceProofs techniques can...
We show that Smullyan's analytic tableaux cannot p-simulate the truth-tables. We identify the c...
In most theorem proving applications, a proper treatment of equational theories or equality is manda...
This paper introduces a variant of clausal normal form tableaux that we call "hyper tableaux&qu...
Proof procedures based on model elimination or the connection tableau calculus have become more and ...
Over the past decades, a number of calculi for automated reasoning have been proposed that share som...
International audienceA tableau calculus is proposed, based on a compressed representation of clause...
The current first-order automatic prover FAUST, embedded in HOL, is based on a sequent calculus whic...
. This paper extends a calculus for first-order logic that combines the inference mechanism of hyper...
. In this paper techniques are developed and compared which increase the inferential power of tablea...
http://www.tableaux11.unibe.ch/index.php?n=Site.ProceedingsInternational audienceTwo distinct algori...
We introduce a tableau calculus for Haíek’s Basic Logic BL. This calculus has many of the desirable ...
Abstract. In this paper we have a closer look at one of the rules of the tableau calculus presented ...
International audienceDeduction modulo is a formalism introduced to separate cleanly computations an...
We introduce a tableau calculus for Hajek's Basic Logic BL. This calculus has many of the desirable ...
Colloque avec actes et comité de lecture. internationale.International audienceProofs techniques can...
We show that Smullyan's analytic tableaux cannot p-simulate the truth-tables. We identify the c...
In most theorem proving applications, a proper treatment of equational theories or equality is manda...
This paper introduces a variant of clausal normal form tableaux that we call "hyper tableaux&qu...
Proof procedures based on model elimination or the connection tableau calculus have become more and ...
Over the past decades, a number of calculi for automated reasoning have been proposed that share som...