Treffer: Inferring constraint types in Constraint Programming
Title:
Inferring constraint types in Constraint Programming
Authors:
Source:
CP 2002 : principles and practice of constraint programming - CP 2002 (Ithaca NY, 9-13 September 2002)Lecture notes in computer science. :492-507
Publisher Information:
Berlin: Springer, 2002.
Publication Year:
2002
Physical Description:
print, 11 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, Intelligence artificielle, Artificial intelligence, Résolution de problèmes, jeux, Problem solving, game playing, Algèbre, Algebra, Organisation système, System configuration, Organización sistema, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Satisfaction contrainte, Constraint satisfaction, Satisfaccion restricción, Langage contrainte relationnelle
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Intelligent Systems Lab, BTexact Technologies, BT France, 11, place des Vosges, 92061 Courbevoie, France
ISSN:
0302-9743
Rights:
Copyright 2003 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
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.14614432
Database:
PASCAL Archive
Weitere Informationen
Capturing constraint structure is critical in Constraint Programming to support the configuration and adaptation of domain filtering algorithms. To this end, we propose a software model coupling a relational constraint language, a constraint type inference system, and an algorithm configuration system. The relational language allows for expressing constraints from primitive constraints; the type system infers the type of constraint expressions out of primitive constraint types; and the configuration system synthesises algorithms out of primitive routines using constraint types. In this paper, we focus on the issue of constraint type inferencing, and present a method to implement sound and extendible inference systems.