(Enter summary)
Abstract: We study here a natural situation when constraint programming can be entirely reduced
to rule-based programming. To this end we consider constraint satisfaction problems that
are based on predefined, explicitly given constraints. To solve them we first derive rules
from these constraints and limit the computation process to a repeated application of
these rules, combined with labeling.
We consider here two types of rules. The first type, that we call equality rules, leads to a
new notion of... (Update)
Context of citations to this paper: More
.... This turned out to be slower than pre compiling the defining table into domain reduction rules that can be scheduled e#ciently [2, 1]. We add the following heuristics to KCSP with minimising constraints to (attempt to) reduce the depth of the KCSP search tree: the...
Cited by: More
Sequential Automatic Test Pattern Generation - Constraint Programming Sebastian
(Correct)
Propagation Completeness of Reactive Constraints - Maher (2002)
(Correct)
Analysis of a Global Contiguity Constraint - Maher (2002)
(Correct)
Similar documents (at the sentence level):
20.0%: Automatic Generation of Constraint Propagation Algorithms for.. - Apt, Monfroy (1999)
(Correct)
Active bibliography (related documents): More All
0.5: A Coordination-based Chaotic Iteration Algorithm for Constraint.. - Monfroy (2000)
(Correct)
0.3: Automatic Creation of Boundary-Representation Models from Single.. - Varley (2002)
(Correct)
0.3: Principles of Constraint Programming - Apt (2000)
(Correct)
Similar documents based on text: More All
0.3: Basic Components for Constraint Solver Cooperations - Monfroy, Castro (2003)
(Correct)
0.2: The Role of Commutativity in Constraint Propagation Algorithms - Apt
(Correct)
0.2: The Rough Guide to Constraint Propagation - Apt (1999)
(Correct)
Related documents from co-citation: More All
4: Concurrent Constraint Programming (context) - Saraswat - 1990
2: Constraint logic programming: A survey
- Jaffar, Maher - 1994
2: Introducing Global Constraints in CHIP
- Beldiceanu, Contejean - 1994
BibTeX entry: (Update)
K.R. Apt and E. Monfroy. Constraint programming viewed as rule-based programming. Theory and Practice of Logic Programming, 2001. http://citeseer.ist.psu.edu/apt00constraint.html More
@article{ apt01constraint,
author = "Krzysztof R. Apt and Eric Monfroy",
title = "Constraint programming viewed as rule-based programming",
journal = "Theory and Practice of Logic Programming",
volume = "1",
number = "6",
pages = "713-750",
year = "2001",
url = "citeseer.ist.psu.edu/apt00constraint.html" }
Citations (may not include all citations):
1044
Maintaining knowledge about temporal intervals (context) - Allen - 1983
981
Principles of database and knowledge-base systems (context) - Ullman - 1988
702
Consistency in networks of relations (context) - Mackworth - 1977
473
Foundations of constraint satisfaction (context) - Tsang - 1993
343
Introduction to metamathematics (context) - Kleene - 1952
142
Constraint propagation with interval labels (context) - Davis - 1987
73
Generating semantic descriptions from drawings of scenes wit.. (context) - Waltz - 1975
66
Theory and practice of constraint handling rules
- Fruhwirth - 1998
56
Good old discrete relaxation (context) - Mohr, Masini - 1988
52
The essence of constraint propagation
- Apt - 1999
49
Constraint satisfaction using constraint logic programming (context) - Van Hentenryck, Simonis et al. - 1992
46
Programming with constraints (context) - Marriott, Stuckey - 1998
37
Constraint relaxation may be perfect (context) - Montanari, Rossi - 1991
29
An overview of elan (context) - Borovansky, Kirchner et al. - 1998
27
Introduction to the CLAIRE programming language (context) - Caseau, Laburthe - 1996
22
The OPS5 user's manual (context) - Forgy - 1981
14
Building constraint satisfaction problem solvers using rewri.. (context) - Castro - 1998
13
Local and global relational consistency
- Dechter, van Beek - 1997
13
A proof theoretic view of constraint programming
- Apt - 1998
12
Rule-based constraint programming
- Kirchner, Ringeissen - 1998
12
A nine-valued circuit model for test generation (context) - Muth - 1976
5
An introduction to fuzzy sets (context) - Pedrycz, Gomide - 1998
3
Line labelling by meta-programming (context) - By - 1997
3
Artificial intelligence (context) - Luger, Stubblefield - 1998
2
A simple and efficient Boolean constraint solver for constra.. (context) - Codognet, Diaz - 1996
Documents on the same site (http://www.cwi.nl/~apt/): More
Reasoning about Termination of Pure Prolog Programs - Apt, Pedreschi (1993)
(Correct)
A Declarative Approach for First-Order Built-in's of Prolog - Apt (1992)
(Correct)
Reasoning about Prolog Programs: from Modes through Types to.. - Apt, Marchiori (1994)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC