Sciweavers

81 search results - page 7 / 17
» Approximating module semantics with constraints
Sort
View
EMO
2009
Springer
174views Optimization» more  EMO 2009»
15 years 4 months ago
Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
Pascal Van Hentenryck
CIE
2009
Springer
15 years 4 months ago
Stochastic Programs and Hybrid Automata for (Biological) Modeling
We present a technique to associate to stochastic programs written in stochastic Concurrent Constraint Programming a semantics in terms of a lattice of hybrid automata. The aim of ...
Luca Bortolussi, Alberto Policriti
HEURISTICS
2006
95views more  HEURISTICS 2006»
14 years 9 months ago
Hard and soft constraints for reasoning about qualitative conditional preferences
Many real life optimization problems are defined in terms of both hard and soft constraints, and qualitative conditional preferences. However, there is as yet no single framework f...
Carmel Domshlak, Steven David Prestwich, Francesca...
SLP
1994
121views more  SLP 1994»
14 years 11 months ago
CLP(Intervals) Revisited
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive ...
Frédéric Benhamou, David A. McAllest...
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
15 years 1 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi