Result: Towards propagation = logic + control

Title:
Towards propagation = logic + control
Authors:
BRAND, Sebastian, YAP, Roland H. C
Source:
Logic programming (22nd international conference, ICLP 2006)0ICLP 2006. :102-116
Publisher Information:
Berlin: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 1 p 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, Fonctions logiques, booléennes et de commutation, Logical, boolean and switching functions, Commande logique, Logic control, Control lógico, Inférence, Inference, Inferencia, Lexicographie, Lexicography, Lexicografía, Programmation logique, Logical programming, Programación lógica, Relation ordre, Ordering, Relación orden, Satisfaction contrainte, Constraint satisfaction, Satisfaccion restricción, Sémantique, Semantics, Semántica
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
National ICT Australia, Victoria Research Lab, Melbourne, Australia
School of Computing, National University of Singapore, Singapore
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19104696
Rights:
Copyright 2007 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.19104696
Database:
PASCAL Archive

Further Information

Constraint propagation algorithms implement logical inference. For efficiency, it is essential to control whether and in what order basic inference steps are taken. We provide a high-level framework that clearly differentiates between information needed for controlling propagation versus that needed for the logical semantics of complex constraints composed from primitive ones. We argue for the appropriateness of our controlled propagation framework by showing that it captures the underlying principles of manually designed propagation algorithms, such as literal watching for unit clause propagation and the lexicographic ordering constraint. We provide an implementation and benchmark results that demonstrate the practicality and efficiency of our framework.