Computing and Information Systems - Research Publications

Permanent URI for this collection

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

Filters

2005 8
Reset filters

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

Search Results

Now showing 1 - 8 of 8
  • Item
    Thumbnail Image
    Structuring Documents Efficiently
    MARSHALL, RGJ ; BIRD, SG ; STUCKEY, PJ (University of Sydney, 2005)
  • Item
    Thumbnail Image
    Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization
    Bailey, J ; Stuckey, PJ ; Hermenegildo, M ; Cabeza, D (SPRINGER-VERLAG BERLIN, 2005)
  • Item
    Thumbnail Image
    A theory of overloading
    Stuckey, PJ ; Sulzmann, M (ASSOC COMPUTING MACHINERY, 2005-11)
    We present a novel approach to allow for overloading of identifiers in the spirit of type classes. Our approach relies on a combination of the HM(X) type system framework with Constraint Handling Rules (CHRs). CHRs are a declarative language for writing incremental constraint solvers, that provide our scheme with a form of programmable type language. CHRs allow us to precisely describe the relationships among overloaded identifiers. Under some sufficient conditions on the CHRs we achieve decidable type inference and the semantic meaning of programs is unambiguous. Our approach provides a common formal basis for many type class extensions such as multiparameter type classes and functional dependencies.
  • Item
    Thumbnail Image
    When do bounds and domain propagation lead to the same search space?
    Schulte, C ; Stuckey, PJ (ASSOC COMPUTING MACHINERY, 2005-05)
    This article explores the question of when two propagation-based constraint systems have the same behavior, in terms of search space. We categorize the behavior of domain and bounds propagators for primitive constraints, and provide theorems that allow us to determine propagation behaviors for conjunctions of constraints. We then show how we can use this to analyze CLP(FD) programs to determine when we can safely replace domain propagators by more efficient bounds propagators without increasing search space. Empirical evaluation shows that programs optimized by the analysis' results are considerably more efficient.
  • Item
    Thumbnail Image
    Abstract interpretation for constraint handling rules
    SCHRIJVERS, T. ; STUCKEY, P. ; DUCK, G. (ACM Press, 2005)
  • Item
    Thumbnail Image
    Testing for termination with monotonicity constraints
    Codish, M ; Lagoon, V ; Stuckey, PJ ; Gabbrielli, M ; Gupta, G (SPRINGER-VERLAG BERLIN, 2005)
  • Item
    Thumbnail Image
    The G12 project: Mapping solver independent models to efficient solutions
    Stuckey, PJ ; de la Banda, MG ; Maher, M ; Marriott, K ; Slaney, J ; Somogyi, Z ; Wallace, M ; Walsh, T ; Gabbrielli, M ; Gupta, G (SPRINGER-VERLAG BERLIN, 2005)
  • Item
    Thumbnail Image
    Solving set constraint satisfaction problems using ROBDDS
    Hawkins, P ; Lagoon, V ; Stuckey, PJ (AI ACCESS FOUNDATION, 2005)
    In this paper we present a new approach to modeling finite set domain constraint problems using Reduced Ordered Binary Decision Diagrams (ROBDDs). We show that it is possible to construct an efficient set domain propagator which compactly represents many set domains and set constraints using ROBDDs. We demonstrate that the ROBDD-based approach provides unprecedented flexibility in modeling constraint satisfaction problems, leading to performance improvements. We also show that the ROBDD-based modeling approach can be extended to the modeling of integer and multiset constraint problems in a straightforward manner. Since domain propagation is not always practical, we also show how to incorporate less strict consistency notions into the ROBDD framework, such as set bounds, cardinality bounds and lexicographic bounds consistency. Finally, we present experimental results that demonstrate the ROBDD-based solver performs better than various more conventional constraint solvers on several standard set constraint problems.