We employ the model-theoretic method of Ehrenfeucht-Fra sse Games to prove the completeness of the theory CFT, which has been introduced in 22] for describing rational trees in a ...
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...
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...
Abstract. We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicat...