Treffer: Ad-hoc global constraints for life
Title:
Ad-hoc global constraints for life
Authors:
Source:
Principles and practice of constraint programming - CP 2005 (11th international conference, CP 2005, Sitges, Spain, October 1-5, 2005, proceedings)Lecture notes in computer science. :182-195
Publisher Information:
New York, NY: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 13 ref 1
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, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Diagramme binaire décision, Binary decision diagram, Diagrama binaria decisión, Programmation en nombres entiers, Integer programming, Programación entera, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Raisonnement basé sur cas, Case based reasoning, Razonamiento fundado sobre caso, Contrainte globale ad hoc
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
National University of Singapore, 3 Science Drive 2, Singapore
ISSN:
0302-9743
Rights:
Copyright 2006 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.17324996
Database:
PASCAL Archive
Weitere Informationen
Still-life is a challenging problem for CP techniques. We show how to use the global case constraint to construct ad-hoc constraints which can provide stronger propagation than existing CP models. We also demonstrate how to use BDDs to construct good representations for the case constraint which is critical for efficiency. Our results seem comparable to hybrid CP/IP models even though we are only using propagation albeit on ad-hoc global constraints. This is rather promising since it shows the potential of ad-hoc global constraints to do better than IP global constraints.