Constraint Programming Platform Publications
Constraint Programming Platform related publications by project members
- 9 Books
- 8 Book Chapters
- 55 Journal Articles
- 140 Conference Publications
Books
Maria Garcia de la Banda, Enrico Pontelli: Logic Programming, 24th International Conference, ICLP 2008, Udine, Italy, December 9-13 2008, Proceedings Springer 2008
Handbook of Satisfiability. Edited by Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh. Published by IOS Press (February 2009)
Peter J. Stuckey, editor. Proceedings of the Fourteenth International Conference on Principles and Practice of Constraint Programming. Number 5202 in Lecture Notes in Computer Science. Springer-Verlag, 2008.
Alessandro Armando, Peter Baumgartner, and Gilles Dowek, editors. Automated Reasoning - 4th International Conference, IJCAR 2008, volume 5195 of Lecture Notes in Artificial Intelligence. Springer, August 2008.
Handbook of Constraint Programming. Francesca Rossi, Peter van Beek, and Toby Walsh (Editors). Foundations of Artificial Intelligence series. Elsevier 2006. ISBN 0-444-52726-5, 978 pages
SAT-2005: satisfiability research in the year 2005. Enrico Giunchiglia and Toby Walsh (Editors) General Computer Science series, Springer 2006.
Annalisa Bossi and Michael J. Maher, Principles and Practice of Declarative Programming, ACM Press, 2006.
Franz Baader, Peter Baumgartner, Robert Nieuwenhuis, and Andrei Voronkov. 05431 abstracts collection deduction and applications. In Franz Baader, Peter Baumgartner, Robert Nieuwenhuis, and Andrei Voronkov, editors, Deduction and Applications, number 05431 in Dagstuhl Seminar Proceedings. Internationales Begegnungsund Forschungszentrum (IBFI), Schloss Dagstuhl, Germany, 2006. <http://drops.dagstuhl.de/opus/volltexte/2006/562>
Wolfgang Ahrendt, Peter Baumgartner, Hans de Nivelle, Silvio Ranise, and Cesare Tinelli, editors. Selected Papers from the Workshops on Disproving and the Second International Workshop on Pragmatics of Decision Procedures (PDPAR 2004), volume 125 of Electronic Notes in Theoretical Computer Science. Elsevier, 2005.
Book Chapters
Constraint Programming. Toby Walsh. Chapter in Handbook of Knowledge Representation. 2008. ISBN 0-444-52211-5
Günther R. Raidl and Jakob Puchinger. Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization. In C. Blum et al., editors, Hybrid Metaheuristics - An Emerging Approach to Optimization. Springer, May 2008.
Sandro Pirkwieser, Günther R. Raidl, and Jakob Puchinger. A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem. C. Cotta and J. van Hemert (Eds.), Recent Advances in Evolutionary Computation for Combinatorial Optimization. Studies in Computational Intelligence, Vol. 153. Springer, 2008.
John Slaney Anbulagan, Duc Nghia Pham and Abdul Sattar. Boosting SLS using resolution. In Narendra Jussien Frederic Benhamou and Barry OSullivan, editors, Trends in Constraint Programming, pages 283289. 2007.
Mark Wallace. Hybrid algorithms in constraint programming. In Re- cent Advances in Constraints, volume 4651 of Lecture Notes in Computer Science, pages 132. Springer, 2007.
Anbulagan, Duc Nghia Pham, John Slaney and Abdul Sattar. Boosting SLS Using Resolution. In Frederic Benhamou, Narendra Jussien and Barry O'Sullivan (Editors), Trends in Constraint Programming, chapter 17, pages 283-289, ISTE, May 2007, ISBN 9781905209972.
K. Marriott, P.J. Stuckey, and M. Wallace. Constraint Logic Programming. Handbook of Constraint Programming, pages 409-452. Elsevier, 2006.
P. Kilby and P. Shaw. Vehicle routing. In Handbook of Constraint Programming, Foundations of Artificial Intelligence, pages 801-836, 2006.
Journals
Peter Baumgartner and Evgenij Thorstensen. Instance based methods a brief overview. KI - Kunstliche Intelligenz, February 2010.
R. Gaire, J. Bailey, J. Bearfoot, I. Campbell, P.J. Stuckey, and I. Haviv. MIRAGAA a methodology for finding coordinated effects of microRNA expression changes and genome aberrations in cancer. Bioinformatics, 26(2):161167, 2010.
Michela Milano and Mark Wallace. Integrating operations research in constraint programming. Annals of Operations Research, 175(1):3776, March 2010.
A. Stivala, A. Wirth, and P.J. Stuckey. Tableau-based protein substructure search using quadratic programming. BMC Bioinformatics, 10:153, 2009.
O. Ohrimenko, P.J. Stuckey, and M. Codish. Propagation via lazy clause generation. Constraints, 14(3):357391, 2009.
T. Feydy and P.J. Stuckey. Propagating systems of dense linear integer constraints. Constraints, 14(2):235253, 2009.
G. Chiu, A. Harwood, and P.J. Stuckey. Cache conscious data structures for Boolean satisfiability solvers. Journal on Satisfiability, Boolean Modeling and Computation, 6:99-120,
T. Schrijvers, P.J. Stuckey, and P. Wadler. Monadic constraint programming. Journal of Functional Programming, 19(6):663697, 2009.2009.
Michael J. Maher. Local consistency for extended CSPs. Theor. Comput. Sci., 410(46):47694783, 2009.
Christopher Mears, Maria Garc ́ıa de la Banda, and Mark Wallace. On implementing symmetry detection. Constraints, 14(2):443477, December 2009.
Anika Schumann, Martin Sachenbacher, and Jinbo Huang. Computing optimal tests for non-deterministic systems using DNNF graphs. Electr. Notes Theor. Comput. Sci., 253(2):8799, 2009.
Peter Baumgartner, Alexander Fuchs, Hans de Nivelle, and Cesare Tinelli. Computing finite models by reduction to function-free clause logic. Journal of Applied Logic, 7(1):5874, March 2009.
C. Bessiere, E. Hebrard, B. Hnich, Z. Kiziltan, and T. Walsh. Range and roots: Two common patterns for specifying and propagating counting and occurrence constraints. Artificial Intelligence, 173(11):10541078, 2009.
Filtering algorithms for the multiset ordering constraint. Alan Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel and Toby Walsh. Artificial Intelligence, 173 (2), 299-328, 2009.
M.S. Pini, F. Rossi, K.B. Venable, and T. Walsh. Aggregating partially ordered preferences. J. Log. Comput., 19(3):475502, 2009.
Jakob Puchinger, Gunther R. Raidl, and Sandro Pirkwieser. Metaboosting: Enhancing integer programming techniques by metaheuristics. In V. Maniezzo, Stuetzle, and S. Voss, editors, Matheuristics: Hybridizing Metaheuristics and Mathematical Programming, volume 10 of Annals of Information Systems. 2009.
Asif Ali and John Slaney. Counting loops with the inverse property. Quasigroups and Related Structures, 16:1316, 2008.
Duc Nghia Pham, John Thornton, Abdul Sattar: Modelling and Solving Temporal Reasoning as Propositional Satisfiability. Artif. Intell. 172(15): 1752-1782 (2008)
Duc Nghia Pham, John Thornton, Charles Gretton, Abdul Sattar: Combining Adaptive and Dynamic Local Search for Satifiability. Journal on Satisfiability, Boolean Modeling and Computation (JSAT) 4:149-172 (2008)
G.N. Mercer and S.I. Barry and D. O. Marlow and P. Kilby, Investigating the Effect of Detection and Classification Range and Aircraft Dynamics on a Simplified Maritime Surveillance Scenario, ANZIAM Journal, 49:C475--C492, 2008
Peter Baumgartner and Cesare Tinelli. The Model Evolution Calculus as a First-Order DPLL Method. Artificial Intelligence, 172(4-5):591-632, 2008.
Peter Baumgartner, Ulrich Furbach, and Björn Pelzer. The Hyper Tableaux Calculus with Equality and an Application to Finite Model Computation. Journal of Logic and Computation, November 2008.
Tomasz Kowalski and John Slaney. A Finite Fragment of S3, Reports on Mathematical Logic. 43: 65-72, 2008.
Constraint Programming -- the Paradigm to Watch. Mark Wallace 1:7--13, 2007, Constraint Programming Letters (ISSN 1932-0973)
C. Schulte and P.J. Stuckey. Efficient constraint propagation engines. ACM Transactions on Programming Languages and Systems, 31(1):Article No. 2, 2008. K. Marriott, N. Nethercote, R. Rafeh, P.J. Stuckey, M. Garcia de la Banda, and M. Wallace. The design of the Zinc modelling language. Constraints, 13(3):229-267, 2008.
M. Codish, V. Lagoon, and P.J. Stuckey. Termination analysis using partial order constraints. Journal on Satisfiability, Boolean Modeling and Computation, 5:193-215, 2008.
N. Boland, B. Hughes, L. Merlot, and P.J. Stuckey. New integer linear programming approaches for course timetabling. Computers and Operations Research, 35(7):2209-2233, 2008.
M. Wybrow, K. Marriott, L. McIver, and P.J. Stuckey. Comparing usability of one-way and multi-way constraints for diagram editing. ACM Transactions on Computer-Human Interaction (TOCHI), 14(4), 2008.
M. Sulzmann and P.J. Stuckey. HM(X) type inference is CLP(X) solving. Journal of Functional Programming, 18(2):251-283, 2008.
A. Konargurthu, P.J. Stuckey, and A. Lesk. Structural search and retrieval using a tableau representation of protein folding patterns. Bioinformatics, 24(5):645-651, 2008.
M. Codish, V. Lagoon, and P.J. Stuckey. Logic programming with satisfiability. Theory and Practice of Logic Programming, 8(1):121-128, 2008.
H. Fang, Y. Kilani, J.H.M. Lee, and P.J. Stuckey. The island confinement method for reducing search space in local search methods. Journal of Heuristics, 13:557-585, 2007.
M. Garcia de la Banda and P.J. Stuckey. Dynamic programming to minimize the maximum number of open stacks. INFORMS Journal of Computing, 19(4):607-617, 2007.
C.W. Choi, J.H.M. Lee, and P.J. Stuckey. Removing propagation redundant constraints in redundant modeling. ACM Transactions on Computational Logic, 8(4):art 23, 2007.
M. Sulzmann, G.J. Duck, S. Peyton-Jones, and P.J. Stuckey. Understanding functional dependencies via constraint handling rules. Journal of Functional Programming, 17:83-129, 2007.
Jakob Puchinger and Günther R. Raidl. Models and algorithms for three-stage two-dimensional bin packing. European Journal of Operational Research, Volume 183, Issue 3, 16. December 2007, Pages 1304-1327.
Jakob Puchinger and Günther R. Raidl. Bringing order into the neighborhoods: Relaxation guided variable neighborhood search. Journal of Heuristics, 14(5): 457-472, 2008.
The Language of Search. Jinbo Huang and Adnan Darwiche. Journal of Artificial Intelligence Research, Volume 29, 2007, pages 191-219.
Preferences in Constraint Satisfaction and Optimization. Francesca Rossi, Brent Venable and Toby Walsh. AI Magazine, 29 (4), 58-68, 2008.
Christian Bessiere, Kostas Stergiou and Toby Walsh, Domain filtering consistencies for non-binary constraints, Artificial Intelligence Volume 172, Issues 6-7, April 2008, Pages 800-822.
The Complexity of Global Constraints. Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, and Toby Walsh. Constraints, 12 (2), 2007.
Filtering algorithms for the NVALUE constraint. Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, and Toby Walsh. Constraints, 11 (4), 271-293, 2006
Propagation algorithms for lexicographic ordering constraint. Alan Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel and Toby Walsh. Artificial Intelligence, 170 (10), 803-908, 2006.
Hard and soft constraints for reasoning about qualitative conditional preferences. Carmel Domshlak, Steve Prestwich, Francesca Rossi, Kristen Brent Venable and Toby Walsh. Journal of Heuristics, 12 (2-5), 263-285, 2006.
Stochastic Constraint Programming: A Scenario-Based Approach. S. Armagan Tarim, Suresh Manandhar, and Toby Walsh. Constraints, 11 (1), 53-81, 2006.
A. Konagurthu, J. Whisstock, P.J. Stuckey, and A. Lesk. MUSTANG: A multiple structural alignment algorithm. Proteins: Structure, Function and Bioinformatics, 64(3):559-574, August 2006.
A. Konagurthu and P.J. Stuckey. Optimal sum-of-pairs multiple sequence alignment using incremental Carrillo-and-Lipman bounds. Journal of Computational Biology, 13(3):668-685, 2006.
T. Schrijvers, B. Demoen, G.J. Duck, P.J. Stuckey, and T. Fruehwirth. Automatic implication checking for CHR constraints. Electronic Notes in Theoretical Computer Science, 147:93-111, January 2006. http://www.sciencedirect.com/science/journal/15710661.
C. Schulte and P.J. Stuckey. When do bounds and domain propagation lead to the same search space. ACM Transactions on Programming Languages and Systems, 27(3):388-425, 2005.
C. Holzbaur, M. Garcia de la Banda, P.J. Stuckey, and G. Duck. Optimizing compilation of constraint handling rules in HAL. Theory and Practice of Logic Programming, 5(4-):503-532, 2005.
P. Hawkins, V. Lagoon, and P.J. Stuckey. Solving set constraint satisfaction problems using ROBDDs. Journal of Artificial Intelligence Research, 24:106-156, 2005.
P. Baumgartner, A. Fuchs, and C. Tinelli. Implementing the model evolution calculus. International Journal of Artificial Intelligence Tools, 15:21-52, 2006.
M. Sulzmann, G.J. Duck, S. Peyton-Jones, and P.J. Stuckey. Understanding functional dependencies via constraint handling rules. Journal of Functional Programming, 17:83-129, 2007.
T. Schrijvers, B. Demoen, M. Garcia de la Banda, and P.J. Stuckey. Improving PARMA trailing. Theory and Practice of Logic Programming, 6(6):609-44, 2006.
Conference Publications
N. Downing, P.J. Stuckey, and A. Wirth. Improved consensus clustering via linear programming. In Proceedsings of the Australasian Computer Science Conference (ACSC 2010)
Anbulagan and John K. Slaney. Towards a generic CNF simplifier for minimising structured problem hardness. In 21st IEEE International Conference on Tools with Artificial Intelligence, pages 99106, 2009.
Peter Baumgartner and John Slaney. Constraint modelling: A challenge for automated reasoning. In Nicolas Peltier and Viorica Sofronie-Stokkermans, editors, Proceedings of the 7th International Workshop on First-Order Theorem Proving (FTP09), volume 556 of Workshop Proceedings, pages 418. CEUR, 2009.
Peter Baumgartner and Uwe Waldmann. Superposition and model evolution combined. In Renate Schmidt, editor, CADE-22 The 22nd International Conference on Automated Deduction, volume 5663 of Lecture Notes in Artificial Intelligence, pages 1734, Montreal, Canada, July 2009. Springer.
Sebastian Brand. The Sum-of-Increments Constraint in the Consecutive-Ones. Matrix Decomposition Problem. SAC'09: 24th Annual ACM Symposium on Applied Computing, 2009.
Computing Optimal Distinguishing Tests for Non-deterministic Systems Using DNNF Graphs. Anika Schumann, Martin Sachenbacher, and Jinbo Huang. Fifth Workshop on Model Based Testing (MBT-09).
C. Bessiere, G. Katsirelos, N. Narodytska, and T. Walsh. Circuit complexity and decompositions of global constraints. In Proceedings of 21st IJCAI, pages 412418. International Joint Conference on AI, 2009.
G. Chu, C. Schulte, and P.J. Stuckey. Confidence-based work stealing in parallel constraint programming. In I. Gent, editor, Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, volume 5732 of LNCS, pages 226241. Springer-Verlag, 2009.
G. Chu and P.J. Stuckey. Minimizing the maximum number of open stacks by customer search. In I. Gent, editor, Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, volume 5732 of LNCS, pages 242257. Springer-Verlag, 2009.
G. Chu, P.J. Stuckey, and M. Garcia de la Banda. Using relaxations in maximum density still life. In I. Gent, editor, Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, volume 5732 of LNCS, pages 258273. Springer-Verlag, 2009.
M. Codish, S. Genaim, and P.J. Stuckey. A declarative encoding of telecommunications feature subscription in SAT. In Proceedings of 11th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, pages 255266. ACM Press, 2009.
L. De Koninck, G. Duck, and P.J. Stuckey. Demand-driven normalisation for ACD term rewriting. In Proceedings of the 25th International Conference on Logic Programming, LNCS, pages 484488. Springer, 2009.
T. Feydy and P.J. Stuckey. Lazy clause generation reengineered. In I. Gent, editor, Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, volume 5732 of LNCS, pages 352366. Springer-Verlag, 2009.
S. Haim and T. Walsh. Restart strategy selection using machine learning techniques. In O. Kullmann, editor, Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings, volume 5584 of Lecture Notes in Computer Science, pages 312325. Springer, 2009.
G. Katsirelos, S. Maneth, N. Narodytska, and T. Walsh. Restricted global grammar constraints. In I.P. Gent, editor, Principles and Practice of Constraint Programming - CP 2009, 15th International Conference, CP 2009, Lisbon, Portugal, September 20-24, 2009, Proceedings, volume 5732 of Lecture Notes in Computer Science, pages 501508. Springer, 2009.
G. Katsirelos, N. Narodytska, and T. Walsh. Reformulating global grammar constraints. volume 5547 of Lecture Notes in Computer Sci- ence, pages 132147. Springer, 2009.
Michael J. Maher. Open constraints in a boundable world. In Proceed- ings of CPAIOR 2009, pages 163177, 2009.
Michael J. Maher. Open contractible global constraints. In Proceedings IJCAI 2009, pages 578583, 2009.
Michael J. Maher. Soggy constraints: Soft open global constraints. In Proceedings of CP2009, pages 584591, 2009.
E. Pilotto, F. Rossi, K. Venable, and T. Walsh. Compact preference representation in stable marriage problems. In Francesca Rossi and Alexis Tsoukia`s, editors, Algorithmic Decision Theory, First International Conference, ADT 2009, Venice, Italy, October 20-23, 2009. Pro- ceedings, volume 5783 of Lecture Notes in Computer Science, pages 390401. Springer, 2009.
Anika Schumann, Martin Sachenbacher, and Jinbo Huang. Constraint-based optimal testing using DNNF graphs. In Principles and Practice of Constraint Programming - CP 2009, 15th International Conference, CP 2009, pages 731745, 2009.
A. Schutt, T. Feydy, P.J. Stuckey, and M. Wallace. Why cumulative decomposition is not as bad as it sounds. In I. Gent, editor, Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, volume 5732 of LNCS, pages 746761. Springer-Verlag, 2009.
T. Walsh. Where are the really hard manipulation problems? The phase transition in manipulating the veto rule. In Proceedings of 21st IJCAI, pages 324329. International Joint Conference on AI, 2009
Manipulation and gender neutrality in stable marriage procedures. Maria Pini, Francesca Rossi, Brent Venable and Toby Walsh. Proceedings of AAMAS-2009, 2009.
Combining Symmetry Breaking and Global Constraints. George Katsirelos, Nina Narodytska, and Toby Walsh. "Recent Advances in Constraints", LNCS post-conference proceedings of CSCLP-2008, 2009.
Dealing with incomplete agents' preferences and an uncertain agenda in group decision making via sequential majority voting. Maria Pini, Francesca Rossi, Brent Venable and Toby Walsh. Proceedings of KR-2008, 2008.
Elicitation strategies for fuzzy constraint problems with missing preferences: algorithms and experimental studies. Mirco Gelain, Maria Pini, Francesca Rossi, Brent Venable and Toby Walsh. Proceedings of CP-2008, 2008.
Flow-Based Propagators for the SEQUENCE and Related Global Constraints. Michael Maher, Nina Narodytska, Claude-Guy Quimper and Toby Walsh. Proceedings of CP-2008, 2008.
SLIDE: a useful special case of the CardPath constraint. Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan and Toby Walsh. Proceedings of ECAI-2008, 475-479, 2008.
The Weighted CFG Constraint. George Katsirelos, Nina Narodytska, Toby Walsh. Proc. CPAIOR 2008, Springer LNCS 5015 , 2008
Parameterize Complexity of Global Constraints. Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Claude-Guy Quimper and Toby Walsh. Proceedings of AAAI-2008, 2008.
Decompositions of Grammar Constraints. Claude-Guy Quimper and Toby Walsh. Proceedings of AAAI-2008, 2008.
Breaking Value Symmetry. Toby Walsh. Proceedings of AAAI-2008, 2008.
Complexity of Terminating Preference Elicitation. Toby Walsh. Proceedings of AAMAS-2008, 2008.
Online Estimation of SAT Solving Runtime. Shai Haim and Toby Walsh. Proceedings of SAT-2008, 2008. Peter Baumgartner, Alexander Fuchs, and Cesare Tinelli.
ME(LIA) - Model Evolution With Linear Integer Arithmetic Constraints. In I. Cervesato, H. Veith, and A. Voronkov, editors, Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR'08), volume 5330 of Lecture Notes in Artificial Intelligence, pages 258-273. Springer, November 2008.
Peter Baumgartner, Ulrich Furbach, and Björn Pelzer. Hyper Tableaux with Equality. In Frank Pfenning, editor. Automated Deduction - CADE-21, volume 4603 of Lecture Notes in Artificial Intelligence. Springer, 2007, pages 492-507.
Peter Baumgartner. Logical Engineering with Instance-Based Methods. In Frank Pfenning, editor. Automated Deduction - CADE-21, volume 4603 of Lecture Notes in Artificial Intelligence. Springer, 2007, pages 404-409.
A Compression Algorithm for Large Arity Extensional Constraints. George Katsirelos and Toby Walsh. Proceedings of CP-2007, LNCS 4741, 379-393 2007.
Breaking symmetry of interchangeable variables and values. Yat-Chiu Law, Jimmy Lee, Toby Walsh and Justin Yip. Proceedings of CP-2007, LNCS 4741, 423-437, 2007.
Decomposing Global Grammar Constraints. Claude-Guy Quimper and Toby Walsh. Proceedings of CP-2007, LNCS 4741, 590-604 2007.
Breaking value symmetry. Toby Walsh. Proceedings of CP-2007, LNCS 4741, 880-888, 2007.
DCGs + Memoing = Packrat Parsing; But is it worth it? Ralph Becket and Zoltan Somogyi. Proceedings of the Tenth International Symposium on Practical Aspects of Declarative languages. San Francisco, California January 2008
G.J. Duck, L. De Koninck, and P.J. Stuckey. Cadmium: An implementation of ACD term rewriting. In M. Garcia de la Banda and E. Pontelli, editors, Proceedings of the 24th International Conference on Logic Programming, LNCS, pages 531-545, Springer, 2008.
C. Schulte and P.J. Stuckey. Dynamic analysis of bounds versus domain propagation. In M. Garcia de la Banda and E. Pontelli, editors, Proceedings of the 24th International Conference on Logic Programming, LNCS, pages 332-346. Springer, 2008.
M. Codish, V. Lagoon, and P.J. Stuckey. Telecommunications feature subscription as a partial order constraint problem. In M. Garcia de la Banda and E. Pontelli, editors, Proceedings of the 24th International Conference on Logic Programming, LNCS, pages 749-753. Springer, 2008.
T. Dwyer, K. Marriott, F. Schreiber, P.J. Stuckey, M. Woodward, and M. Wybrow. Exploration of networks using overview and detail with constraint-based cooperative layout. In C. North and S. Carpendale, editors, Proceedings of IEEE Information Visualization Conference 2008, pages 1293-1300, 2008.
G. Gange, V. Lagoon, and P.J. Stuckey. Fast set bounds propagation using BDDs. In Proceedings of the European Conference on Artificial Intelligence ECAI08, pages 505-509, 2008.
G. Gange, K. Marriott, and P.J. Stuckey. Smooth linear approximation for non-overlap constraints. In G. Stapleton, J. Howse, and J. Lee, editors, Diagrammatic Representation and Inference, volume 5223 of LNCS, pages 45-59. Springer, 2008.
L. De Koninck, P.J. Stuckey, and G.J. Duck. Optimizing compilation of CHR with rule priorities. In Proceedings of the Ninth International Symposium on Functional and Logic Programming, volume 4989 of LNCS, pages 32-47. Springer, 2008.
S. Huston, J. Puchinger, and P.J. Stuckey. The core concept for 0/1 integer programming. In J. Harland and P. Manyem, editors, Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008)., volume 77 of CRPIT, pages 39-48, 2008.
O. Ohmirenko and P.J. Stuckey. Modelling for lazy clause generation. In J. Harland and P. Manyem, editors, Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008)., volume 77 of CRPIT, pages 27-38, 2008.
J. Puchinger and P.J. Stuckey. Automating branch-and-bound for dynamic programs. In R. Gluck and O. de Moor, editors, Proceedings of the ACM SIGPLAN 2008 Workshop on Partial Evaluation and Program Manipulation (PEPM'08), pages 81-89. ACM, 2008.
S. Brand, G.J. Duck, J. Puchinger, and P.J. Stuckey. Flexible, rule-based constraint model linearisation. In P. Hudak and D.S. Warren, editors, Proceedings of Tenth International Symposium on Practical Aspects of Declarative Languages, number 4902 in LNCS, pages 68-83. Springer-Verlag, 2008.
O. Ohrimenko, P.J. Stuckey, and M. Codish. Propagation = lazy clause generation. In C. Bessiere, editor, Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming, volume 4741 of LNCS, pages 544-558. Springer-Verlag, 2007. (best student paper)
N. Nethercote, P.J. Stuckey, R. Becket, S. Brand, G.J. Duck, and G. Tack. Minizinc: Towards a standard CP modelling language. In C. Bessiere, editor, Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming, volume 4741 of LNCS, pages 529-543. Springer-Verlag, 2007.
S. Brand, N. Narodytska, C-G. Quimper, P.J. Stuckey, and T. Walsh. Encodings of the sequence constraint. In C. Bessiere, editor, Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming, volume 4741 of LNCS, pages 210-224. Springer-Verlag, 2007.
G.J. Duck, P.J. Stuckey, and M. Sulzmann. Observable confluence for constraint handling rules. In Proceedings of 23rd International Conference on Logic Programming, volume 4670 of LNCS, pages 224-239. Springer-Verlag, 2007.
D. Baatar, N. Boland, S. Brand, and P. J. Stuckey. Minimum cardinality matrix decomposition into consecutive-ones matrices: CP and IP approaches. In P. Van Hentenryck and L. Wolsey, editors, Proc. of 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'07), volume 4510 of LNCS, pages 1-15. Springer, 2007.
T. Feydy and P.J. Stuckey. Propagating dense systems of integer linear equations. In Proceedings 22nd Annual ACM Symposium on Applied Computing, pages 306-310. ACM Press, 2007.
K. Francis and P.J. Stuckey. Constraint propagation for loose constraint graphs. In Proceedings 22nd Annual ACM Symposium on Applied Computing, pages 334-335. ACM Press, 2007.
Reza Rafeh, Kim Marriott, Maria Garcia de la Banda, Nicholas Nethercote, Mark Wallace: Adding Search to Zinc. CP 2008: 624-629 (best poster award)
A Novel Approach For Detecting Symmetries In CSP Models C. Mears, M. Garcia de la Banda, M. Wallace, B. Demoen. Proc. CPAIOR 2008, Springer LNCS 5015 , 2008
Hybrid Algorithms in Constraint Programming, Mark Wallace. pp. 1-32 in "Recent Advances in Constraints", Springer LNAI 4651, pp1-32, 2007
From Zinc to Design Model. R. Rafeh, M. Garcia de la Banda, K. Marriott and M. Wallace. Proc. PADL, 215-229, Springer LNCS 4354, 2007
Michael D. Bond, Nicholas Nethercote, Stephen W. Kent, Samuel Z. Guyer and Kathryn S. McKinley. Tracking Bad Apples: Reporting the Origin of Null and Undefined Value Errors. Proceedings of the ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA 2007), pages 405-422, Montreal, Canada, October 2007.
Nicholas Nethercote and Julian Seward. Valgrind: A Framework for Heavyweight Dynamic Binary Instrumentation. Proceedings of ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation (PLDI 2007), pages 89-100, San Diego, California, USA, June 2007.
Nicholas Nethercote and Julian Seward. How to Shadow Every Byte of Memory Used by a Program. Proceedings of the Third International ACM SIGPLAN/SIGOPS Conference on Virtual Execution Environments (VEE 2007), pages 65-74, San Diego, California, USA, June 2007.
Sandro Pirkwieser, Günther R. Raidl, and Jakob Puchinger. Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem. In C. Cotta and J. van Hemert editors, Evolutionary Computation in Combinatorial Optimization - EvoCOP 2007, volume 4446 of LNCS, pages 176-187. Springer, 2007.
Anbulagan and Grastien, A. Importance de la sémantique dans le codage CNF de contraintes de cardinalité : application au diagnostic de SED (in French), JFPC-2008 (Annual French Conference on Constraint Programming), EMN, Nantes, France, 2008.
Grastien, A., and Anbulagan. Incremental Diagnosis of DES by Satisfiability. In Proc. of ECAI-2008. Patras, Grece, 2008.
Anbulagan, and Botea, A., Crossword Puzzles as a Constraint Problem. In Proc. of CP-2008. Sydney, Australia, 2008.
Leenen, L., Anbulagan, Meyer, T., Ghose, A. Modeling and Solving Semiring Constraint Satisfaction Problems by Transformation to Weighted Semiring Max-SAT. LNCS 4830, Proc. of 20th Australian Joint Conference on AI, December 2007, Gold Coast, QLD, Australia, p. 202-212.
The Many Roads Leading to Rome: Solving Zinc Models by Various Solvers. Ralph Becket, Sebastian Brand, Mark Brown, Gregory J. Duck, Thibaut Feydy, Julien Fischer, Jinbo Huang, Kim Marriott, Nicholas Nethercote, Jakob Puchinger, Reza Rafeh, Peter J. Stuckey, and Mark G. Wallace. Seventh International Workshop on Constraint Modelling and Reformulation (ModRef-08).
Universal Booleanization of Constraint Models. Jinbo Huang. Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming (CP-08), pages 144-158.
A Scalable Jointree Algorithm for Diagnosability. Anika Schumann and Jinbo Huang. Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI-08), pages 535-540.
Probabilistic Sequential Diagnosis by Compilation. Sajjad Siddiqi and Jinbo Huang. Tenth International Symposium on Artificial Intelligence and Mathematics (ISAIM-08).
A Case for Simple SAT Solvers. Jinbo Huang. Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP-07), pages 839-846.
The Effect of Restarts on the Efficiency of Clause Learning. Jinbo Huang. Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07), pages 2318-2323.
Uncertainty in preference elicitation and aggregation. Toby Walsh. Proceedings of AAAI-2007, 2007.
Distance Constraints in Constraint Satisfaction. Emmanuel Hebrard, Barry O'Sullivan and Toby Walsh. Proceedings of IJCAI-2007, 2007.
Winner Determination in Sequential Majority Voting. Jerome Lang, Maria Pini, Francesca Rossi, Kristen Venable and Toby Walsh. Proceedings of IJCAI-2007, 2007.
Constraint and Variable Ordering Heuristics for Compiling Configuration Problems. Nina Narodytska and Toby Walsh. Proceedings of IJCAI-2007, 2007.
Incompleteness and Incomparability in Preference Aggregation. Maria Pini, Francesca Rossi, Kristen Venable and Toby Walsh. Proceedings of IJCAI-2007, 2007.
Symmetry Breaking. Toby Walsh. Proceedings of AI'06, 2006.
Reformulating global constraints: the Slide and Regular constraints". Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan and Toby Walsh. The Seventh Symposium on Abstraction, Reformulation and Abstraction (SARA2007).
Breaking Symmetry of Interchangeable Variables and Values. Toby Walsh. Joint Annual Workshop of ERCIM/CoLogNet on Constraint Solving and Constraint Logic Programming, 2007.
Distance Constraints in Constraint Satisfaction Emmanuel Hebrard, Barry O'Sullivan and Toby Walsh. Proceedings of IJCAI-2007, 2007.
Constraint and Variable Ordering Heuristics for Compiling Configuration Problems. Nina Narodytska and Toby Walsh. Proceedings of IJCAI-2007, 2007.
Incompleteness and Incomparability in Preference Aggregation. Maria Pini, Francesca Rossi, Kristen Venable and Toby Walsh. Proceedings of IJCAI-2007, 2007.
The ROOTS Constraint Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan and Toby Walsh. Proceedings of CP-2006, LNCS 4204, 75-90, 2006.
Global Grammar Constraints. Claude-Guy Quimper and Toby Walsh. Proceedings of CP-2006, LNCS 4204, 751-755, 2006. (Best poster award).
General Symmetry Breaking Constraints. Toby Walsh. Proceedings of CP-2006, LNCS 4204, 650-664, 2006.
Inverse Consistencies for Non-binary Constraints. Kostas Stergiou and Toby Walsh. Proceedings of ECAI-2006, 153-157, 2006.
Symmetry Breaking using Value Precedence Toby Walsh. Proceedings of ECAI-2006, 168-172, 2006.
Sven Koenig and Richard Borie and Vangelis Markakis and Philip Kilby and Craig Tovey and Keskinocak Pinar. Agent Coordination with Regret Clearing. In, Twenty-Third AAAI Conference on Artificial Intelligence, pages 101-107, AAAI Press. 2008.
John Slaney. Constraint Modelling: A Challenge for First Order Automated Reasoning (extended abstract). Proceedings of the Workshop on Practical Applications of Automated Reasoning (PAAR). 11-21, 2008.
Estimating Search Tree Size Philip Kilby, John Slaney, Sylvie Thiebaux and Toby Walsh. Proceedings of AAAI-2006, 1014-1019, 2006.
The Range Constraint: Algorithms and Implementation Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan and Toby Walsh. Proceedings of CPAIOR-2006, LNCS 3990, 59-73, 2006.
The All Different and Global Cardinality Constraints on Set, Multiset and Tuple Variables Claude-Guy Quimper and Toby Walsh. Recent Advances in Constraints: Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, 1-13, LNCS 3978, 2006.
Among, Common and Disjoint Constraints Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan and Toby Walsh. Recent Advances in Constraints: Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, 29-43, LNCS 3978, 2006.
Beyond Finite Domains: the All Different and Global Cardinality Constraints. Claude-Guy Quimper and Toby Walsh. Proceedings of CP-2005, 812-816, LNCS 3709, 2005.
M. Maher & G. Huang, On Computing Constraint Abduction Answers, Proc. International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR), LNCS 5330, Springer, 421-435, 2008.
M. Maher, Heyting Domains for Constraint Abduction, Proc. Australian Joint Conference on Artificial Intelligence, LNAI 4304, Springer, 9-18, 2006.
M. Maher, Abduction of Linear Arithmetic Constraints, Proc. International Conference on Logic Programming, LNCS 3668, Springer, 174-188, 2005.
Michael J. Maher: Herbrand Constraint Abduction, in Proceeding of 20th IEEE Symposium on Logic in Computer Science, pages 397-406, IEEE Computer Society, 2006.
M.J. Garcia de la Banda, K. Marriott, Reza Rafeh, Mark Wallace: The Modelling Language Zinc. Proceedings of CP 2006. 700-705. Springer-Verlag.
C. W. Choi, Warwick Harvey, J. H. M. Lee, Peter J. Stuckey: Finite Domain Bounds Consistency Revisited. Australian Conference on Artificial Intelligence 2006: 49-58
P.J. Stuckey, M. Garcia de la Banda, M. Maher, K. Marriott, J. Slaney, Z. Somogyi, M. Wallace, and T. Walsh. The G12 project: Mapping solver independent models to efficient solutions. In P. Van Beek, editor, Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming, number 3709 in LNCS, pages 13-16. Springer-Verlag, 2005.
P.J. Stuckey, M. Garcia de la Banda, M. Maher, K. Marriott, J. Slaney, Z. Somogyi, M. Wallace, and T. Walsh. The G12 project: Mapping solver independent models to efficient solutions. In M. Gabrielli and G. Gupta, editors, Proceedings of the 21st International Conference on Logic Programming, number 3668 in LNCS, pages 9-13. Springer-Verlag, 2005.
G. Duck, P.J. Stuckey, and S. Brand. ACD term rewriting. In S. Etalle and M. Truszczynski, editors, Proceedings of the International Conference on Logic Programming, number 4079 in LNCS, pages 117-131. Springer-Verlag, August 2006.
S. Brand and R.H.C. Yap. Towards "Propagation = Logic + Control". In S. Etalle and M. Truszczynski, editors, Proceedings of the International Conference on Logic Programming, number 4079 in LNCS, pages 102-116. Springer-Verlag, August 2006.
K.R. Apt and S. Brand. Infinite Qualitative Simulations by Means of Constraint Programming. Proceedings of CP 2006, pages 29-43. Springer0-Verlag, September 2006.
R. Muhammed and P.J. Stuckey. A stochastic non-CNF SAT solver. In Q. Yang and G. Webb, editors, 9th Biennial Pacific Rim International Conference on Artificial Intelligence (PRICAI 2006), number 4099 in LNCS, pages 120-129. Springer-Verlag, 2006. (best student paper)
M. Codish, V. Lagoon, and P.J. Stuckey. Solving partial order constraints for LPO termination. In F. Pfenning, editor, Proceedings of International Conference on Rewriting Techniques and Applications, number 4098 in LNCS, pages 4-8. Springer-Verlag, August 2006.
M. Codish, V. Lagoon, and P.J. Stuckey. Size-change termination analysis in k-bits. In P. Sestoft, editor, Proceedings of European Symposium on Programming, number 3924 in LNCS, pages 230-245. Springer-Verlag, 2006.
P. Hawkins and P.J. Stuckey. A hybrid BDD and SAT finite domain constraint solver. In P. Van Hentenryck, editor, Proceedings of the Practical Applications of Declarative Programming, LNCS, pages 103-117. Springer-Verlag, 2006.
R. Becket, M. Garcia de la Banda, K. Marriott, Z. Somogyi, P.J. Stuckey, and M. Wallace. Adding constraint solving to Mercury. In P. Van Hentenryck, editor, Proceedings of the Practical Applications of Declarative Programming, LNCS, pages 118-133. Springer-Verlag, 2006.
R. Marshall, S. Bird, and P.J. Stuckey. Structuring documents efficiently. In T. Baldwin, J. Curran, and M. van Zaanen, editors, Proceedings of the Australasian Language Technology Workshop 2005, pages 120-128, Sydney, Australia, December 2005. http://www.alta.asn.au/events/altw2005.
M. Codish, V. Lagoon, and P.J. Stuckey. Testing for termination with monotonicity constraints. In M. Gabrielli and G. Gupta, editors, Proceedings of the International Conference on Logic Programming, number 3668 in LNCS, pages 326-340. Springer- Verlag, 2005.
T. Schrijvers, P.J. Stuckey, and G.J. Duck. Abstract interpretation for constraint handling rules. In Amy Felty, editor, PPDP'05: Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, pages 218-229, Lisbon, Portugal, July 2005. ACM.
Somogyi Z., Sagonas K., Tabling in Mercury: design and implementation, Proceedings of the Eighth International Symposium on Practical Aspects of Declarative Languages, Charleston, USA, January 2006, pp. 150-167.
Duc Nghia Pham, John Thornton, Abdul Sattar: Efficiently Exploiting Dependencies in Local Search for SAT. AAAI 2008: 1476-1478
Nathan Robinson, Charles Gretton, Duc Nghia Pham, Abdul Sattar: A Compact and Efficient SAT Encoding for Planning. ICAPS 2008: 296-303
John Thornton, Duc Nghia Pham: Using Cost Distributions to Guide Weight Decay in Local Search for SAT. PRICAI 2008: 405-416
Anbulagan, D. N. Pham, J. Slaney, and A. Sattar. Old resolution meets modern sls. In AAAI-05, pages 354-359, 2005.
Anbulagan and J. Slaney. Lookahead saturation with restriction for SAT. In P. van Beek, editor, CP-05, pages 727-731. Springer-Verlag, 2005. LNCS 3709.
Anbulagan and J. Slaney. Multiple preprocessing for systematic sat solvers. In Proceedings of IWIL-6, 2006. Workshop in conjunction with LPAR-2006.
P. Baumgartner, A. Fuchs, and C. Tinelli. Computing finite models by reduction to function-free clause logic. In Proceedings of DISPROVING-06 workshop, pages 83-95, 2006.
P. Baumgartner, A. Fuchs, and C. Tinelli. Lemma learning in the model evolution calculus. In Proceedings of LPAR-06, pages 572-586, 2006.
P. Baumgartner and R. Schmidt. Blocking and other enhancements for bottom-up model generation methods. In International Joint Conference on Automated Reasoning (IJCAR), pages 125-139, 2006.
J. Huang. Combining knowledge compilation and search for conformant probabilistic planning. In Proceedings of ICAPS-06, pages 253-262, 2006.
J. Huang, M. Chavira, and A. Darwiche. Solving map exactly by searching on compiled arithmetic circuits. In Proceedings of AAAI-06, pages 143-148, 2006.
A. Ishtaiwi, J. Thornton, Anbulagan, A. Sattar, and D. N. Pham. Adaptive clause weight redistribution. In CP-06, pages 229-243, 2006.
Anbulagan, D. N. Pham, J. Slaney, and A. Sattar. Boosting sls performance by incorporating resolution-based preprocessor. In Proceedings of the Third International Workshop on Local Search Techniques in Constraint Satisfaction (LSCS), 2006.
Alban Grastien, Anbulagan, Jussi Rintanen and Elena Kelareva, Diagnosis of Discrete-Event Systems Using Satisfiability Algorithms. AAAI-2007, Vancouver, BC, Canada
Alban Grastien, Anbulagan, Jussi Rintanen and Elena Kelareva, Modeling and Solving Diagnosis of Discrete-Event Systems via Satisfiability. In Proc. of the 18th International Workshop on Principles of Diagnosis (DX-2007), Nashville, TN, USA
Alban Grastien and Anbulagan. Resolution d'un probleme de diagnostic de systemes a evenements discrets par SAT (in French). Troisiemes Journees Francophones de Programmation par Contraintes (JFPC-2007). The 3rd Annual French Conference on Constraint Programming, INRIA, Rocquencourt, Yvelines France.
Peter Baumgartner, Alexander Fuchs, and Cesare Tinelli. Lemma Learning in the Model Evolution Calculus. In Miki Hermann and Andrei Voronkov, editors, Logic for Programming, Artificial Intelligence and Reasoning (LPAR), volume 4246 of LNAI, pages 572--586. Springer, 2006.
Peter Baumgartner and Renate Schmidt. Blocking and Other Enhancements for Bottom-Up Model Generation Methods. In U. Furbach and N. Shankar, editors, Automated Reasoning -- Third International Joint Conference on Automated Reasoning (IJCAR), volume 4130 of LNAI. Springer, 2006.