Sciweavers

61 search results - page 3 / 13
» Tableaux for the Lambek-Grishin calculus
Sort
View
TABLEAUX
2005
Springer
14 years 3 months ago
Unit Propagation in a Tableau Framework
Unit propagation is one of the most important techniques of efficient SAT solvers. Unfortunately, this technique is not directly applicable to first-order clausal tableaux. We sho...
Gernot Stenz
CSL
2001
Springer
14 years 2 months ago
Constrained Hyper Tableaux
Hyper tableau reasoning is a version of clausal form tableau reasoning where all negative literals in a clause are resolved away in a single inference step. Constrained hyper table...
Jan van Eijck
TABLEAUX
2005
Springer
14 years 3 months ago
Clausal Connection-Based Theorem Proving in Intuitionistic First-Order Logic
Abstract. We present a clausal connection calculus for first-order intuitionistic logic. It extends the classical connection calculus by adding prefixes that encode the character...
Jens Otten
CADE
2006
Springer
14 years 10 months ago
Connection Tableaux with Lazy Paramodulation
It is well-known that the connection refinement of clause tableaux with paramodulation is incomplete (even with weak connections). In this paper, we present a new connection tablea...
Andrey Paskevich
TABLEAUX
1999
Springer
14 years 2 months ago
A Tableau Calculus for Pronoun Resolution
Appeared in: N.V. Murray, editor, Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX’99), Lecture Notes in Artificial Intelligence 1617, Springer, pages 2...
Christof Monz, Maarten de Rijke