1410 search results - page 102 / 282 » Proving theorems by reuse |
149
click to vote
EPIA
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Multi-adjoint logic program generalise monotonic logic programs introduced in [1] in that simultaneous use of several implications in the rules and rather general connect...
180
click to vote
MFCS
2001
Springer
15 years 10 months ago
2001
Springer
We consider words indexed by linear orderings. These extend finite, (bi-)infinite words and words on ordinals. We introduce finite automata and rational expressions for these w...
162
click to vote
LFCS
1997
Springer
15 years 10 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...
136
click to vote
CSL
1994
Springer
15 years 9 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...
164
click to vote
AISC
2004
Springer
15 years 9 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...