Show simple item record

dc.contributor.authorDimopoulos, Yannisen
dc.contributor.authorStergiou, K.en
dc.creatorDimopoulos, Yannisen
dc.creatorStergiou, K.en
dc.description.abstractConstraint Satisfaction Problems and Prepositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importance in both frameworks is that of constraint propagation. In this paper we study and compare the amount of propagation that can be achieved, using various methods, when translating a problem from one framework into another. Our results complement, extend, and tie together recent similar studies. We provide insight as to which translation is preferable, with respect to the strength of propagation in the original problem and the encodings. © Springer-Verlag Berlin Heidelberg 2006.en
dc.source12th International Conference on Principles and Practice of Constraint Programming, CP 2006en
dc.subjectProblem solvingen
dc.subjectSignal encodingen
dc.subjectTranslation (languages)en
dc.subjectCombinatorial mathematicsen
dc.subjectCombinatorial problemsen
dc.subjectConstraint Satisfaction Problemsen
dc.titlePropagation in CSP and SATen
dc.description.volume4204 LNCSen
dc.description.endingpage151 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied SciencesΤμήμα Πληροφορικής / Department of Computer Science
dc.description.notesCork Constraint Computation Centreen
dc.description.notesEcole des Mines de Nantesen
dc.description.noteset al.en
dc.description.notesConference code: 68402en
dc.description.notesCited By :7</p>en
dc.description.notes<p>Sponsors: Association Francaise pour la Programmation par Contraintesfr
dc.description.notesConseil General de Loire-Atlantiquefr
dc.source.abbreviationLect. Notes Comput. Sci.en
dc.contributor.orcidDimopoulos, Yannis [0000-0001-9583-9754]

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record