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 Variable Elimination During Propagation Solving
KTH, School of Information and Communication Technology (ICT), Electronic, Computer and Software Systems, ECS.ORCID iD: 0000-0002-6283-7004
2008 (English)In: PPDP 2008: Proceedings of the 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, ACM Press, 2008, 247-257 p.Conference paper, Published paper (Refereed)
Abstract [en]

Constraint propagation solvers interleave propagation (removing impossible values from variables domains) with search. Propagation is performed by executing propagators (removing values) implementing constraints (defining impossible values). In order to specify constraint problems with a propagation solver often many new intermediate variables need to be introduced. Each variable plays a role in calculating the value of some expression. But as search proceeds not all of these expressions will be of interest any longer, but the propagators implementing them will remain active. In this paper we show how we can analyse the propagation graph of the solver in linear time to determine intermediate variables that can be removed without effecting the result. Experiments show that applying this analysis can reduce the space and time requirements for constraint propagation on example problems.

Place, publisher, year, edition, pages
ACM Press, 2008. 247-257 p.
Keyword [en]
Analysis, Constraint (logic) programming, Constraint propagation, Redundancy
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-70427DOI: 10.1145/1389449.1389480Scopus ID: 2-s2.0-57549101415OAI: oai:DiVA.org:kth-70427DiVA: diva2:486328
Conference
PPDP 2008: 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming. Valencia. 15 July 2008 - 17 July 2008
Note
QC 20120131Available from: 2012-01-30 Created: 2012-01-30 Last updated: 2012-01-31Bibliographically 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
Electronic, Computer and Software Systems, ECS
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 22 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