Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
19,630
Constraint Solving
"... Abstract: The PAM project has developed techniques and tools based on constraint solving to assist the avionics platform design team to select the adequate number of resources, the topology of resource interconnection and the safe allocation of resources to functions and data-flows of the supported ..."
Abstract
- Add to MetaCart
Abstract: The PAM project has developed techniques and tools based on constraint solving to assist the avionics platform design team to select the adequate number of resources, the topology of resource interconnection and the safe allocation of resources to functions and data-flows of the supported
Geometric constraint solving
- Computing in Euclidean Geometry
, 1995
"... We survey the current state of the art in geometric constraint solving. Both 2D and 3D constraint solving is considered, and different approaches are characterized. ..."
Abstract
-
Cited by 45 (8 self)
- Add to MetaCart
We survey the current state of the art in geometric constraint solving. Both 2D and 3D constraint solving is considered, and different approaches are characterized.
Heterogeneous Constraint Solving
- PROCEEDINGS OF ALP'96, VOLUME 1139 OF LNCS
, 1996
"... Most CLP languages designed in the past few years feature at least some combination of constraint solving capabilities. These combinations can take multiple forms since they achieve either the mixing of di erent domains or the use of di erent algorithms over the same domain. These solvers are also v ..."
Abstract
-
Cited by 50 (10 self)
- Add to MetaCart
Most CLP languages designed in the past few years feature at least some combination of constraint solving capabilities. These combinations can take multiple forms since they achieve either the mixing of di erent domains or the use of di erent algorithms over the same domain. These solvers are also
Basics on Geometric Constraint Solving
"... We survey the current state of the art in geometric constraint solving. Both 2D and 3D constraint solving is considered, and different approaches are characterized. ..."
Abstract
- Add to MetaCart
We survey the current state of the art in geometric constraint solving. Both 2D and 3D constraint solving is considered, and different approaches are characterized.
2 Constraint Solving on Terms
"... In this chapter, we focus on constraint solving on terms, also called Herbrand constraints in the introductory chapter, and we follow the main concepts introduced in that chapter. The most popular constraint system on terms is probably unification problems ..."
Abstract
- Add to MetaCart
In this chapter, we focus on constraint solving on terms, also called Herbrand constraints in the introductory chapter, and we follow the main concepts introduced in that chapter. The most popular constraint system on terms is probably unification problems
Constraint Solving over Semi-rings
- in IJCAI
, 1995
"... We introduce a general framework for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. The framework is based on a semiring structure, where the set of the semiring specifies the values to be associated to each tuple o ..."
Abstract
-
Cited by 108 (37 self)
- Add to MetaCart
We introduce a general framework for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. The framework is based on a semiring structure, where the set of the semiring specifies the values to be associated to each tuple
Towards Inductive Constraint Solving
, 2001
"... A difficulty that arises frequently when writing a constraint solver is to determine the constraint propagation and simplification algorithm. In previous work, different methods for automatic generation of propagation rules [5,17,3] and simplification rules [4] for constraints defined over finite do ..."
Abstract
-
Cited by 10 (6 self)
- Add to MetaCart
domains have been proposed. In this paper, we present a method for generating rule-based solvers for constraint predicates defined by means of a constraint logic program, even when the constraint domain is infinite. This approach can be seen as a concrete step towards Inductive Constraint Solving.
On Exploiting Structures for Constraint Solving
"... The constraint satisfaction problem (CSP) instances modeling problems occurring in practice often have structures which can be exploited to speed-up the constraint solving process. This thesis explores the exploitation of three such structures. The three structures explored in this thesis are: 1. Tr ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
The constraint satisfaction problem (CSP) instances modeling problems occurring in practice often have structures which can be exploited to speed-up the constraint solving process. This thesis explores the exploitation of three such structures. The three structures explored in this thesis are: 1
Program analysis as constraint solving
- In PLDI
, 2008
"... A constraint-based approach to invariant generation in programs translates a program into constraints that are solved using off-theshelf constraint solvers to yield desired program invariants. In this paper we show how the constraint-based approach can be used to model a wide spectrum of program ana ..."
Abstract
-
Cited by 54 (11 self)
- Add to MetaCart
A constraint-based approach to invariant generation in programs translates a program into constraints that are solved using off-theshelf constraint solvers to yield desired program invariants. In this paper we show how the constraint-based approach can be used to model a wide spectrum of program
Results 1 - 10
of
19,630
