Sökning: onr:"swepub:oai:DiVA.org:kth-31286" >
Dynamic Analysis of...
Dynamic Analysis of Bounds Versus Domain Propagation
-
- Schulte, Christian (författare)
- KTH,Programvaru- och datorsystem, SCS
-
Stuckey, Peter J. (författare)
-
(creator_code:org_t)
- Berlin, Heidelberg : Springer Berlin Heidelberg, 2008
- 2008
- Engelska.
-
Ingår i: LOGIC PROGRAMMING, PROCEEDINGS. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 9783540899815 ; , s. 332-346
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- Computer programming
- Logic programming
- Programming theory
- Constraint graphs
- Constraint propagation
- Domain propagation
- Dynamic method (DM)
- Search spaces
- Variable domains
- Computer science
- Datavetenskap
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas