Treffer: On completion of constraint handling rules

Title:
On completion of constraint handling rules
Authors:
ABDENNADHER, S, FRÜHWIRTH, T
Source:
CP98 : principles and practice of constraint programming (Pisa, 26-30 October 1998)Lecture notes in computer science. :25-39
Publisher Information:
Berlin; New York NY: Springer-Verlag, 1998.
Publication Year:
1998
Physical Description:
print, 14 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie programmation, Programming theory, Analyse programme, Program analysis, Análisis programa, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Système réécriture, Rewriting systems, Sémantique opérationnelle, Operational semantics, Semantica operacional, Traitement contrainte, Constraint handling, Programmation concurrente par contrainte, Concurrent constraint programming
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Computer Science Institute, University of Munich, Oettingenstr. 67, 80538 München, Germany
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=1570917
Rights:
Copyright 1999 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.1570917
Database:
PASCAL Archive

Weitere Informationen

Constraint Handling Rules (CHR) is a high-level language for writing constraint solvers either from scratch or by modifying existing solvers. An important property of any constraint solver is confluence: The result of a computation should be independent from the order in which constraints arrive and in which rules are applied. In previous work [1], a sufficient and necessary condition for the confluence of terminating CHR programs was given by adapting and extending results about conditional term rewriting systems. In this paper we investigate so-called completion methods that make a non-confluent CHR program confluent by adding new rules. As it turns out, completion can also exhibit inconsistency of a CHR program. Moreover, as shown in this paper, completion can be used to define new constraints in terms of already existing constraints and to derive constraint solvers for them.