295 search results - page 26 / 59 » SAT, SMT and Applications |
111
click to vote
AI
2010
Springer
15 years 2 months ago
2010
Springer
The past decade has seen clause learning as the most successful algorithm for SAT instances arising from real-world applications. This practical success is accompanied by theoreti...
DAC
2002
ACM
16 years 2 months ago
2002
ACM
Research in algorithms for Boolean satisfiability and their efficient implementations [26, 8] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks fro...
114
click to vote
CSR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. While thorough theoretical and experimental analyses have been ...
115
click to vote
AI
2005
Springer
15 years 1 months ago
2005
Springer
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
112
click to vote
PPDP
2009
Springer
15 years 8 months ago
2009
Springer
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...