4573 search results - page 425 / 915 » Automated Reasoning |
197
click to vote
CCL
1994
Springer
15 years 11 months ago
1994
Springer
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...
200
click to vote
CCL
1994
Springer
15 years 11 months ago
1994
Springer
Abstract. We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicat...
166
click to vote
ICLP
1993
Springer
15 years 11 months ago
1993
Springer
: Copy avoidance refers to the safe replacement, at compile time, of copying operations by destructive updates in single-assignment languages. Conceptually, the problem can be divi...
198
click to vote
ICLP
1993
Springer
15 years 11 months ago
1993
Springer
Erlang is a concurrent programming language designed for prototyping and implementing reliable real-time systems. In its design Erlanginherits someideas fromconcurrent logic progra...
163
click to vote
ICLP
1994
Springer
15 years 11 months ago
1994
Springer
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...