32 search results - page 6 / 7 » The Quest for Efficient Boolean Satisfiability Solvers |
86
Voted
AI
2010
Springer
14 years 10 months 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...
86
Voted
BMCBI
2008
14 years 10 months 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...
109
Voted
CAV
2008
Springer
15 years 7 days 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...
102
Voted
ICCAD
2009
IEEE
14 years 8 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
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...