Sciweavers

1138 search results - page 5 / 228
» Parallel Implementation of Constraint Solving
Sort
View
PLILP
1994
Springer
13 years 11 months ago
clp(B): Combining Simplicity and Efficiency in Boolean Constraint Solving
We present the design and the implementation of clp(B): a boolean constraint solver inside the Constraint Logic Programming paradigm. This solver is based on local propagation meth...
Philippe Codognet, Daniel Diaz
RC
2002
100views more  RC 2002»
13 years 7 months ago
Efficient Interval Linear Equality Solving in Constraint Logic Programming
Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving systems of linear constrai...
Chong-Kan Chiu, Jimmy Ho-Man Lee
CADE
2006
Springer
14 years 7 months ago
Solving Sparse Linear Constraints
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
Shuvendu K. Lahiri, Madanlal Musuvathi
IV
2002
IEEE
124views Visualization» more  IV 2002»
14 years 14 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
ICRA
2003
IEEE
101views Robotics» more  ICRA 2003»
14 years 25 days ago
A Branch-and-Prune Algorithm for Solving Systems of Distance Constraints
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...
Josep M. Porta, Federico Thomas, Lluís Ros,...