Sciweavers

13 search results - page 1 / 3
» An efficient finite-domain constraint solver for circuits
Sort
View
CP
2003
Springer
13 years 9 months ago
Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree Search
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-ba...
Stefano Bistarelli, Philippe Codognet, Kin Chuen H...
CP
2008
Springer
13 years 6 months ago
Universal Booleanization of Constraint Models
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
Jinbo Huang
DAC
2004
ACM
14 years 5 months ago
An efficient finite-domain constraint solver for circuits
Ganapathy Parthasarathy, Madhu K. Iyer, Kwang-Ting...
AIPS
2008
13 years 6 months ago
CircuitTSAT: A Solver for Large Instances of the Disjunctive Temporal Problem
In this paper, we report on a new solver for large instances of the Disjunctive Temporal Problem (DTP). Our solver is based primarily on the idea of employing "compact" ...
Blaine Nelson, T. K. Satish Kumar
DAC
2009
ACM
14 years 5 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke