32 search results - page 6 / 7 » The Quest for Efficient Boolean Satisfiability Solvers |
AI
2010
Springer
15 years 3 days ago
2010
Springer
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
BMCBI
2008
15 years 2 days ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
122
click to vote
CAV
2008
Springer
15 years 2 months ago
2008
Springer
We present CSIsat, an interpolating decision procedure for the quantifier-free theory of rational linear arithmetic and equality with uninterpreted function symbols. Our implementa...
117
click to vote
ICCAD
2009
IEEE
14 years 9 months ago
2009
IEEE
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
VLSID
2007
IEEE
16 years 10 days 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...