Sperber, Cara, and Girotto (Cognition52 (1995) 3) argued that, in Wason's selection task,
relevance-guided comprehension processes tend to determine participants' performance …

Constraint Handling Rules (CHR) is a high-level programming language based on
multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint …

Abstract Constraint Handling Rules (CHR) is both an effective concurrent declarative
constraint-based programming language and a versatile computational formalism. While …

Constraint programming can be divided very crudely into modeling and solving. Modeling
defines the problem, in terms of variables that can take on different values, subject to …

A well-known and powerful constraint model reformulation is to compute the solutions to a
model part, say a custom constraint predicate, and tabulate them within an extensional …

Constraint models often describe complicated problems that contain sub-problems that
could be solved in sub-models. Although pre-solving these sub-models might improve the …

Abstract Constraint Handling Rules [1, 2] is a high-level programming language extension
based on multi-headed committed-choice multiset rewrite rules. It can be used as a stand …

In this paper, we present an abstract framework for learning a finite domain constraint solver
modeled by a set of operators enforcing a consistency. The behavior of the consistency to be …

We present a way of integrating machine learning capabilities in constraint reasoning
systems by the use of partially defined constraints called Open Constraints. This enables a …

Partially Defined Constraints can be used to model the incomplete knowledge of a concept
or a relation. Instead of only computing with the known part of the constraint, we propose to …