3776 search results - page 249 / 756 » Partition-Based Logical Reasoning |
129
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...
141
click to vote
LICS
1999
IEEE
15 years 8 months ago
1999
IEEE
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
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...
117
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...
163
click to vote
PODC
1994
ACM
15 years 8 months ago
1994
ACM
We describe a method for writing assumption/guarantee specifications of concurrent systems. We also provide a proof rule for reasoning about the composition of these systems. Spec...