Sciweavers

955 search results - page 48 / 191
» A System for Solving Constraint Satisfaction Problems with S...
Sort
View
AAAI
1996
13 years 9 months ago
Qualitative Multiple-Fault Diagnosis of Continuous Dynamic Systems Using Behavioral Modes
Most model-based diagnosis systems, such as GDE and Sherlock, have concerned discrete, static systems such as logic circuits and use simple constraint propagation to detect incons...
Siddarth Subramanian, Raymond J. Mooney
CP
2008
Springer
13 years 9 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...
IV
2002
IEEE
124views Visualization» more  IV 2002»
14 years 27 days ago
Numerical Solving of Geometric Constraints
: In computer-aided design, geometric modeling by constraints enables users to describe shapes by relationships called constraints between geometric elements. The problem is to der...
Samy Ait-Aoudia
JAIR
2010
145views more  JAIR 2010»
13 years 6 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
AAAI
2006
13 years 9 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen