719 search results - page 14 / 144 » Solving Sparse Linear Constraints |
CP
2001
Springer
15 years 2 months ago
2001
Springer
In interactive graphical applications we often require that objects do not overlap. Such non-overlap constraints can be modelled as disjunctions of arithmetic inequalities. Unfortu...
SAT
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...
SAS
2001
Springer
15 years 2 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
ICTAI
2008
IEEE
15 years 4 months ago
2008
IEEE
Boolean satisfiability (SAT) finds a wide range of practical applications, including Artificial Intelligence and, more recently, Bioinformatics. Although encoding some combinat...
CODES
2010
IEEE
14 years 8 months ago
2010
IEEE
Due to the ever increasing system complexity, deciding whether a given platform is sufficient to implement a set of applications under given constraints becomes a serious bottlene...