Sciweavers

20 search results - page 2 / 4
» Operational Equivalence of CHR Programs and Constraints
Sort
View
ICLP
2005
Springer
13 years 11 months ago
A Type System for CHR
Abstract. We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension ...
Emmanuel Coquery, François Fages
ICLP
2005
Springer
13 years 11 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
CPAIOR
2010
Springer
13 years 4 months ago
Automatically Exploiting Subproblem Equivalence in Constraint Programming
Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when tw...
Geoffrey Chu, Maria Garcia de la Banda, Peter J. S...
POPL
1992
ACM
13 years 9 months ago
Semantic Foundations of Jade
Jade is a language designed to support coarse-grain parallelism on both shared and distributed addressspace machines. Jade is data-oriented: a Jade programmer simply augments a se...
Martin C. Rinard, Monica S. Lam
CPAIOR
2009
Springer
14 years 9 days ago
The Polytope of Context-Free Grammar Constraints
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
Gilles Pesant, Claude-Guy Quimper, Louis-Martin Ro...