Treffer: Constraint solver synthesis using tabled resolution for constraint logic programming
Title:
Constraint solver synthesis using tabled resolution for constraint logic programming
Authors:
Source:
LOPSTR 2002 : logic based program synthesis and transformation (Madrid, 17-20 September 2002, revised selected papers)Lecture notes in computer science. :32-47
Publisher Information:
Berlin: Springer, 2003.
Publication Year:
2003
Physical Description:
print, 23 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, Fonctions logiques, booléennes et de commutation, Logical, boolean and switching functions, Logiciel, Software, Généralités, General, Base connaissance, Knowledge base, Base conocimiento, Conception programme, Program design, Concepción programa, Génération automatique, Automatic generation, Generación automatica, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Programmation logique, Logical programming, Programación lógica, Satisfaction contrainte, Constraint satisfaction, Satisfaccion restricción, Spécification, Specification, Especificación, Synthèse par règle, Rule synthesis, Síntesis por regla, Système expert, Expert system, Sistema experto
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Computer Science Department, University of Munich Oettingenstr. 67, 80538 München, Germany
Laboratoire d'Ingénierie des Systèmes d'Information Bâtiment 501, INSA Lyon, 69621 Villeurbanne, France
Laboratoire d'Ingénierie des Systèmes d'Information Bâtiment 501, INSA Lyon, 69621 Villeurbanne, France
ISSN:
0302-9743
Rights:
Copyright 2004 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.15691027
Database:
PASCAL Archive
Weitere Informationen
The goal of automated program synthesis is to bridge the gap between what is easy for people to describe and what is possible to execute on a computer. In this paper, we present a framework for synthesis of rule-based solvers for constraints given their logical specification. This approach takes advantage of the power of tabled resolution for constraint logic programming, in order to check the validity of the rules. Compared to previous work [8,19, 2, 5, 3], where different methods for automatic generation of constraint solvers have been proposed, our approach enables the generation of more expressive rules (even recursive and splitting rules).