Treffer: When do bounds and domain propagation lead to the same search space?
Title:
When do bounds and domain propagation lead to the same search space?
Authors:
Source:
ACM transactions on programming languages and systems. 27(3):388-425
Publisher Information:
New York, NY: Association for Computing Machinery, 2005.
Publication Year:
2005
Physical Description:
print, 1 p.1/4
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, Logiciel, Software, Langages de programmation, Programming languages, Analyse programme, Program analysis, Análisis programa, Interprétation abstraite, Abstract interpretation, Interpretación Abstracta, Langage programmation, Programming language, Lenguaje programación, Optimisation programme, Program optimization, Optimización programa, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Satisfaction contrainte, Constraint satisfaction, Satisfaccion restricción, Vérification programme, Program verification, Verificación programa, Experimentation, Languages, Performance Constraint (logic) programming, Theory, abstract interpretation, bounds propagation, domain propagation, finite domain constraints, program analysis
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
KTH-Royal Institute of Technology, Stockholm, Sweden
University of Melbourne, United States
University of Melbourne, United States
ISSN:
0164-0925
Rights:
Copyright 2005 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.16871794
Database:
PASCAL Archive
Weitere Informationen
This article explores the question of when two propagation-based constraint systems have the same behavior, in terms of search space. We categorize the behavior of domain and bounds propagators for primitive constraints, and provide theorems that allow us to determine propagation behaviors for conjunctions of constraints. We then show how we can use this to analyze CLP(FD) programs to determine when we can safely replace domain propagators by more efficient bounds propagators without increasing search space. Empirical evaluation shows that programs optimized by the analysis' results are considerably more efficient.