Change search
ReferencesLink to record
Permanent link

Direct link
Dynamic Analysis of Bounds Versus Domain Propagation
KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.ORCID iD: 0000-0002-6283-7004
2008 (English)In: LOGIC PROGRAMMING, PROCEEDINGS / [ed] DelaBanda MG; Pontelli E, 2008, Vol. 5366, 332-346 p.Conference paper (Refereed)
Abstract [en]

Constraint propagation solvers interleave propagation (removing impossible values from variable domains) with search. Previously, Schulte and Stuckey introduced the use of static analysis to determine where in a constraint program domain propagators can be replaced by more efficient bounds propagators and still ensure that the same search) is traversed. This paper introduces a dynamic,yet considerably simpler approach to uncover the same information. The information is obtained by a linear time traversal of an analysis graph that straightforwardly, v reflects the properties of propagators implementing constraints. Experiments confirm that the simple, dynamic method is efficient and that it can be used interleaved with search, taking advantage of the simplification of the constraint graph that arises from search.

Place, publisher, year, edition, pages
2008. Vol. 5366, 332-346 p.
Keyword [en]
Computer programming, Logic programming, Programming theory, Constraint graphs, Constraint propagation, Domain propagation, Dynamic method (DM), Search spaces, Variable domains
National Category
Computer Science
URN: urn:nbn:se:kth:diva-31286DOI: 10.1007/978-3-540-89982-2_32ISI: 000262929700027ScopusID: 2-s2.0-58549119821ISBN: 978-3-540-89981-5OAI: diva2:403183
24th International Conference on Logic Programming (ICLP), Udine, ITALY, DEC 09-13, 2008
QC 20110311Available from: 2011-03-11 Created: 2011-03-11 Last updated: 2011-03-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Schulte, Christian
By organisation
Software and Computer Systems, SCS
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 12 hits
ReferencesLink to record
Permanent link

Direct link