Sökning: onr:"swepub:oai:DiVA.org:kth-225404" >
When Do Bounds and ...
When Do Bounds and Domain Propagation Lead to the Same Search Space
-
- Schulte, Christian, 1967- (författare)
- KTH,Mikroelektronik och informationsteknik, IMIT
-
Stuckey, Peter J. (författare)
-
(creator_code:org_t)
- ACM Press, 2001
- 2001
- Engelska.
-
Ingår i: Proceedings of the 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'00); Florence; Italy; 5 September 2001 through 7 September 2001. - : ACM Press. - 158113388X ; , s. 115-126
- Relaterad länk:
-
https://chschulte.gi...
-
visa fler...
-
https://urn.kb.se/re...
-
visa färre...
Abstract
Ämnesord
Stäng
- This paper explores the question of when two propagation-based constraint systems have the same behaviour, in terms of search space. We categorise the behaviour of domain and bounds propagators for primitive constraints, and provide theorems that allow us to determine propagation behaviours for conjunctions of constraints. We then show how we can use this to analyse CLP(FD) programs to determine when we can safely replace domain propagators by more efficient bounds propagators without increasing search space.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas