920 search results - page 12 / 184 » Generating Satisfiable Problem Instances |
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present a novel way for reasoning about (possibly ir)rational quantifier-free non-linear arithmetic by a reduction to SAT/SMT. The approach is incomplete and dedicated...
ATVA
2010
Springer
13 years 4 months ago
2010
Springer
The problem of synthesising a reactive system is discussed. The most standard instance of this problem ask to construct a finite input-output automaton satisfying a given regular s...
AAAI
2010
13 years 5 months ago
2010
Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicti...
DAC
2004
ACM
14 years 8 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
WEA
2010
Springer
14 years 22 days ago
2010
Springer
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...