3773 search results - page 200 / 755 » Logical Reasoning |
128
click to vote
CADE
1999
Springer
15 years 8 months ago
1999
Springer
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...
138
click to vote
CADE
1998
Springer
15 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...
116
click to vote
CADE
1992
Springer
15 years 8 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
138
click to vote
CADE
2008
Springer
15 years 6 months ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
121
click to vote
CADE
2010
Springer
15 years 5 months ago
2010
Springer
It has recently been shown that proofs in which some symbols are colored (e.g. local or split proofs and symbol-eliminating proofs) can be used for a number of applications, such a...