2018 search results - page 50 / 404 » Code Normal Forms |
SAT
2005
Springer
14 years 3 months ago
2005
Springer
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1...
IFL
2004
Springer
14 years 3 months ago
2004
Springer
One performance-critical phase in the SML.NET compiler involves rewriting intermediate terms to monadic normal form and performing non-duplicating β-reductions. We present an impe...
SAT
2004
Springer
14 years 3 months ago
2004
Springer
We present a novel expansion based decision procedure for quantified boolean formulas (QBF) in conjunctive normal form (CNF). The basic idea is to resolve existentially quantifie...
MFCS
1997
Springer
14 years 2 months ago
1997
Springer
Abstract. Kamperman and Walters proposed the notion of a simulation of one rewrite system by another one, whereby each term of the simulating rewrite system is related to a term in...
LPAR
1994
Springer
14 years 2 months ago
1994
Springer
The concept of anti-link is defined, and useful equivalence-preserving operations on propositional formulas based on anti-links are introduced. These operations eliminate a potent...