1302 search results - page 118 / 261 » Free-Style Theorem Proving |
143
click to vote
LFCS
1997
Springer
15 years 8 months ago
1997
Springer
The provability problem for the Horn fragment of linear logic is NP-complete [4, 1]. In this work we investigate various definitions of concurrency proposed in [2] and establish t...
118
click to vote
CSL
1994
Springer
15 years 8 months ago
1994
Springer
We prove the completeness of the combination of ordered resolution and factoring for a large class of non-liftable orderings, without the need for any additional rules like satura...
141
click to vote
AISC
2004
Springer
15 years 8 months ago
2004
Springer
We present a new method for generic quantifier elimination that uses an extension of Hermitian quantifier elimination. By means of sample computations we show that this generic Her...
109
click to vote
FSTTCS
2004
Springer
15 years 8 months ago
2004
Springer
A separation context is a client program which does not dereference internals of a module with which it interacts. We use certain "precise" relations to unambiguously des...
148
click to vote
FOCS
1991
IEEE
15 years 8 months ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...