CSL
1994
Springer
14 years 3 months ago
1994
Springer
CSL
1994
Springer
14 years 3 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...
CSL
1994
Springer
14 years 3 months ago
1994
Springer
CSL
1993
Springer
14 years 3 months ago
1993
Springer
CSL
1993
Springer
14 years 3 months ago
1993
Springer
CSL
1993
Springer
14 years 3 months ago
1993
Springer
CCL
1994
Springer
14 years 3 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...
CCL
1994
Springer
14 years 3 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...
CCL
1994
Springer
14 years 3 months ago
1994
Springer
CCL
1994
Springer
14 years 3 months ago
1994
Springer
Abstract: This paper describes the application of CLP (constraint logic programming) to several digital circuit design problems. It is shown that logic programming together with ef...