Sciweavers

101 search results - page 9 / 21
» sat 2009
Sort
View
SAT
2009
Springer
158views Hardware» more  SAT 2009»
14 years 4 months ago
Beyond CNF: A Circuit-Based QBF Solver
State-of-the-art solvers for Quantified Boolean Formulas (QBF) have employed many techniques from the field of Boolean Satisfiability (SAT) including the use of Conjunctive Norm...
Alexandra Goultiaeva, Vicki Iverson, Fahiem Bacchu...
SAT
2009
Springer
95views Hardware» more  SAT 2009»
14 years 4 months ago
Finding Lean Induced Cycles in Binary Hypercubes
Induced (chord-free) cycles in binary hypercubes have many applications in computer science. The state of the art for computing such cycles relies on genetic algorithms, which are,...
Yury Chebiryak, Thomas Wahl, Daniel Kroening, Leop...
PPDP
2009
Springer
14 years 4 months ago
A declarative encoding of telecommunications feature subscription in SAT
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
Michael Codish, Samir Genaim, Peter J. Stuckey
CADE
2009
Springer
14 years 10 months ago
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
Albert Rubio, Cristina Borralleras, Enric Rodr&iac...
PAKDD
2009
ACM
233views Data Mining» more  PAKDD 2009»
14 years 2 months ago
A Kernel Framework for Protein Residue Annotation
Abstract. Over the last decade several prediction methods have been developed for determining structural and functional properties of individual protein residues using sequence and...
Huzefa Rangwala, Christopher Kauffman, George Kary...