Sciweavers

21 search results - page 2 / 5
» What Is a Real-World SAT Instance
Sort
View
CP
2009
Springer
14 years 6 months ago
On the Structure of Industrial SAT Instances
Abstract. During this decade, it has been observed that many realworld graphs, like the web and some social and metabolic networks, have a scale-free structure. These graphs are ch...
Carlos Ansótegui, Jordi Levy, Maria Luisa B...
JAR
2007
132views more  JAR 2007»
13 years 6 months ago
Visualizing SAT Instances and Runs of the DPLL Algorithm
SAT-solvers have turned into essential tools in many areas of applied logic like, for example, hardware verification or satisfiability checking modulo theories (SMT). And althoug...
Carsten Sinz
AAAI
2008
13 years 8 months ago
Measuring the Hardness of SAT Instances
The search of a precise measure of what hardness of SAT instances means for state-of-the-art solvers is a relevant research question. Among others, the space complexity of treelik...
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...
PPDP
2010
Springer
13 years 4 months ago
A declarative approach to robust weighted Max-SAT
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
Miquel Bofill, Dídac Busquets, Mateu Villar...
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
13 years 10 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...