- Computing and Information Systems - Research Publications
Computing and Information Systems - Research Publications
Permanent URI for this collection
9 results
Filters
Reset filtersSettings
Statistics
Citations
Search Results
Now showing
1 - 9 of 9
-
ItemPrincipal type inference for GHC-style multi-parameter type classesSulzmann, M ; Schrijvers, T ; Stuckey, PJ ; Kobayashi, N (SPRINGER-VERLAG BERLIN, 2006)
-
ItemLazy Clause Generation: Combining the Power of SAT and CP (and MIP?) SolvingStuckey, PJ ; Lodi, A ; Milano, M ; Toth, P (SPRINGER-VERLAG BERLIN, 2010)
-
ItemTelecommunications feature subscription as a partial order constraint problemCODISH, M. ; LAGOON, V. ; STUCKEY, P. (Springer Verlag, 2008)
-
ItemDiscovery of minimal unsatisfiable subsets of constraints using hitting set dualizationBailey, J ; Stuckey, PJ ; Hermenegildo, M ; Cabeza, D (SPRINGER-VERLAG BERLIN, 2005)
-
ItemPropagating Dense Systems of Integer Linear EquationsFeydy, T ; Stuckey, PJ (ASSOC COMPUTING MACHINERY, 2007)
-
ItemPropagation = Lazy Clause GenerationOHRIMENKO, O. ; STUCKEY, P. ; CODISH, M. (Springer Verlag, 2007)
-
ItemDynamic Analysis of Bounds Versus Domain PropagationSchulte, C ; Stuckey, PJ ; DelaBanda, MG ; Pontelli, E (Springer, 2008-12-01)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 space 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 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.
-
ItemFast node overlap removalDwyer, T ; Marriott, K ; Stuckey, PJ ; Healy, P ; Nikolov, NS (SPRINGER-VERLAG BERLIN, 2006)
-
ItemIncremental connector routingWybrow, M ; Marriott, K ; Stuckey, PJ ; Healy, P ; Nikolov, NS (SPRINGER-VERLAG BERLIN, 2006)