128
click to vote
TABLEAUX
15 years 3 months ago
1995 Springer
In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constra...
102
Voted
TABLEAUX
15 years 3 months ago
1995 Springer
We present a proof method for intuitionistic logic based on Wallen’s matrix characterization. Our approach combines the connection calculus and the sequent calculus. The search t...
90
Voted
TABLEAUX
15 years 3 months ago
1995 Springer
We present a procedure transforming intuitionistic matrix proofs into proofs within the intuitionistic standard sequent calculus. The transformation is based on L. Wallen’s proof...
|