28 search results - page 6 / 6 » Translating Pseudo-Boolean Constraints into SAT |
SIGSOFT
2000
ACM
15 years 1 months ago
2000
ACM
An automatic analysis method for first-order logic with sets and relations is described. A first-order formula is translated to a quantifier-free boolean formula, which has a mode...
VLSID
2007
IEEE
15 years 10 months ago
2007
IEEE
Boolean Satisfiability is seeing increasing use as a decision procedure in Electronic Design Automation (EDA) and other domains. Most applications encode their domain specific cons...
PLDI
2004
ACM
15 years 2 months ago
2004
ACM
In this paper we present Jedd, a language extension to Java that supports a convenient way of programming with Binary Decision Diagrams (BDDs). The Jedd language abstracts BDDs as...