Sciweavers

955 search results - page 17 / 191
» A System for Solving Constraint Satisfaction Problems with S...
Sort
View
KCAP
2005
ACM
15 years 3 months ago
Knowledge base reuse through constraint relaxation
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...
Tomas Eric Nordlander, Derek H. Sleeman, Ken N. Br...
71
Voted
IPL
2007
71views more  IPL 2007»
14 years 9 months ago
Relaxations of semiring constraint satisfaction problems
Abstract. The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. In this framework ...
Louise Leenen, Thomas Andreas Meyer, Aditya Ghose
84
Voted
IJCAI
1989
14 years 10 months ago
An Algebraic Approach to Constraint Satisfaction Problems
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
Igor Rivin, Ramin Zabih
ECML
2005
Springer
15 years 3 months ago
A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
Christian Bessière, Remi Coletta, Fré...
84
Voted
SPDP
1991
IEEE
15 years 29 days ago
Parallel and distributed algorithms for finite constraint satisfaction problems
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
Ying Zhang, Alan K. Mackworth