Sciweavers

Share
4 search results - page 1 / 1
» Semantics-preserving translations between linear concurrent ...
Sort
View
PPDP
2010
Springer
11 years 9 months ago
Semantics-preserving translations between linear concurrent constraint programming and constraint handling rules
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first con...
Thierry Martinez
INFORMS
1998
150views more  INFORMS 1998»
11 years 11 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
CORR
2011
Springer
220views Education» more  CORR 2011»
11 years 7 months ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
Thomas Schoenemann, Simon Masnou, Daniel Cremers
ICLP
2005
Springer
12 years 5 months ago
HYPROLOG: A New Logic Programming Language with Assumptions and Abduction
We present HYPROLOG, a novel integration of Prolog with assumptions and abduction which is implemented in and partly borrows syntax from Constraint Handling Rules (CHR) for integri...
Henning Christiansen, Verónica Dahl
books