Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
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, Published 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.
Series
LECTURE NOTES IN COMPUTER SCIENCE, ISSN 0302-9743 ; 5366
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
Identifiers
URN: urn:nbn:se:kth:diva-31286DOI: 10.1007/978-3-540-89982-2_32ISI: 000262929700027Scopus ID: 2-s2.0-58549119821ISBN: 978-3-540-89981-5 (print)OAI: oai:DiVA.org:kth-31286DiVA: diva2:403183
Conference
24th International Conference on Logic Programming (ICLP), Udine, ITALY, DEC 09-13, 2008
Note
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

Authority records BETA

Schulte, Christian

Search in DiVA

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

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 27 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf