Sciweavers

4117 search results - page 17 / 824
» On the Satisfiability of Complex Constraints
Sort
View
87
Voted
FLAIRS
2001
14 years 10 months ago
Detection of Inconsistencies in Complex Product Configuration Data Using Extended Propositional SAT-Checking
We present our consistency support tool BIS, an extension to the electronic product data management system (EPDMS) used at DaimlerChrysler AG to configure the Mercedes lines of pa...
Carsten Sinz, Andreas Kaiser, Wolfgang Küchli...
DISOPT
2006
155views more  DISOPT 2006»
14 years 9 months ago
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
Dorit S. Hochbaum, Asaf Levin
DATE
2007
IEEE
85views Hardware» more  DATE 2007»
15 years 3 months ago
QuteSAT: a robust circuit-based SAT solver for complex circuit structure
We propose a robust circuit-based Boolean Satisfiability (SAT) solver, QuteSAT, that can be applied to complex circuit netlist structure. Several novel techniques are proposed in ...
Chi-An Wu, Ting-Hao Lin, Chih-Chun Lee, Chung-Yang...
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
14 years 11 months ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn
79
Voted
SAC
2010
ACM
14 years 9 months ago
Graph-based verification of static program constraints
Software artifacts usually have static program constraints and these constraints should be satisfied in each reuse. In addition to this, the developers are also required to satisf...
Selim Ciraci, Pim van den Broek, Mehmet Aksit