![]() | 2009 | |
---|---|---|
223 | ![]() ![]() ![]() ![]() ![]() ![]() | Geoffrey Chu, Christian Schulte, Peter J. Stuckey: Confidence-Based Work Stealing in Parallel Constraint Programming. CP 2009: 226-241 |
222 | ![]() ![]() ![]() ![]() ![]() ![]() | Geoffrey Chu, Peter J. Stuckey: Minimizing the Maximum Number of Open Stacks by Customer Search. CP 2009: 242-257 |
221 | ![]() ![]() ![]() ![]() ![]() ![]() | Geoffrey Chu, Peter J. Stuckey, Maria Garcia de la Banda: Using Relaxations in Maximum Density Still Life. CP 2009: 258-273 |
220 | ![]() ![]() ![]() ![]() ![]() ![]() | Thibaut Feydy, Peter J. Stuckey: Lazy Clause Generation Reengineered. CP 2009: 352-366 |
219 | ![]() ![]() ![]() ![]() ![]() ![]() | Alan M. Frisch, Peter J. Stuckey: The Proper Treatment of Undefinedness in Constraint Languages. CP 2009: 367-382 |
218 | ![]() ![]() ![]() ![]() ![]() ![]() | Raphael M. Reischuk, Christian Schulte, Peter J. Stuckey, Guido Tack: Maintaining State in Propagation Solvers. CP 2009: 692-706 |
217 | ![]() ![]() ![]() ![]() ![]() ![]() | Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, Mark Wallace: Why Cumulative Decomposition Is Not as Bad as It Sounds. CP 2009: 746-761 |
216 | ![]() ![]() ![]() ![]() ![]() ![]() | Leslie De Koninck, Gregory J. Duck, Peter J. Stuckey: Demand-Driven Normalisation for ACD Term Rewriting. ICLP 2009: 484-488 |
215 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Codish, Samir Genaim, Peter J. Stuckey: A declarative encoding of telecommunications feature subscription in SAT. PPDP 2009: 255-266 |
214 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Schulte, Peter J. Stuckey: Erratum to "Efficient constraint propagation engines". ACM Trans. Program. Lang. Syst. 31(2): (2009) |
213 | ![]() ![]() ![]() ![]() ![]() ![]() | Alex Stivala, Anthony Wirth, Peter J. Stuckey: Tableau-based protein substructure search using quadratic programming. BMC Bioinformatics 10: (2009) |
212 | ![]() ![]() ![]() ![]() ![]() ![]() | Thibaut Feydy, Peter J. Stuckey: Propagating systems of dense linear integer constraints. Constraints 14(2): 235-253 (2009) |
211 | ![]() ![]() ![]() ![]() ![]() ![]() | Olga Ohrimenko, Peter J. Stuckey, Michael Codish: Propagation via lazy clause generation. Constraints 14(3): 357-391 (2009) |
210 | ![]() ![]() ![]() ![]() ![]() ![]() | Tom Schrijvers, Peter J. Stuckey, Philip Wadler: Monadic constraint programming. J. Funct. Program. 19(6): 663-697 (2009) |
2008 | ||
209 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter J. Stuckey: Principles and Practice of Constraint Programming, 14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008. Proceedings Springer 2008 |
208 | ![]() ![]() ![]() ![]() ![]() ![]() | Olga Ohrimenko, Peter J. Stuckey: Modelling for Lazy Clause Generation. CATS 2008: 27-37 |
207 | ![]() ![]() ![]() ![]() ![]() ![]() | Samuel Huston, Jakob Puchinger, Peter J. Stuckey: The Core Concept for 0/1 Integer Programming. CATS 2008: 39-47 |
206 | ![]() ![]() ![]() ![]() ![]() ![]() | Jakob Puchinger, Peter J. Stuckey, Mark Wallace, Sebastian Brand: From High-Level Model to Branch-and-Price Solution in G12. CPAIOR 2008: 218-232 |
205 | ![]() ![]() ![]() ![]() ![]() ![]() | Graeme Gange, Kim Marriott, Peter J. Stuckey: Smooth Linear Approximation of Non-overlap Constraints. Diagrams 2008: 45-59 |
204 | ![]() ![]() ![]() ![]() ![]() ![]() | Graeme Gange, Vitaly Lagoon, Peter J. Stuckey: Fast Set Bounds Propagation using BDDs. ECAI 2008: 505-509 |
203 | ![]() ![]() ![]() ![]() ![]() ![]() | Leslie De Koninck, Peter J. Stuckey, Gregory J. Duck: Optimizing Compilation of CHR with Rule Priorities. FLOPS 2008: 32-47 |
202 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Schulte, Peter J. Stuckey: Dynamic Analysis of Bounds Versus Domain Propagation. ICLP 2008: 332-346 |
201 | ![]() ![]() ![]() ![]() ![]() ![]() | Gregory J. Duck, Leslie De Koninck, Peter J. Stuckey: Cadmium: An Implementation of ACD Term Rewriting. ICLP 2008: 531-545 |
200 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Codish, Vitaly Lagoon, Peter J. Stuckey: Telecommunications Feature Subscription as a Partial Order Constraint Problem. ICLP 2008: 749-753 |
199 | ![]() ![]() ![]() ![]() ![]() ![]() | Sebastian Brand, Gregory J. Duck, Jakob Puchinger, Peter J. Stuckey: Flexible, Rule-Based Constraint Model Linearisation. PADL 2008: 68-83 |
198 | ![]() ![]() ![]() ![]() ![]() ![]() | Jakob Puchinger, Peter J. Stuckey: Automating branch-and-bound for dynamic programs. PEPM 2008: 81-89 |
197 | ![]() ![]() ![]() ![]() ![]() ![]() | Thibaut Feydy, Andreas Schutt, Peter J. Stuckey: Global difference constraint propagation for finite domain solvers. PPDP 2008: 226-235 |
196 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Schulte, Peter J. Stuckey: Dynamic variable elimination during propagation solving. PPDP 2008: 247-257 |
195 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Wybrow, Kim Marriott, Linda Mciver, Peter J. Stuckey: Comparing usability of one-way and multi-way constraints for diagram editing. ACM Trans. Comput.-Hum. Interact. 14(4): (2008) |
194 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Schulte, Peter J. Stuckey: Efficient constraint propagation engines. ACM Trans. Program. Lang. Syst. 31(1): (2008) |
193 | ![]() ![]() ![]() ![]() ![]() ![]() | Arun Siddharth Konagurthu, Peter J. Stuckey, Arthur M. Lesk: Structural search and retrieval using a tableau representation of protein folding patterns. Bioinformatics 24(5): 645-651 (2008) |
192 | ![]() ![]() ![]() ![]() ![]() ![]() | Natashia Boland, Barry D. Hughes, Liam T. G. Merlot, Peter J. Stuckey: New integer linear programming approaches for course timetabling. Computers & OR 35(7): 2209-2233 (2008) |
191 | ![]() ![]() ![]() ![]() ![]() ![]() | Kim Marriott, Nicholas Nethercote, Reza Rafeh, Peter J. Stuckey, Maria Garcia de la Banda, Mark Wallace: The Design of the Zinc Modelling Language. Constraints 13(3): 229-267 (2008) |
190 | ![]() ![]() ![]() ![]() ![]() ![]() | Tim Dwyer, Kim Marriott, Falk Schreiber, Peter J. Stuckey, Michael Woodward, Michael Wybrow: Exploration of Networks using overview+detail with Constraint-based cooperative layout. IEEE Trans. Vis. Comput. Graph. 14(6): 1293-1300 (2008) |
189 | ![]() ![]() ![]() ![]() ![]() ![]() | Martin Sulzmann, Peter J. Stuckey: HM(X) type inference is CLP(X) solving. J. Funct. Program. 18(2): 251-283 (2008) |
188 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Codish, Vitaly Lagoon, Peter J. Stuckey: Logic programming with satisfiability. TPLP 8(1): 121-128 (2008) |
187 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter J. Stuckey: Constraint Logic Programming using ECLiPSe Krzysztof Apt and Mark Wallace, Cambridge University Press, 2007 Hardback, ISBN 9780521866286, 348 pages. TPLP 8(2): 242-246 (2008) |
2007 | ||
186 | ![]() ![]() ![]() ![]() ![]() ![]() | Sebastian Brand, Nina Narodytska, Claude-Guy Quimper, Peter J. Stuckey, Toby Walsh: Encodings of the Sequence Constraint. CP 2007: 210-224 |
185 | ![]() ![]() ![]() ![]() ![]() ![]() | Nicholas Nethercote, Peter J. Stuckey, Ralph Becket, Sebastian Brand, Gregory J. Duck, Guido Tack: MiniZinc: Towards a Standard CP Modelling Language. CP 2007: 529-543 |
184 | ![]() ![]() ![]() ![]() ![]() ![]() | Olga Ohrimenko, Peter J. Stuckey, Michael Codish: Propagation = Lazy Clause Generation. CP 2007: 544-558 |
183 | ![]() ![]() ![]() ![]() ![]() ![]() | Davaatseren Baatar, Natashia Boland, Sebastian Brand, Peter J. Stuckey: Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches. CPAIOR 2007: 1-15 |
182 | ![]() ![]() ![]() ![]() ![]() ![]() | Kenneth A. Ross, Peter J. Stuckey, Amélie Marian: Practical Preference Relations for Large Data Sets. ICDE Workshops 2007: 229-236 |
181 | ![]() ![]() ![]() ![]() ![]() ![]() | Gregory J. Duck, Peter J. Stuckey, Martin Sulzmann: Observable Confluence for Constraint Handling Rules. ICLP 2007: 224-239 |
180 | ![]() ![]() ![]() ![]() ![]() ![]() | Thibaut Feydy, Peter J. Stuckey: Propagating dense systems of integer linear equations. SAC 2007: 306-310 |
179 | ![]() ![]() ![]() ![]() ![]() ![]() | Kathryn Francis, Peter J. Stuckey: Constraint propagation for loose constraint graphs. SAC 2007: 334-335 |
178 | ![]() ![]() ![]() ![]() ![]() ![]() | Chiu Wo Choi, Jimmy Ho-Man Lee, Peter J. Stuckey: Removing propagation redundant constraints in redundant modeling. ACM Trans. Comput. Log. 8(4): (2007) |
177 | ![]() ![]() ![]() ![]() ![]() ![]() | Andreas Schutt, Peter J. Stuckey: Incremental Satisfiability and Implication for UTVPI Constraints CoRR abs/0709.2961: (2007) |
176 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Codish, Vitaly Lagoon, Peter J. Stuckey: Logic Programming with Satisfiability CoRR abs/cs/0702072: (2007) |
175 | ![]() ![]() ![]() ![]() ![]() ![]() | Maria Garcia de la Banda, Peter J. Stuckey: Dynamic Programming to Minimize the Maximum Number of Open Stacks. INFORMS Journal on Computing 19(4): 607-617 (2007) |
174 | ![]() ![]() ![]() ![]() ![]() ![]() | Martin Sulzmann, Gregory J. Duck, Simon L. Peyton Jones, Peter J. Stuckey: Understanding functional dependencies via constraint handling rules. J. Funct. Program. 17(1): 83-129 (2007) |
173 | ![]() ![]() ![]() ![]() ![]() ![]() | Hai Fang, Y. Kilani, Jimmy Ho-Man Lee, Peter J. Stuckey: The island confinement method for reducing search space in local search methods. J. Heuristics 13(6): 557-585 (2007) |
2006 | ||
172 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter J. Stuckey, Martin Sulzmann, Jeremy Wazny: Type Processing by Constraint Reasoning. APLAS 2006: 1-25 |
171 | ![]() ![]() ![]() ![]() ![]() ![]() | Martin Sulzmann, Tom Schrijvers, Peter J. Stuckey: Principal Type Inference for GHC-Style Multi-parameter Type Classes. APLAS 2006: 26-43 |
170 | ![]() ![]() ![]() ![]() ![]() ![]() | Chiu Wo Choi, Warwick Harvey, J. H. M. Lee, Peter J. Stuckey: Finite Domain Bounds Consistency Revisited. Australian Conference on Artificial Intelligence 2006: 49-58 |
169 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Codish, Vitaly Lagoon, Peter Schachte, Peter J. Stuckey: Size-Change Termination Analysis in k-Bits. ESOP 2006: 230-245 |
168 | ![]() ![]() ![]() ![]() ![]() ![]() | Martin Sulzmann, Jeremy Wazny, Peter J. Stuckey: A Framework for Extended Algebraic Data Types. FLOPS 2006: 47-64 |
167 | ![]() ![]() ![]() ![]() ![]() ![]() | Tim Dwyer, Kim Marriott, Peter J. Stuckey: Fast Node Overlap Removal - Correction. Graph Drawing 2006: 446-447 |
166 | ![]() ![]() ![]() ![]() ![]() ![]() | Gregory J. Duck, Peter J. Stuckey, Sebastian Brand: ACD Term Rewriting. ICLP 2006: 117-131 |
165 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Hawkins, Peter J. Stuckey: A Hybrid BDD and SAT Finite Domain Constraint Solver. PADL 2006: 103-117 |
164 | ![]() ![]() ![]() ![]() ![]() ![]() | Ralph Becket, Maria J. García de la Banda, Kim Marriott, Zoltan Somogyi, Peter J. Stuckey, Mark Wallace: Adding Constraint Solving to Mercury. PADL 2006: 118-133 |
163 | ![]() ![]() ![]() ![]() ![]() ![]() | Rafiq Muhammad, Peter J. Stuckey: A Stochastic Non-CNF SAT Solver. PRICAI 2006: 120-129 |
162 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Codish, Vitaly Lagoon, Peter J. Stuckey: Solving Partial Order Constraints for LPO Termination. RTA 2006: 4-18 |
161 | ![]() ![]() ![]() ![]() ![]() ![]() | Hai Fang, Y. Kilani, Jimmy Ho-Man Lee, Peter J. Stuckey: Islands for SAT CoRR abs/cs/0607071: (2006) |
160 | ![]() ![]() ![]() ![]() ![]() ![]() | Gregory J. Duck, Peter J. Stuckey, Sebastian Brand: ACD Term Rewriting CoRR abs/cs/0608016: (2006) |
159 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Schulte, Peter J. Stuckey: Efficient constraint propagation engines CoRR abs/cs/0611009: (2006) |
158 | ![]() ![]() ![]() ![]() ![]() ![]() | Tom Schrijvers, Bart Demoen, Gregory J. Duck, Peter J. Stuckey, Thom W. Frühwirth: Automatic Implication Checking for CHR Constraints. Electr. Notes Theor. Comput. Sci. 147(1): 93-111 (2006) |
157 | ![]() ![]() ![]() ![]() ![]() ![]() | Arun Siddharth Konagurthu, Peter J. Stuckey: Optimal Sum-of-Pairs Multiple Sequence Alignment Using Incremental Carrillo and Lipman Bounds. Journal of Computational Biology 13(3): 668-685 (2006) |
156 | ![]() ![]() ![]() ![]() ![]() ![]() | Tom Schrijvers, Bart Demoen, Maria J. García de la Banda, Peter J. Stuckey: Improving PARMA trailing. TPLP 6(6): 609-644 (2006) |
2005 | ||
155 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter J. Stuckey, Maria J. García de la Banda, Michael J. Maher, Kim Marriott, John K. Slaney, Zoltan Somogyi, Mark Wallace, Toby Walsh: The G12 Project: Mapping Solver Independent Models to Efficient Solutions. CP 2005: 13-16 |
154 | ![]() ![]() ![]() ![]() ![]() ![]() | Tim Dwyer, Kim Marriott, Peter J. Stuckey: Fast Node Overlap Removal. Graph Drawing 2005: 153-164 |
153 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Wybrow, Kim Marriott, Peter J. Stuckey: Incremental Connector Routing. Graph Drawing 2005: 446-457 |
152 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Codish, Vitaly Lagoon, Peter J. Stuckey: Testing for Termination with Monotonicity Constraints. ICLP 2005: 326-340 |
151 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter J. Stuckey, Maria J. García de la Banda, Michael J. Maher, Kim Marriott, John K. Slaney, Zoltan Somogyi, Mark Wallace, Toby Walsh: The G12 Project: Mapping Solver Independent Models to Efficient Solutions. ICLP 2005: 9-13 |
150 | ![]() ![]() ![]() ![]() ![]() ![]() | James Bailey, Peter J. Stuckey: Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization. PADL 2005: 174-186 |
149 | ![]() ![]() ![]() ![]() ![]() ![]() | Tom Schrijvers, Peter J. Stuckey, Gregory J. Duck: Abstract interpretation for constraint handling rules. PPDP 2005: 218-229 |
148 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Schulte, Peter J. Stuckey: When do bounds and domain propagation lead to the same search space? ACM Trans. Program. Lang. Syst. 27(3): 388-425 (2005) |
147 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter J. Stuckey, Martin Sulzmann: A theory of overloading. ACM Trans. Program. Lang. Syst. 27(6): 1216-1269 (2005) |
146 | ![]() ![]() ![]() ![]() ![]() ![]() | Tom Schrijvers, Maria J. García de la Banda, Bart Demoen, Peter J. Stuckey: Improving PARMA Trailing CoRR abs/cs/0505085: (2005) |
145 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter J. Stuckey, Martin Sulzmann, Jeremy Wazny: Improved Inference for Checking Annotations CoRR abs/cs/0507036: (2005) |
144 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter J. Stuckey, Martin Sulzmann: Type Inference for Guarded Recursive Data Types CoRR abs/cs/0507037: (2005) |
143 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Codish, Vitaly Lagoon, Peter J. Stuckey: Solving Partial Order Constraints for LPO Termination CoRR abs/cs/0512067: (2005) |
142 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Hawkins, Vitaly Lagoon, Peter J. Stuckey: Solving Set Constraint Satisfaction Problems using ROBDDs. J. Artif. Intell. Res. (JAIR) 24: 109-156 (2005) |
141 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Holzbaur, Maria J. García de la Banda, Peter J. Stuckey, Gregory J. Duck: Optimizing compilation of constraint handling rules in HAL. TPLP 5(4-5): 503-531 (2005) |
140 | ![]() ![]() ![]() ![]() ![]() ![]() | Maria J. García de la Banda, Warwick Harvey, Kim Marriott, Peter J. Stuckey, Bart Demoen: Checking modes of HAL progams. TPLP 5(6): 623-668 (2005) |
2004 | ||
139 | ![]() ![]() ![]() ![]() ![]() ![]() | Yukiyoshi Kameyama, Peter J. Stuckey: Functional and Logic Programming, 7th International Symposium, FLOPS 2004, Nara, Japan, April 7-9, 2004, Proceedings Springer 2004 |
138 | ![]() ![]() ![]() ![]() ![]() ![]() | Kim Marriott, Bernd Meyer, Peter J. Stuckey: Towards Flexible Graphical Communication Using Adaptive Diagrams. ASIAN 2004: 380-394 |
137 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Hawkins, Vitaly Lagoon, Peter J. Stuckey: Set Bounds and (Split) Set Domain Propagation Using ROBDDs. Australian Conference on Artificial Intelligence 2004: 706-717 |
136 | ![]() ![]() ![]() ![]() ![]() ![]() | Vitaly Lagoon, Peter J. Stuckey: Set Domain Propagation Using ROBDDs. CP 2004: 347-361 |
135 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Schulte, Peter J. Stuckey: Speeding Up Constraint Propagation. CP 2004: 619-633 |
134 | ![]() ![]() ![]() ![]() ![]() ![]() | Gregory J. Duck, Simon L. Peyton Jones, Peter J. Stuckey, Martin Sulzmann: Sound and Decidable Type Inference for Functional Dependencies. ESOP 2004: 49-63 |
133 | ![]() ![]() ![]() ![]() ![]() ![]() | Gregory J. Duck, Maria J. García de la Banda, Peter J. Stuckey: Compiling Ask Constraints. ICLP 2004: 105-119 |
132 | ![]() ![]() ![]() ![]() ![]() ![]() | Gregory J. Duck, Peter J. Stuckey, Maria J. García de la Banda, Christian Holzbaur: The Refined Operational Semantics of Constraint Handling Rules. ICLP 2004: 90-104 |
131 | ![]() ![]() ![]() ![]() ![]() ![]() | Konstantinos F. Sagonas, Peter J. Stuckey: Just enough tabling. PPDP 2004: 78-89 |
130 | ![]() ![]() ![]() ![]() ![]() ![]() | Germán Puebla, Jesús Correas, Manuel V. Hermenegildo, Francisco Bueno, Maria J. García de la Banda, Kim Marriott, Peter J. Stuckey: A Generic Framework for Context-Sensitive Analysis of Modular Programs. Program Development in Computational Logic 2004: 233-260 |
129 | ![]() ![]() ![]() ![]() ![]() ![]() | Bart Demoen, Maria J. García de la Banda, Warwick Harvey, Kim Marriott, David Overton, Peter J. Stuckey: Herbrand Constraints in HAL. Program Development in Computational Logic 2004: 499-538 |
128 | ![]() ![]() ![]() ![]() ![]() ![]() | Chiu Wo Choi, Warwick Harvey, Jimmy Ho-Man Lee, Peter J. Stuckey: Finite Domain Bounds Consistency Revisited CoRR abs/cs/0412021: (2004) |
127 | ![]() ![]() ![]() |