CADE
1997
Springer
13 years 8 months ago
1997
Springer
We present a matrix characterization of logical validity in the multiplicative fragment of linear logic. On this basis we develop a matrix-based proof search procedure for this fra...
CADE
1997
Springer
13 years 8 months ago
1997
Springer
Abstract. We present a technique that efficiently translates propositional intuitionistic formulas into propositional classical formulas. This technique allows the use of arbitrary...
CADE
1997
Springer
13 years 8 months ago
1997
Springer
CADE
1997
Springer
13 years 8 months ago
1997
Springer
CADE
1997
Springer
13 years 8 months ago
1997
Springer
JELIA
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
CADE
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. Higher-order representation techniques allow elegant encodings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally i...
CADE
1998
Springer
13 years 8 months ago
1998
Springer
Proceedings of CADE-15, LNAI 1421, pp. 205
CADE
1998
Springer
13 years 8 months ago
1998
Springer
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...
CADE
1998
Springer
13 years 8 months ago
1998
Springer
The CRIL multi-strategy platform for SAT includes a whole family of local search techniques and some of the best Davis and Putnam strategies for checking propositional satis abilit...