- Computing and Information Systems - Research Publications
Computing and Information Systems - Research Publications
Permanent URI for this collection
10 results
Filters
Reset filtersSettings
Statistics
Citations
Search Results
Now showing
1 - 10 of 10
-
ItemObservable confluence for constraint handling rulesDuck, GJ ; Stuckey, PJ ; Sulzmann, M ; Dahl, V ; Niemela, I (SPRINGER-VERLAG BERLIN, 2007)
-
ItemA framework for extended algebraic data typesSulzmann, M ; Wazny, J ; Stuckey, PJ ; Hagiya, M ; Wadler, P (SPRINGER, 2006)
-
ItemSolving partial order constraints for LPO terminationCodish, M ; Lagoon, V ; Stuckey, PJ ; Pfenning, F (SPRINGER-VERLAG BERLIN, 2006)This paper introduces a new kind of propositional encoding for reasoning about partial orders. The symbols in an unspecified partial order are viewed as variables which take integer values and are interpreted as indices in the order. For a partial order statement on n symbols each index is represented in log2 n propositional variables and partial order constraints between symbols are modeled on the bit representations. We illustrate the application of our approach to determine LPO termination for term rewrite systems. Experimental results are unequivocal, indicating orders of magnitude speedups in comparison with current implementations for LPO termination. The proposed encoding is general and relevant to other applications which involve propositional reasoning about partial orders.
-
ItemSize-change termination analysis in κ-bitsCodish, M ; Lagoon, V ; Schachte, P ; Stuckey, PJ ; Sestoft, P (SPRINGER-VERLAG BERLIN, 2006)
-
ItemType processing by constraint reasoningStuckey, PJ ; Sulzmann, M ; Wazny, J ; Kobayashi, N (SPRINGER-VERLAG BERLIN, 2006)
-
ItemMiniZinc: Towards a Standard CP Modelling LanguageNETHERCOTE, N. ; STUCKEY, P. ; BECKET, R. ; BRAND, S. ; DUCK, G. ; TACK, G. (Springer Verlag, 2007)
-
ItemAdding constraint solving to MercuryBecket, R ; de la Banda, MG ; Marriott, K ; Somogyi, Z ; Stuckey, PJ ; Wallace, M ; VanHentenryck, P (SPRINGER-VERLAG BERLIN, 2006)
-
ItemACD Term RewritingDuck, GJ ; Stuckey, PJ ; Brand, S ; Etalle, S ; Truszczynski, M (SPRINGER-VERLAG BERLIN, 2006)
-
ItemMinimum cardinality matrix decomposition into consecutive-ones matrices: CP and IP approachesBaatar, D ; Boland, N ; Brand, S ; Stuckey, PJ ; VanHentenryck, P ; Wolsey, L (SPRINGER-VERLAG BERLIN, 2007)
-
ItemUnderstanding functional dependencies via constraint handling rulesSulzmann, M ; Duck, GJ ; Peyton-Jones, S ; Stuckey, PJ (CAMBRIDGE UNIV PRESS, 2007-01)Abstract Functional dependencies are a popular and useful extension to Haskell style type classes. We give a reformulation of functional dependencies in terms of Constraint Handling Rules (CHRs). In previous work, CHRs have been employed for describing user-programmable type extensions in the context of Haskell style type classes. Here, we make use of CHRs to provide for the first time a concise result that under some sufficient conditions, functional dependencies allow for sound, complete and decidable type inference. The sufficient conditions imposed on functional dependencies can be very limiting. We show how to safely relax these conditions and suggest several sound extensions of functional dependencies. Our results allow for a better understanding of functional dependencies and open up the opportunity for new applications.