Computing and Information Systems - Research Publications

Permanent URI for this collection

http://hdl.handle.net/11343/350

Filters

2008 - 2009 25
Reset filters

Settings
Statistics
Citations
Start date: 2008 × End date: 2009 × Author: Stuckey, Peter ×

Search Results

Now showing 1 - 10 of 25
  • Item
    Thumbnail Image
    Optimizing compilation of CHR with rule priorities
    De Koninck, L ; Stuckey, PJ ; Duck, GJ ; Garrigue, J ; Hermenegildo, M (Springer, 2008-05-14)
  • Item
    Thumbnail Image
    Telecommunications feature subscription as a partial order constraint problem
    CODISH, M. ; LAGOON, V. ; STUCKEY, P. (Springer Verlag, 2008)
  • Item
    Thumbnail Image
    Smooth Linear Approximation of Non-overlap Constraints
    Gange, G ; Marriott, K ; Stuckey, PJ ; Stapleton, G ; Howse, J ; Lee, J (SPRINGER-VERLAG BERLIN, 2008)
  • Item
    Thumbnail Image
    Modelling for lazy clause generation
    Ohrimenko, O ; Stuckey, PJ (Australian Computer Society, 2008-12-01)
  • Item
    Thumbnail Image
    The core concept for 0/1 integer programming
    Huston, S ; Puchinger, J ; Stuckey, P (Australian Computer Society, 2008-12-01)
  • Item
    Thumbnail Image
    Efficient Constraint Propagation Engines
    Schulte, C ; Stuckey, PJ (ASSOC COMPUTING MACHINERY, 2008-12)
    This article presents a model and implementation techniques for speeding up constraint propagation. Three fundamental approaches to improving constraint propagation based on propagators as implementations of constraints are explored: keeping track of which propagators are at fixpoint, choosing which propagator to apply next, and how to combine several propagators for the same constraint. We show how idempotence reasoning and events help track fixpoints more accurately. We improve these methods by using them dynamically (taking into account current variable domains to improve accuracy). We define priority-based approaches to choosing a next propagator and show that dynamic priorities can improve propagation. We illustrate that the use of multiple propagators for the same constraint can be advantageous with priorities, and introduce staged propagators that combine the effects of multiple propagators with priorities for greater efficiency.
  • Item
    Thumbnail Image
    Comparing Usability of One-Way and Multi-Way Constraints for Diagram Editing
    WYBROW, M. ; MARRIOTT, K. ; MCIVER, L. ; STUCKEY, P. ( 2008)
  • Item
    Thumbnail Image
    The Evolving World of MiniZinc
    STUCKEY, P ; BECKET, R ; BRAND, S ; BROWN, M ; FEYDY, T ; FISCHER, J ; Garcia de la Banda, ; Marriott, ; Wallace, (The Association for Constraint Programming, 2009)
  • Item
    Thumbnail Image
    Monadic constraint programming
    Schrijvers, T ; Stuckey, P ; Wadler, P (CAMBRIDGE UNIV PRESS, 2009-11)
    Abstract A constraint programming system combines two essential components: a constraint solver and a search engine. The constraint solver reasons about satisfiability of conjunctions of constraints, and the search engine controls the search for solutions by iteratively exploring a disjunctive search tree defined by the constraint program. In this paper we give a monadic definition of constraint programming in which the solver is defined as a monad threaded through the monadic search tree. We are then able to define search and search strategies as first-class objects that can themselves be built or extended by composable search transformers. Search transformers give a powerful and unifying approach to viewing search in constraint programming, and the resulting constraint programming system is first class and extremely flexible.
  • Item
    Thumbnail Image
    HM(X) type inference is CLP(X) solving
    Sulzmann, M ; Stuckey, PJ (CAMBRIDGE UNIV PRESS, 2008-03)