Peter J. Stuckey's Publication List

Books Authored

• K. Marriott and P.J. Stuckey. Programming with Constraints: an Introduction. MIT Press, 1998.

Books Edited

• Peter J. Stuckey, editor. Proceedings of the Fourteenth International Conference on Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 5202. Springer-Verlag, 2008.
• Peter J. Stuckey and Yukiyoshi Kameyama, editors. Proceedings of the Seventh International Symposium on Functional and Logic Programming. Lecture Notes in Computer Science 2998 Springer-Verlag, 2004.
• Peter J. Stuckey, editor Proceedings of the Eighteenth International Conference on Logic Programming Lecture Notes in Computer Science 2401, Springer-Verlag, 2002.
• John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luis Moniz Pereira, Yehoshua Sagiv, and Peter J. Stuckey, editors. Proceedings of the First International Conference on Computational Logic. Lecture Notes in Artificial Intelligence. Springer-Verlag, 2000.
• R. Ramakrishnan and P.J. Stuckey. Constraints and Databases. Kluwer Academic Publishers, Boston, 1997.

Book Chapters

• Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, and Mark G. Wallace. Handbook of Project Management and Scheduling, volume 1, chapter A Satisfiability Solving Approach, pages 135-160. Springer, 2015.
• Hanyu Gu, Andreas Schutt, Peter J. Stuckey, Mark G. Wallace, and Geoffrey Chu. Handbook of Project Management and Scheduling, volume 1, chapter Exact and Heuristic Methods for the Resource-Constrained Net Present Value Problem, pages 299-318. Springer, 2015.
• K. Marriott, P.J. Stuckey, and M. Wallace. In F. Ross, P. van Beek, and T. Walsh, editors, Handbook of Constraint Programming, chapter 12: Constraint Logic Programming, pages 409-452. Elsevier, 2006.
• B. Demoen, M. Garcia de la Banda, W. Harvey, K. Marriot, D. Overton, and P.J. Stuckey. Herbrand constraints in HAL. In K-K. Lau and M. Bruynooghe, editors, Program Development in Computational Logic, Lecture Notes in Computer Science 3049, pages 501--540. Springer-Verlag, 2004.
• J. Correas, M. Hermegildo, G. Puebla, M. Garcia de la Banda, K. Marriot, and P.J. Stuckey. A generic framework for context-sensitive analysis of modular programs. In K-K. Lau and M. Bruynooghe, editors, Program Development in Computational Logic, Lecture Notes in Computer Science 3049, pages 234--261. Springer-Verlag, 2004.
• M.J. Maher and P.J. Stuckey. On inductive inference of cyclic structures. In M. C. Golumbic and F. Hoffman, editors, Annals of Mathematics and Artifical Intelligence, volume 15, pages 167--20. 1995.
• J. Jaffar, S. Michaylov, P.J. Stuckey, and R.H.C. Yap. Constraint programming languages. In 1993 Yearbook of Science and Technology, pages 343--346. McGraw Hill, 1993.

Journal Publications

2018

2017

• Stefan Kreter, Andreas Schutt, and Peter J. Stuckey. Using constraint programming for solving RCPSP/max-cal. Constraints, 22(3):432-462, 2017.
• Michelle Blom, Adrian R. Pearce, and Peter J. Stuckey. Short-term scheduling of an open-pit mine with multiple objectives. Engineering Optimization, 49(5):777-795, 2017.
• James H. Collier, Lloyd Allison, Arthur M. Lesk, Peter J. Stuckey, Maria Garcia de la Banda1, and Arun S. Konagurthu. Statistical inference of protein structural alignments using information and compression. Bioinformatics, 33(1):1005-1013, 2017.

  2016

• Michelle Blom, Adrian Pearce, and Peter J. Stuckey. A decomposition-based algorithm for the scheduling of open-pit networks over multiple time periods. Management Science, 62(10):3059-3084, 2016. [PDF] [DOI]
• Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Sondergaard, and Peter J. Stuckey. A complete refinement procedure for regular separability of context-free languages. Theoretical Computer Science, 625:1-24, 2016. [PDF] [DOI]

• 2015

• Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Sondergaard, and Peter J. Stuckey. Horn clauses as an intermediate representation for program analysis and transformation. Theory and Practice of Logic Programming, 15(4-5):526-524, 2015. Proceedings of the 31st International Conference on Logic Programming. [PDF]
• Mihai Bilauca, Graeme Gange, Patrick Healy, Kim Marriott, Peter Moulder, and Peter J. Stuckey. Automatic minimal-height table layout. INFORMS Journal of Computing, 27(3):449-461, 2015. [PDF]
• Geoffrey Chu and Peter J. Stuckey. Dominance breaking constraints. Constraints, 20(2):155-182, 2015. [PDF] [DOI]
• Broes De Cat, Marc Denecker, Peter J. Stuckey and Maurice Bruynooghe. Lazy model expansion: Interleaving grounding with search. Journal of Artificial Intelligence Research, 52:235-286, 2015. [PDF] [JAIR]
• Graeme Gange, Jorge A. Navas, Peter Schacte, Harald Sondergaard, and Peter J. Stuckey. Interval Analysis and Machine Arithmetic: Why Signedness Ignorance is Bliss. ACM Transactions on Programming Languages and Systems, 37(1):article 1, 2015. [PDF] [DOI]
• Rafael Caballero, Peter J. Stuckey, Antonio Tenorio-Fornes: Two type extensions for the constraint modeling language MiniZinc. Sci. Comput. Program. 111: 156-189 (2015) [DOI]

  2014

• Graeme Gange, Harald Sondergaard, and Peter J. Stuckey. Synthesizing optimal switching lattices. ACM Transactions on Design Automation of Electronic Systems, 20(1):article 6, 2014. [PDF] [DOI]
• Peter J. Stuckey, Thibaut Feydy, Andreas Schutt, Guido Tack, and Julien Fischer. The MiniZinc challenge 2008-2013. AI Magazine, 35(2):55-60, 2014.
• Arun Konagurthu, Lloyd Allison, David Abramson, Peter J. Stuckey, and Arthur Lesk. How precise are reported protein coordinate data? Acta Crystallographica Section D, 70:904-906, 2014.
• Michelle L. Blom, Christina N. Burt, Adrian R. Pearce, and Peter J. Stuckey. A decomposition-based heuristic for collaborative scheduling in a network of open pit mines. INFORMS Journal of Computing, 26(4):658-676, 2014. [PDF]
• Maria Garcia de la Banda, Peter J. Stuckey, Pascal Van Hentenryck, and Mark Wallace. The future of optimization technology. Constraints, 19(2):126-138, 2014. [PDF] [DOI]
• Geoffrey Chu, Maria Garcia de la Banda, Christopher Mears, and Peter J. Stuckey. Symmetries, almost symmetries, and lazy clause generation. Constraints, 19(4):434-462, 2014. [PDF] [DOI]
• Kathryn Francis and Peter J. Stuckey. Explaining Circuit Propagation. Constraints 19(1):1-29, 2014. [PDF] [DOI]

  2013

• Elvira Albert, Maria Garcia de la Banda, Miguel Gomez-Zamalloa, Jose Miguel Rojas, and Peter J. Stuckey. A CLP heap solver for test case generation. Theory and Practice of Logic Programming 13(4-5):721-735, 2013. In Proceedings of the 29th International Conference on Logic Programming. [PDF]
• Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Sondergaard, and Peter J. Stuckey. Failure tabled constraint logic programming by interpolation. Theory and Practice of Logic Programming 13(4-5):593-607, 2013. In Proceedings of the 29th International Conference on Logic Programming. [PDF] TPLP
• Rehan Abdul Aziz, Geoffrey Chu, and Peter J. Stuckey. Stable model semantics for founded bounds. Theory and Practice of Logic Programming 13(4-5):517-532, 2013. In Proceedings of the 29th International Conference on Logic Programming. [PDF] TPLP
• A. Schutt, T. Feydy, P.J. Stuckey, and M. Wallace. Solving RCPSP/max by lazy clause generation. Journal of Scheduling, 16(3):273-289, 2013. [PDF] [DOI]
• T. Schrijvers, G. Tack, P. Wuille, H. Samulowitz, and P.J. Stuckey. Search combinators. Constraints, 18(2):269--305, 2013. [PDF] [DOI]
• Amit Metodi, Michael Codish, and Peter J. Stuckey. Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems. Journal of Artificial Intelligence Research, 46:303-341, 2013. JAIR
• Raj Gaire, Lorey Smith, Patrick Humbert, James Bailey, Peter J. Stuckey, and Izhak Haviv. Discovery and analysis of consistent active sub-networks in cancers. BMC Bioinformatics, 14(2):S7, 2013.

  2012

• A. Stivala, P.J. Stuckey, T. Wirth, and J. Whisstock. Automatic generation of protein structure cartoons with pro-origami. Bioinformatics, pages 3315-3316, 2011. [DOI] [PDF]
• G. Chu and P.J. Stuckey. A complete solution to the maximum density still life problem. Artificial Intelligence, 184-185:1-16, 2012. [DOI] [PDF]
• Geoffrey Chu, Maria Garcia de la Banda, Peter J. Stuckey: Exploiting subproblem dominance in constraint programming. Constraints 17(1): 1-38 (2012) [DOI] [PDF]

  2011

• D. Baatar, N. Boland, S. Brand, and P. J. Stuckey. CP and IP approaches to cancer radiotherary delivery optimization. Constraints, 16(2):173-194, 2011. [DOI] [PDF]
• M. Garcia de la Banda, P.J. Stuckey, and G. Chu. Solving talent scheduling with dynamic programming. INFORMS Journal of Computing, 23(1):120-137, 2011. [PDF] [DOI]
• G. Gange, P.J. Stuckey, and R. Szymanek. MDD propagators with explanation. Constraints, 16(4):407-429, 2011. [DOI] [PDF]
• A. Konagurthu, L. Allison, P.J. Stuckey, and A. Lesk. Piecewise linear approximation of protein structures using the principle of minimum message length. Bioinformatics, 27(13):i43-i51, 2011. [DOI]
• A. Schutt, T. Feydy, P.J. Stuckey, and M. Wallace. Explaining the cumulative propagator. Constraints, 16(3):173-194, 2011. [DOI] [PDF]
• J. Puchinger, P.J. Stuckey, M. Wallace, and S. Brand. Dantzig-wolfe decomposition and branch-and-price solving in G12. Constraints, 16(1):77-99, 2011 [DOI] [PDF]

  2010

• A. Schutt and P.J. Stuckey. Incremental satisfiability and implication for UTVPI constraints. INFORMS Journal of Computing, 22(4):514-527, 2010 [DOI] [PDF]
• A. Stivala, P. J. Stuckey, and A. Wirth. Fast and accurate protein substructure searching with simulated annealing and GPUs. BMC Bioinformatics, 11:446, 2010. [BioMed]
• G. Gange, P.J. Stuckey, and V. Lagoon. Fast set bounds propagation using a BDD-SAT hybrid. Journal of Artificial Intelligence Research, 38:307-338, 2010. [JAIR] [PDF]
• A. Stivala, P.J. Stuckey, M. Garcia de la Banda, M. Hermenegildo, and A. Wirth. Lock-free parallel dynamic programming. Journal of Parallel and Distributed Computing, 70:839-848, 2010. [DOI] [PDF]
• P.J. Stuckey, R. Becket, and J. Fischer. Philosophy of the MiniZinc challenge. Constraints, 15(3):307-316, 2010. [DOI] [PDF]
• A. Konagurthu, C. Reboul, J. Schmidberger, J. Irving, A. Lesk, P.J. Stuckey, J. Whisstock, and A. Buckle. Mustang-mr structural sieving server: Applications in protein structural analysis and crystallography. Public Library of Science One, 2010. PLoS ONE.
• 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):161-167, 2010. [DOI]

  2009

• T. Schrijvers, P.J. Stuckey, and P. Wadler. Monadic constraint programming. Journal of Functional Programming, 16(9):663-697, 2009. [PDF] Journal of Functional Programming Copyright Cambridge University Press
• O. Ohrimenko, P.J. Stuckey, and M. Codish. Propagation via lazy clause generation. Constraints, 14(3):357-391, 2009. [PDF] [DOI] 2010 University of Melbourne Woodward Medal for Science and Technology
• A. Stivala, A. Wirth, and P.J. Stuckey. Tableau-based protein substructure search using quadratic programming. BMC Bioinformatics, 10:153, 2009. [DOI]
• T. Feydy and P.J. Stuckey. Propagating systems of dense linear integer constraints. Constraints, 14(2):235-253, 2009. [PDF] [DOI]
• G. Chu, A. Harwood, and P.J. Stuckey. Cache Conscience Data Structures for Boolean Satisfiability Solvers. Journal on Satisfiability, Boolean Modeling and Computation, 6:99-120, 2009. [PDF] JSAT

  2008

• C. Schulte and P.J. Stuckey. Efficient constraint propagation engines. ACM Transactions on Programming Languages and Systems 31(1):Article 2. 2008. [PDF] [ACM] ACM TOPLAS page
• 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. [PDF] [DOI]
• M. Codish, V. Lagoon, and P.J. Stuckey. Solving Partial Order Constraints for LPO Termination. Journal on Satisfiability, Boolean Modeling and Computation, 5:193-215, 2008. [PDF]. JSAT
• 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. [PDF]
• 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. [PDF] [ACM] [DOI]
• M. Sulzmann and P.J. Stuckey. HM(X) type inference is CLP(X) solving. Journal of Functional Programming, 18(2):251-283, 2008 [PDF]
• M. Codish, V. Lagoon, and P.J. Stuckey. Logic programming with satisfiability. Theory and Practice of Logic Programming, 8(1):121-128, 2008 [PDF]
• 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. [DOI]

  2007

• 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. [PDF] JOH
• M. Garcia de la Banda and P.J. Stuckey. Using Dynamic Programming to Minimize the Maximum Number of Open Stacks. INFORMS Journal of Computing 19(4):607-617 [PDF]
• 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 ACM TOCL [Postscript] [PDF] [ACM]
• M. Sulzmann, G.J. Duck, S. Peyton-Jones, and P.J. Stuckey. Understanding functional dependencies via constraint handling rules. Journal of Functional Programming, 17(1):83-129, 2007 [PDF]

  2006

• Tom Schrijvers, Maria Garcia de la Banda, Bart Demoen, and Peter J. Stuckey. Improving PARMA trailing. Theory and Practice of Logic Programming, 6(6):609-644, 2006. CORR entry
• 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. Proteins [PDF]
• 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 [PDF]
• 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. ENTCS.

  2005

• P. J. Stuckey and M. Sulzmann. A theory of overloading. ACM Transactions on Programming Languages and Systems, 27(6):1216-1269, 2005 ACM TOPLAS page [PDF] [ACM]
• B. Demoen, M. Garcia de la Banda, W. Harvey, K. Marriott, and P.J. Stuckey. Checking modes in HAL programs. Theory and Practice of Logic Programming, 5(6):623-668, 2005. CORR entry
• K. Marriott and P.J. Stuckey. NP-completenes of minimal width unordered tree layout. Journal of Graph Algorithms and Applications, 8(3):295-312, 2005. JGAA
• 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. ACM TOPLAS page [Postscript] [ACM]
• 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\&5):503-532, 2005. CORR entry
• P.J. Hawkins, V. Lagoon, and P.J. Stuckey, Solving Set Constraint Satisfaction Problems using ROBDDs, Journal of Artificial Intelligence Research Volume 24, pages 109-156, 2005 JAIR [PDF]

  2004

• A. Konagurthu, J. Whisstock, and P.J. Stuckey. Progressive multiple alignment using sequence triplet optimizations and three-residue exchange costs. Journal of Bioinformatics and Computational Biology, 2(4): 719--745, 2004.

  2003

• S. Barker and P.J. Stuckey. Flexible access control policy specification with constraint logic programming. ACM Transations on Information and System Security, 6(4):501--546, 2003. ACM TISSEC page [Postscript] [ACM]
• K. Marriott and P.J. Stuckey and V. Tam and W. He. Removing Node Overlapping in Graph Layout using Constrained Optimization. Constraints,8(2):143--172, 2003. [Postscript]
• W. Harvey and P.J. Stuckey. Improving linear constraint propagation by changing constraint representation. Constraints, 8(2):173--207, 2003. [Postscript]

  2002

• B. Davey, N. Boland, and P.J. Stuckey. Efficient intelligent backtracking using linear programming. INFORMS Journal of Computing, 14(4):373--386, 2002
• T. Hansen, K. Marriott, B. Meyer, and P.J. Stuckey. Flexible graph layout for the web. Journal of Visual Languages and Computing, 13(1):35--60, 2002. [Postscript]
• W. Harvey, P.J. Stuckey, and A. Borning. Fourier elimination for compiling constraint heirarchies. Constraints, 7:199-212, 2002. [Postscript]

  2001

• G. Badros, A. Borning, and P.J. Stuckey. The Cassowary linear arithmetic constraint solving algorithm. ACM Transactions on Computer Human Interaction, 8(4):267--306, 2001 [PDF] [ACM]

  2000

• K.M.F. Choi, J.H.M. Lee, and P.J. Stuckey. A Lagrangian reconstruction of GENET. Artificial Intelligence, 123:1--39, 2000. [PDF]
• M. Hermenegildo, G. Puebla, K. Marriott, and P.J. Stuckey. Incremental analysis of constraint logic programs. ACM Transactions on Programming Languages and Systems, 22(2):187--223, 2000. [Postscript] ACM page [ACM]

  1999

• M. Codish, H. Sondergaard, and P.J. Stuckey. Sharing and groundness dependencies in logic programs. ACM Transactions on Programming Languages and Systems, 21(5):948--976, 1999. ACM page [Postscript] [ACM]
• V. Tam and P.J. Stuckey. Improving evolutionary algorithms for efficient constraint satisfaction. The International Journal on Artificial Intelligence Tools, 8(2), 1999. [Postscript]

  1998

• A. Kelly, A. Macdonald, K. Marriott, H. Sondergaard, and P.J. Stuckey. Optimizing compilation for CLP(R). ACM Transactions on Programming Languages and Systems, 20(6):1223--1250, 1998. [Postscript] [ACM]
• J. Jaffar, M. Maher, K. Marriott, and P.J. Stuckey. The semantics of constraint logic programs. Journal of Logic Programming, 37(1--3):1--46, 1998. [Postscript]
• A. Kelly, K. Marriott, H. Sondergaard, and P.J. Stuckey. A practical object-oriented analysis engine for CLP. Software: Practice and Experience, 28(2):199--224, 1998.
• P.J. Stuckey and V. Tam. Extending GENET with lazy arc consistency. IEEE Transactions on Systems, Man and Cybernetics, 28(5):698--702, 1998. [Postscript]
• M. Garcia de la Banda, K. Marriott, H. Sondergaard, and P.J. Stuckey. Differential methods in logic program analysis. Journal of Logic Programming, 35(1):1--37, 1998. [Postscript]
• D.B. Kemp, K. Ramamohanarao, and P.J. Stuckey. An efficient evaluation technique for non-stratified programs by transformation to explicitly locally stratified programs. Journal of Systems Integration, 7:191--230, 1998.
• K.A. Ross, D. Srivastava, P.J. Stuckey, and S. Sudarshan. Foundations of aggregation constraints. Theoretical Computer Science, 193(1--2):149--179, 1998.
• P.J. Stuckey and V. Tam. Semantics for using stochastic constraint solvers in constraint logic programming. Journal of Functional and Logic Programming, 1998(2), January 1998. [PDF]
• A. K. Bansal, P. Bork, and P.J. Stuckey. Automated pairwise comparisons of microbial genomes. Mathematical Modelling and Scientific Computing, 9(1):1--23, 1998. [PDF]

  1997

• N.C. Heintze, S. Michaylov, P.J. Stuckey, and R.H.C. Yap. Meta-programming in CLP(R). Journal of Logic Programming, 33(3):221--259, 1997. [PDF]
• P.J. Stuckey and S. Sudarshan. Well founded ordered search: Goal-directed bottom-up evaluation of well-founded models. Journal of Logic Programming, 32(3):171--205, 1997.

  1996

• D.B. Kemp and P.J. Stuckey. Optimizing bottom-up evaluation of constraint queries. Journal of Logic Programming, 26(1):1--30, 1996.
• D.B. Kemp, D. Srivastava, and P.J. Stuckey. Bottom-up evaluation and query optimization of well-founded models. Theoretical Computer Science, 146(1--2):145--184, 1995.

  1995

• P.J. Stuckey. Negation and constraint logic programming. Information and Computation, 118(1):12--33, 1995. Postscript TR

  1993

• K. Marriott and P.J. Stuckey. Semantics of constraint logic programs with optimization. ACM Letters on Programming Languages and Systems, 2(1--4):197--212, 1993. ACM page [PDF] [ACM]
• J. Jaffar, M. Maher, P.J. Stuckey, and R.H.C. Yap. Projecting CLP(R) constraints. New Generation Computing, 11:449--469, 1993. [PDF]

  1992

• J. Jaffar, S. Michaylov, P.J. Stuckey, and R.H.C. Yap. The CLP(R) language and system. ACM Transactions on Programming Languages and Systems, 14(3):339--395, 1992. [ACM]
• K. Kanchanasut and P.J. Stuckey. Transforming normal logic programs to constraint logic programs. Theoretical Computer Science, 105:27--56, 1992.
• N.C. Heintze, S. Michaylov, and P.J. Stuckey. CLP(R) and some electrical engineering problems. Journal of Automated Reasoning, 9:231--260, 1992. PDF

  1991

• J. Vaghani, K. Ramamohanarao, D.B. Kemp, Z. Somogyi, and P.J. Stuckey. An introduction to the Aditi deductive database system. Australian Computer Journal, 23(2):37--52, 1991.
• P.J. Stuckey. Incremental linear constraint solving and detection of implicit equalities. ORSA Journal of Computing, 3(4):269--274, 1991.

  1989

• J.N. Crossley, P. Lim, and P.J. Stuckey. Interface logic programming. Australian Computer Journal, 21(2):49--55, 1989.

  1986

• J. Jaffar and P.J. Stuckey. Canonical logic programs. Journal of Logic Programming, 3(2):143--155, 1986.
• J. Jaffar and P.J. Stuckey. Semantics of infinite tree logic programming. Theoretical Computer Science, 42(4):141--158, 1986.

Invited Conference Publications

• Peter J. Stuckey. Those who cannot remember the past are condemned to repeat it. In C. Schulte, editor, Proceedings of the 19th International Conference on Principles and Practice of Constraint Programming, volume 8124 of LNCS, pages 5-6. Springer, 2013. LNCS
• Peter J. Stuckey. There are no CNF problems. In M. Jarviselo and A. Van Gelder, editors, Proceedings of the 16th International Conference on Theory and Applications of Satisfiability Testing, number 7962 in LNCS, pages 19-21. Springer, 2013. LNCS
• P.J. Stuckey. Lazy clause generation: Combining the power of SAT and CP (and MIP?) solving. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, volume 6140 of LNCS, pages 5-9. Springer, 2010. LNCS 3709 [PDF]
• P.J. Stuckey, M. Sulzmann, and J. Wazny. Type processing by constraint reasoning. In N. Kobayashi, editor, Proceedings of Fourth Asian Programming Languages and Systems Conference (APLAS), number 4279 in LNCS, pages 1-25. Springer, 2006. LNCS [PDF]
• 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, LNCS 3668 pages 9-13. Springer, 2005. [PDF]
• 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, LNCS 3709 pages 13-16. Springer, 2005. [PDF]
• K. Marriott, B. Meyer, and P.J. Stuckey. Towards Flexible Graphical Communication Using Adaptive Diagrams. Proceedings of the 9th Asian Computing Conference. LNCS 3321 380--394. Springer-Verlag. 2004.
• M. Garcia de la Banda, B, Demoen, K. Marriott, and P. J. Stuckey. To the Gates of HAL: A HAL Tutorial Proceedings of the International Symposium on Functional and Logic Programming, LNCS 2441, 47--66, 2002. [Postscript]

Conference Publications

2018

• David Cheng Zarate, Pierre Le Bodic, Tim Dwyer, Graeme Gange, and Peter J. Stuckey. Optimal Sankey diagrams via integer programming. In Proceedings of 11th Pacific Visualization Symposium 2018, page 135-139, 2018. [IEEE]
• Nysret Musliu, Andreas Schutt, and Peter J. Stuckey. Solver independent rotating workforce scheduling. In Willen-Jan van Hoeve, editor, Fifteenth International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming (CPAIOR2018), volume 10848 of LNCS, pages 429-445. Springer, 2018.
• Emir Demirovic and Peter Stuckey. Constraint programming for high school timetabling: A scheduling-based model with hot starts. In Willen-Jan van Hoeve, editor, Fifteenth International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming (CPAIOR2018), volume 10848 of LNCS, pages 132-152. Springer, 2018.
• Diego De Una, Natalia Rummele, Graeme Gange, Peter Schachte, and Peter J. Stuckey. Machine learning and constraint programming for relational-to-ontology schema mapping. In Jerome Lang, editor, Proceedings of the 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence, page 1277-1283. AAAI Press, 2018. [PDF]
• Roberto Amadini, Graeme Gange, and Peter J. Stuckey. Propagating lex, find and replace with dashed strings. In Willen-Jan van Hoeve, editor, Fifteenth International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming (CPAIOR2018), volume 10848 of LNCS, pages 18-34. Springer, 2018.
• Michael Codish, Thorsten Ehlers, Graeme Gange, Avi Itzhakov, and Peter J. Stuckey. Breaking symmetries with lex implications. In Proceedings of the 22nd International Symposium on Functional and Logic Languages, number 10818 in LNCS, pages 182-197. Springer.
• Mohadeseh Ganji, Jeffrey Chan, Peter. J. Stuckey, James Bailey, Christopher Leckie, Kotagiri Ramamohanarao, and Ian Davidson. Image constrained blockmodelling: A constraint programming approach. In Proceedings of the SIAM International Conference on Data Mining (SDM18), pages 19-27, 2018.
• Mohadeseh Ganji, James Bailey, and Peter J. Stuckey. Lagrangian constrained community detection. In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence (AAAI-18), pages 2983-2990. AAAI Press, 2018. [PDF]
• Roberto Amadini, Graeme Gange, and Peter J. Stuckey. Sweep-based propagation for string constraint solving. In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence (AAAI-18), pages 6557-6564. AAAI Press, 2018. [PDF]

  2017

• Mohadeseh Ganji, James Bailey, and Peter J. Stuckey. A new declarative framework for constrained community detection. In Chris Beck, editor, Proceedings of the 23rd International Conference on Principles and Practice of Constraint Programming, LNCS 10416, page 477-494. Springer, 2017. [PDF]
• Roberto Amidini, Graeme Gange, Peter J. Stuckey, and Guido Tack. A novel approach to string constraint solving. In Chris Beck, editor, Proceedings of the 23rd International Conference on Principles and Practice of Constraint Programming, LNCS 10416, page 3-20. Springer, 2017. [PDF]
• Graeme Gange, Pierre Ganty, and Peter J. Stuckey. Fixing the state budget: Approximation of regular languages with small DFAs. In Fifteenth International Symposium on Automated Technology for Verification and Analysis, LNCS 10482, page 67-83. Springer, 2017. [PDF]
• Bishoksan Kafle, Graeme Gange, Peter Schachte, Harald Sondergaard, and Peter J. Stuckey. A Benders decomposition approach to deciding modular linear integer arithmetic. In S. Gaspers and T. Walsh, editors, Proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing, LNCS 10491, page 380-400. Springer, 2017. [PDF]
• Elvira Albert, Puri Arenas, Maria Garcia de la Banda, Miguel Gomez-Zamolloa, and Peter J. Stuckey. Context sensitive dynamic partial order reduction. In Proceedings of the Computer Aided Verification, 29th International Conference, LNCS, pages 526-543. Springer, 2017. [PDF]
• Statistical compression of protein folding patterns and inference of recurrent substructural themes. In M.W. Marcellin and J.A. Storer, editors, Proceedings of the IEEE Data Compression Conference 2017, pages 340-349. IEEE Press, 2017.
• Diego de Una and Peter J. Stuckey. Minimizing landscape resistance for habitat conservation. In Fourteenth International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, LNCS 10335, pages 113-130. Springer, 2017. [PDF]
• Nicolas Beldiceanu, Mats Carlsson, Alban Derrien, Charles Prud'Homme, Andreas Schutt, and Peter J. Stuckey. Range-consistent forbidden regions of Allens relations. In Fourteenth International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, LNCS 10335, pages 21-29. Springer, 2017. [PDF]
• Graeme Gange and Peter J. Stuckey. Constraint propagation and explanation over novel types by abstract compilation. In Technical Communications of the 32nd International Conference on Logic Programming, Open Access Series in Informatics, page 13:1 .. 13:14. Dagstuhl Publishing, 2016. [DAGSTUHL].
• Roberto Amadini, Alexander Jordan, Graeme Gange, Francois Gauthier, Peter Schachte, Harald Sondergaard, Peter J. Stuckey, and Chenyi Zhang. Combining string abstract domains for javascript analysis: An evaluation. In Proceedings of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), LNCS, pages 41-57, 2017. [PDF]
• Toby Davies, Graeme Gange, and Peter J. Stuckey. Automatic logic-based benders decomposition with MiniZinc. pages 787-793. AAAI Press. [AAAI].

  2016

• Mohadaseh Ganji, Abbas Seifi, Hosein Alizadeh, James Bailey, and Peter J. Stuckey. Lagrangian constrained clustering. In Proceedings of the SIAM International Conference on Data Mining (SDM16), pages 288-296, 2016. [PDF]
• Michelle Blom, Vanessa Teague, Peter J. Stuckey, and Ron Tidhar. Efficient computation of exact IRV margins. In Maria S. Fox and Gal A. Kaminka, editors, Proceedings of the 22nd European Conference on Artificial Intelligence, pages 480-488, 2016. [PDF]
• Gleb Belov, Peter J. Stuckey, Guido Tack, and Mark Wallace. Improved linearization of constraint programming models. In Michel Rueher, editor, Proceedings of the 22st International Conference on Principles and Practice of Constraint Programming, LNCS 9892, pages 49-65. Springer, 2016. [PDF]
• Thibaut Feydy and Peter J. Stuckey. Interval constraints with learning : Application to air traffic control. In Michel Rueher, editor, Proceedings of the 22st International Conference on Principles and Practice of Constraint Programming, LNCS 9892, pages 224-233. Springer, 2016. [PDF]
• Andreas Schutt and Peter J. Stuckey. Explaining producer/consumer constraints. In Michel Rueher, editor, Proceedings of the 22st International Conference on Principles and Practice of Constraint Programming, LNCS 9892, pages 484-454. Springer, 2016. [PDF]
• Michael Codish, Graeme Gange, Avi Itzhakov, and Peter J. Stuckey. Breaking symmetries in graphs: The nauty way. In Michel Rueher, editor, Proceedings of the 22st International Conference on Principles and Practice of Constraint Programming, LNCS 9892, pages 157-172. Springer, 2016. [PDF]
• Diego de Una, Graeme Gange, Peter Schachte, and Peter J. Stuckey. A bounded path propagator on directed graphs. In Michel Rueher, editor, Proceedings of the 22st International Conference on Principles and Practice of Constraint Programming, LNCS 9892, pages 189-206. Springer, 2016. [PDF]
• Thorsten Ehlers and Peter J. Stuckey. Parallelizing constraint programming with learning. In Claude-Guy Quimper, editor, Thirteenth International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, LNCS 9676, page pages 142-158, 2016. [PDF]
• Wenxi Wang, Harald Sondegaard, and Peter J. Stuckey. A bit-vector solver with word level propagation. In Claude-Guy Quimper, editor, Thirteenth International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, LNCS 9676, pages 374-391, 2016. [PDF]
• Diego de Una, Graeme Gange, Peter Schacte, and Peter J. Stuckey. Weighted spanning tree constraint with explanations. In Claude-Guy Quimper, editor, Thirteenth International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, LNCS 9676, pages 98-107, 2016. [PDF]
• Ignasi Abio, Graeme Gange, Valentin Mayer-Eichberger, and Peter J. Stuckey. On CNF encodings for decision diagrams. In Claude-Guy Quimper, editor, Thirteenth International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, LNCS 9676, pages 1-17, 2016. [PDF]
• Geoffrey Chu and Peter J. Stuckey. Lagrangian decomposition via subproblem search. In Claude-Guy Quimper, editor, Thirteenth International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, LNCS 9676, pages 65-80, 2016. [PDF]
• Daniel Harabor and Peter J. Stuckey. Rail capacity planning with constraint programming. In Claude-Guy Quimper, editor, Thirteenth International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, LNCS 9676, pages 170-186, 2016. [PDF]
• Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Sondergaard, and Peter J. Stuckey. An abstract domain of uninterpreted functions. In B. Jobstmann and K.R.M. Leino, editors, Proceedings of 17th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2016), LNCS 9583, pages 85-103. Springer, 2016. [PDF]
• Diego de Una, Graeme Gange, Peter Schachte, and Peter J. Stuckey. Steiner tree problems with side constraints using constraint programming. In Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI-16), pages 3383-3389, 2016. [PDF] [AAAI]
• Nathaniel Baxter, Geoffrey Chu, and Peter J. Stuckey. Symmetry declarations for MiniZinc. In D. Parry, editor, Proceedings of the 39th Australasian Computer Science Conference (ACSC 2016), page Article 20, 2016.

  2015

• Rehan Aziz, Geoffrey Chu, Christian Muise, and Peter J. Stuckey. #∃SAT: Projected model counting. In Marijn Heule and Sean Weaver, editors, Proceedings of the 18th International Conference on Theory and Applications of Satisfiability Testing, LNCS 9583, pages 85-103. Springer, 2015. [PDF]
• Ignasi Abo, Valentin Mayer-Eichberger, and Peter J. Stuckey. Encoding linear constraints with implications chains to CNF. In Gilles Pesant, editor, Proceedings of the 21st International Conference on Principles and Practice of Constraint Programming, LNCS 9255, pages 3-11. Springer, 2015. [PDF]
• Andrea Rendl, Tias Guns, Peter J. Stuckey, and Guido Tack. MiniSearch: a solver-independent meta-search language for MiniZinc. In Gilles Pesant, editor, Proceedings of the 21st International Conference on Principles and Practice of Constraint Proxgramming, LNCS 9255, pages 376-392. Springer, 2015. [PDF]
• Stefan Kreter, Andreas Schutt, and Peter J. Stuckey. Modeling and solving project scheduling with calendars. In Gilles Pesant, editor, Proceedings of the 21st International Conference on Principles and Practice of Constraint Programming, LNCS 9255, pages 262-278. Springer, 2015. [PDF]
• Mohadaseh Ganji, Abbas Seifi, Hosein Alizadeh, James Bailey, and Peter J. Stuckey. Generalized modularity for community detection. In Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD), LNAI 9825, pages 655-670. Springer, 2015. [PDF]
• Toby Davies, Adrian R. Pearce, Peter J. Stuckey, and Nir Lipovetzky. Sequencing operator counts. In Partick Haslum and Schlomo Zilberstein, editors, Proceedings of the 25th International Conference on Automated Planning and Scheduling, pages 61-69, 2015. ICAPS 2015 Outstanding Paper Award. [PDF] [ICAPS]
• Toby Davies, Adrian Pearce, Peter J. Stuckey, and Harald Sondergaard. Optimization and Relaxation for Mulitagent Planning in the Situation Calculus. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems. pages 1141-1149. ACM Press, 2015. [PDF] [AAMAS]
• Christina Burt, Nir Lipovetzky, Adrian Pearce, and Peter J. Stuckey. Scheduling with fixed maintenance, shared resources and nonlinear feedrate constraints: a mine planning case study. In Proceedings of Twelfth International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming (CPAIOR 2015), LNCS 9075, pages 91-107. Springer, 2015. [PDF] [DOI]
• Geoffrey Chu and Peter J. Stuckey. Learning value heuristics for constraint programming. In Proceedings of Twelfth International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming (CPAIOR 2015), LNCS 9075, pages 108-123. Springer, 2015. [PDF] [DOI]
• Graeme Gange, Jorge Navas, Peter Schachte, Harald Sondergaard, and Peter J. Stuckey, A Tool for Intersecting Context-Free Grammars and Its Applications. In NASA Formal Methods: Proceedings of the Seventh International Symposium, LNCS 9058, pages 422-428, Springer, 2015. [PDF] [DOI]
• J.Robert M. Cornish, Graeme Gange, Jorge A. Navas, Peter Schacte, Harald Sondergaard, and Peter J. Stuckey. Analyzing array manipulating programs by program transformation. In Post-Conference Proceedings of the 24th International Symposium on Logic-Based Program Synthesis and Transformation, LNCS 8981, pages 3-20. Springer, 2015. [PDF] [DOI]
• Rehan Aziz, Geoffrey Chu, Christian Muise, and Peter J. Stuckey. Stable model counting and its application in probabilistic logic programming. In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI-15). pages 3468-3474. [PDF] [AAAI]

  2014

• Ignasi Abio and Peter J. Stuckey. Encoding linear constraint into SAT. In B. O'Sullivan, editor, Proceedings of the 20th International Conference on Principles and Practice of Constraint Programming, LNCS 8656, page 75-91. Springer, 2014. [PDF] [DOI]
• Kathryn Francis and Peter J. Stuckey. Loop untangling. In B. O'Sullivan, editor, Proceedings of the 20th International Conference on Principles and Practice of Constraint Programming, LNCS 8656, page 340-355. Springer, 2014. [PDF] [DOI]
• Geoffrey Chu and Peter J. Stuckey. Nested constraint programs. In B. O'Sullivan, editor, Proceedings of the 20th International Conference on Principles and Practice of Constraint Programming, LNCS 8656, page 240-255. Springer, 2014. [PDF] [DOI]
• Roberto Amidini and Peter J. Stuckey. Sequential time splitting and bounds communication for a portfolio of optimization solvers. In B. O'Sullivan, editor, Proceedings of the 20th International Conference on Principles and Practice of Constraint Programming, LNCS 8656, page 108-124. Springer, 2014. [PDF] [DOI]
• Andrea Rendl, Guido Tack, and Peter J. Stuckey. Stochastic MiniZinc. In B. O'Sullivan, editor, Proceedings of the 20th International Conference on Principles and Practice of Constraint Programming, LNCS 8656, page 636-645. Springer, 2014. [PDF] [DOI]
• Rehan Aziz, Goeffrey Chu, and Peter J. Stuckey. Grounding bound founded answer set programs. In Technical Communications of the 30th International Conference on Logic Programming, ICLP 2014, July 19-22, Vienna, Austria, page 15. Cambridge University Press, 2014. Supplementary material to the Introduction to Theory and Practice of Logic Programming / Volume 14 / Special Issue 4-5 / July 2014, pp 401-414. [PDF]
• Kim Marriott, Peter J. Stuckey, and Michael J. Wybrow. Seeing around corners: Fast orthogonal connector routing. In A. Delaney and H. Purchase, editors, Proceedings of the The 8th International Conference on the Theory and Application of Diagrams, LNCS 8578, 31-37. Springer, 2014. [PDF] [DOI]
• Christopher Mears, Andreas Schutt, Peter J. Stuckey, Guido Tack, Kim Marriott, and Mark Wallace. Modelling with option types in MiniZinc. In Proceedings of the 11th International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) techniques in Constraint Programming, LNCS 8451, page 88-103. Springer, 2014. [PDF] [DOI]
• Gleb Belov, Natashia Boland, Martin W.P. Savelsbergh, and Peter J. Stuckey. Local search for a cargo assembly planning problem. In Proceedings of the 11th International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) techniques in Constraint Programming, LNCS 8451, page 159-175. Springer, 2014. [PDF] [DOI]
• Christina Burt, Nir Lipovetsky, Adrian Pearce, and Peter J. Stuckey. Planning for mining operations with time and resource constraints. In S. Chien and A. Fern, editors, Proceedings of the 24th International Conference on Automated Planning and Scheduling, pages 404-412, 2014. [PDF]
• Toby Davies, Adrian Pearce, Peter J. Stuckey, and Harald Sondegaard. Fragment-based planning using column generation. In S. Chien and A. Fern, editors, Proceedings of the 24th International Conference on Automated Planning and Scheduling, pages 83-91, 2014 [PDF]

  2013

• Michael Codish, Alice Miller, Patrick Prosser, and Peter J. Stuckey. Breaking symmetries in graph representation. In F. Rossi, editor, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing/China, pages 510--516. AAAI Press, 2013. [PDF]
• Rafael Caballero, Peter J. Stuckey and Antonio Tenoria-Fornes. Finite Type Extensions in Constraint Programming. In, editor T. Schrijvers, Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming pages 217-228, ACM Press, 2013. [PDF]
• Geoffrey Chu and Peter J. Stuckey. Dominance driven search. In Proceedings of the 19th International Conference on Principles and Practice of Constraint Programming. LNCS 8124, pages 217-229, Springer, 2013 [PDF] [DOI]
• Kathryn Francis, Jorge Navas, and Peter J. Stuckey. Modelling destructive assignments. In Proceedings of the 19th International Conference on Principles and Practice of Constraint Programming. LNCS 8124, pages 315-330, Springer, 2013 [PDF] [DOI]
• Andreas Schutt, Thibaut Feydy, and Peter J. Stuckey. Scheduling optional tasks with explanation. In Proceedings of the 19th International Conference on Principles and Practice of Constraint Programming. LNCS 8124, pages 628-644, Springer, 2013 [PDF] [DOI]
• Ignasi Abio, Robert Nieuwenhuis, Albert Oliveras, Enric Rodriguez-Carbonell, and Peter J. Stuckey. To encode or propagate: The best choice for each constraint in SAT. In Proceedings of the 19th International Conference on Principles and Practice of Constraint Programming. LNCS 8124, pages 97-106, Springer, 2013 [PDF] [DOI]
• Graeme Gange, Peter J. Stuckey, and Pascal Van Hentenryck. Explaining propagators for edge-valued decision diagrams. In Proceedings of the 19th International Conference on Principles and Practice of Constraint Programming. LNCS 8124, pages 340-355, Springer, 2013 [PDF] [DOI]
• Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Sondergaard, and Peter J. Stuckey. Abstract interpretation over non-lattice abstract domains. In F. Logozzo and M. Fahndrich, editors, Proceedings of the 20th Static Analysis Symposium, LNCS 7935, pages 6-24. Springer, 2013. [DOI] [PDF]
• Graeme Gange, Jorge A. Navas, Peter J. Stuckey, Harald Sondergaard, and Peter Schachte. Solving difference constraints over modular arithmetic. In Maria Bonacina, editor, Proceedings of the 24th International Conference on Automated Deduction, LNCS 7898, pages 215-230. Springer, 2013. [DOI] [PDF]
• Hanyu Gu, Andreas Schutt, and Peter J. Stuckey. A Lagrangian relaxation based forward-backward improvement heuristic for maximising the net present value of resource-constrained projects. In Proceedings of the 10th International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) techniques in Constraint Programming, LNCS 7874, pages 340--346. Springer, 2013. [PDF]
• Peter J. Stuckey and Guido Tack. Minizinc with functions. In Proceedings of the 10th International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) techniques in Constraint Programming, LNCS 7874, pages 268-283. Springer, 2013. [PDF]
• Andreas Schutt, Thibaut Feydy, and Peter J. Stuckey. Explaining time-table-edge-finding propagation for the cumulative resource constraint. In Proceedings of the 10th International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) techniques in Constraint Programming, LNCS 7874, pages 234-250. Springer, 2013. [PDF]
• Graeme Gange, Jorge A. Navas, Peter J. Stuckey, Harald Sondergaard, and Peter Schachte. Unbounded model-checking with interpolation for regular language constraints. In Proceedings of 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), number 7795 in LNCS, pages 279-293. Springer, 2013. [PDF]
• Rehan Abdul Aziz, Peter J. Stuckey and Zoltan Somogyi. Inductive definitions in constraint programming. In Proceedings of the Thirty-Sixth Australasian Computer Science Conference (ACSC 2013), page 41-50, 2013. [PDF]

  2012

• J. A. Navas, P. Schachte, H. Sondergaard, and P. J. Stuckey. Signedness-agnostic program analysis: Precise integer bounds for low-level code. In R. Jhala and A. Igarashi, editors, APLAS 2012: Proceedings of the 10th Asian Symposium on Programming Languages and Systems, volume 7705 of Lecture Notes in Computer Science, pages 115-130. Springer, 2012. [PDF]
• I. Abio and P.J. Stuckey. Conflict directed lazy decomposition. In M. Milano, editor, Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming, pages 70-85. LNCS 7514. Springer, 2012. [PDF]
• G. Chu and P.J. Stuckey. Inter-instance nogood learning in constraint programming. In M. Milano, editor, Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming, pages 238-247. LNCS 7514. Springer, 2012. [PDF]
• G. Chu and P.J. Stuckey. A generic method for identifying and exploiting dominance relations. In M. Milano, editor, Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming, pages 6-22. LNCS 7514. Springer, 2012. [PDF] Best Paper Award: CP 2012
• H. Gu, P.J. Stuckey, and M. Wallace. Maximising the net present value of large resource-constrained projects. In M. Milano, editor, Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming, pages 767-781. LNCS 7514. Springer, 2012. [PDF]
• K. Francis, S. Brand, and P.J. Stuckey. Optimization modelling for software developers. In M. Milano, editor, Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming, pages 274-289. LNCS 7514. Springer, 2012. [PDF]
• M. Wybrow, K. Marriott, and P.J. Stuckey. Orthogonal hyperedge routing. In P. Cox and B. Plimmer, editors, 7th International Conference on the Theory and Applications of Diagrams, LNCS 7352, pages 51-64. Springer, 2012.
• G. Gange, K. Marriott, and P.J. Stuckey. Optimal guillotine layout. In Proceedings of the 12th International Symposium on Document Engineering, page 13-22. ACM Press, 2012. [PDF] Best Paper Award: DOCENG 2012
• B. De Cat, M. Denecker, and P.J. Stuckey. Lazy model expansion by incremental grounding. In Technical Communications of the 28th International Conference on Logic Programming, ICLP 2011, September 4-8, 2012, Hungary, Budapest, volume 12 of LIPIcs, page 117-127. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2012. [PDF]
• P. Chico de Guzman, M. Carro, M. Hermenefildo, and P.J. Stuckey. A general implementation framework for TCLP. In P. Theimann and T. Schrijvers, editors, Proceedings of the 11th International Symposium on Functional and Logic Programming, LNCS 7294, pages 104-119. Springer, 2012. [DOI] [PDF]
• N. Downing, T. Feydy, and P.J. Stuckey. Explaining flow-based propagation. In N. Beldiceanu, N. Jussien, and E. Pinson, editors, International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), LNCS 7298, pages 146-162. Springer, 2012. [DOI] [PDF]
• A. Schutt, G. Chu, P.J. Stuckey, and M. Wallace. Maximizing the net-present-value for resource constrained project scheduling. In N. Beldiceanu, N. Jussien, and E. Pinson, editors, International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), LNCS 7298, pages 363-378. Springer, 2012. [DOI] [PDF]
• G. Gange and P.J. Stuckey. Explaining propagators for s-DNNF circuits. In N. Beldiceanu, N. Jussien, and E. Pinson, editors, International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), LNCS 7298, pages 195-210. Springer, 2012. [DOI] [PDF]
• N. Downing, T. Feydy, and P.J. Stuckey. Explaining alldifferent. In Proceedings of the Australasian Computer Science Conference (ACSC 2012), CRPIT Volume 122, pages 115--124, 2012. [PDF]

  2011

• T. Feydy, Z. Somogyi, and P.J. Stuckey. Half-reification and flattening. In J.H.M. Lee, editor, Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming, LNCS, pages 286-301. Springer, 2011. [DOI] [PDF]
• A. Metodi, M. Codish, V. Lagoon, and P.J. Stuckey. Boolean equi-propagation for optimized SAT encoding. In J.H.M. Lee, editor, Proceedings of the 17th Interna- tional Conference on Principles and Practice of Constraint Programming, LNCS, pages 621-636. Springer, 2011. [DOI] [PDF]
• T. Schrijvers, G. Tack, P. Wuille, H. Samulowitz, and P.J. Stuckey. Search com- binators. In J.H.M. Lee, editor, Proceedings of the 17th International Confer- ence on Principles and Practice of Constraint Programming, LNCS, pages 774-788. Springer, 2011. [DOI] [PDF]
• A. Schutt, P.J. Stuckey, and A. Verden. Optimal carpet cutting. In J.H.M. Lee, editor, Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming, LNCS, pages 69-84. Springer, 2011. [DOI] [PDF] Runner Up, Best Application Paper Award: CP 2011
• L. De Koninck, S. Brand, and P.J. Stuckey. Constraints in non-boolean contexts. In Technical Communications of the 27th International Conference on Logic Programming, ICLP 2011, July 6-10, 2011, Lexington, Kentucky, USA, volume 11 of LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011. [DOI]
• G. Gange, K. Marriott, P. Moulder, and P.J. Stuckey. Optimal automatic table layout. In Proceedings of the 11th ACM Symposium on Document Engineering, pages 20-32, 2011. [DOI] [PDF]
• P. Wuille, T. Schrijvers, H. Samulowitz, G. Tack, and P.J. Stuckey. Memoizing a monadic mixin DSL. In H. Kuchen, editor, Procs. of 20th International Workshop of Functional and (Constraint) Logic Programming, volume 6816 of LNCS, pages 68-85, 2011. [DOI]
• G. Chu, M. Garcia de la Banda, C. Mears, and P.J. Stuckey. Symmetries and lazy clause generation. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pages 516-521, 2011. [PDF]
• I. Abio, M. Deters, R. Nieuwenhuis, and P.J. Stuckey. Reducing chaos in SAT-like search: Finding solutions close to a given one. In K. Sakallah and L. Simon, editors, Proceedings of the Fourteenth International Conference on Theory and Applications of Satisfiability Testing, volume 6695 of LNCS, pages 273-286. Springer, 2011. [DOI] [PDF]
• G. Gange, K. Marriott, and P.J. Stuckey. Optimal k-level planarization and crossing minimization. In Proceedings of 17th International Symposium on Graph Drawing, volume 6695 of LNCS, pages 238-249. Springer, 2011. [DOI] [PDF]

  2010

• G. Chu, M. Garcia de la Banda, and P.J. Stuckey. Automatically exploiting subproblem equivalence in constraint programming. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, volume 6140 of LNCS, pages 71-86. Springer, 2010. LNCS, [PDF]
• T. Berthold, T. Feydy, and P.J. Stuckey. Rapid learning for binary programs. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, volume 6140 of LNCS, pages 51-55. Springer, 2010. LNCS, [PDF]
• K. Marriott, P.J. Stuckey, and M.J. Wybrow. Orthogonal connector routing. In Proceedings of 16th International Symposium on Graph Drawing, LNCS 5849, pages 219-231. Springer, 2010. LNCS, [PDF]
• N. Downing, P.J. Stuckey, and A. Wirth. Improved consensus clustering via linear programming. In Proceedings of the Australasian Computer Science Conference (ACSC 2010), pages 61-69, 2010.

  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, page 746-761. Springer-Verlag, 2009. LNCS, [PDF]
• 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, page 242-257. Springer-Verlag, 2009. LNCS, [PDF]
• 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, page 258-273. Springer-Verlag, 2009. LNCS, [PDF] Runner Up, Best Student Paper Award: CP 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, page 352-366. Springer-Verlag, 2009. LNCS, [PDF]
• 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, page 226-241. Springer-Verlag, 2009. LNCS, [PDF]
• A. Frisch and P.J. Stuckey. The proper treatment of undefinedness in constraint languages. In I. Gent, editor, Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, volume 5732 of LNCS, page 367-382. Springer-Verlag, 2009. LNCS, [PDF]
• R. Reischuk, C. Schulte, P.J. Stuckey, and G. Tack. Maintaining state in propagation solvers. In I. Gent, editor, Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, volume 5732 of LNCS, page 692-706. Springer-Verlag, 2009. LNCS, [PDF]
• 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, page 255-266. ACM Press, 2009. [PDF]
• 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, page 484-488. Springer, 2009. LNCS, [PDF]

  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 5366, pages 531-545. Springer, 2008. [PDF]
• C. Schulte and P.J. Stuckey. Dynamic analysis of bounds versus domain propaga- tion. In M. Garcia de la Banda and E. Pontelli, editors, Proceedings of the 24th International Conference on Logic Programming, LNCS 5366, pages 332-346. Springer, 2008. [PDF]
• 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 5366, pages 749-753. Springer, 2008. [PDF] [ACM]
• 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, page 505-509, 2008. [PDF]
• G. Gange, K. Marriott, and P.J. Stuckey. Smooth linear approximation for non- overlap constraints. In G. Stapleton, J. Howse, and J. Lee, editors, Digrammatic Representation and Inference, volume 5223 of LNCS, pages 45-59. Springer, 2008. [PDF] [DOI]
• C. Schulte and P.J. Stuckey. Dynamic variable elimination during propagation solving. In Proceedings of 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, pages 247-257, 2008. [PDF] [ACM]
• T. Feydy, A. Schutt, and P.J. Stuckey. Global difference constraint propagation for finite domain solvers. In Proceedings of 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, pages 226-235, 2008. [PDF] [ACM]
• J. Puchinger, P.J. Stuckey, M. Wallace, and S. Brand. From high-level model to branch-and- price solution in G12. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, volume 5015 of LNCS, pages 218-232. Springer, 2008. [PDF] [DOI]
• 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, LNCS 4989, pages 32-47 . Springer, 2008. [PDF] [DOI]
• 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. [PDF]
• 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. [PDF]
• J. Puchinger and P.J. Stuckey. Automating branch-and-bound for dynamic programs. In R.Gluck and O. deMoor, editors, Proceedings of the ACM SIGPLAN 2008 Workshop on Partial Evaluation and Program Manipulation (PEPM '08), page to appear. ACM, 2008. [PDF] [ACM]
• 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 , LNCS, pages 68--83. Springer-Verlag, 2008. LNCS, [PDF]

  2007

• 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, LNCS 4741, 544-558. Springer-Verlag, 2007. LNCS, [PDF] Best Student Paper Award: CP 2007
• 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, LNCS 4741, 529-543. Springer-Verlag, 2007. LNCS, [PDF]
• 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, LNCS 4741, 210-224. Springer-Verlag, 2007. LNCS, [PDF]
• G.J. Duck, P.J. Stuckey, and M. Sulzmann. Observable confluence for constraint handling rules. In Proceedings of 23rd International Conference on Logic Programming, LNCS 4670, 224-239. Springer-Verlag, 2007. LNCS, [PDF]
• D. Baatar, N. Boland, S. Brand, and P.J. Stuckey. New constraint programming and integer programming approaches to minimum cardinality decomposition of integer matrices with the consecutive-ones property. In Proceedings of CPAIOR'07, LNCS 4510, page 1-15. Springer-Verlag, 2007. LNCS, [PDF]
• 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. [PDF] [ACM]
• 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. [PDF] Longer Version [ACM]

  2006

• C.W. Choi, W. Harvey, J.H.M. Lee, and P.J. Stuckey. Finite domain bounds consistency revisited. In Proceedings of the Australian Conference on Artificial Intelligence 2006, number 4303 in LNCS, pages 49-58, 2006. [PDF] [LNCS]
• M. Sulzmann, T. Schrijvers, and P.J. Stuckey. Principal type inference for GHC- style multi-parameter type classes. In N. Kobayashi, editor, Proceedings of the Fourth ASIAN Symposium on Programming Languages and Systems (APLAS 2006), number 4279 in LNCS, page 26-43. Springer-Verlag, November 2006. [PDF] [LNCS]
• 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, LNCS, page 117--131. Springer-Verlag, August 2006. [PDF] [LNCS]
• 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), LNCS 4099, page 120-129. Springer-Verlag, 2006. [PDF] LNCS Best Student Paper Award: PRICAI 2006
• 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, LNCS 4098, page 4-18. Springer-Verlag, August 2006. [PDF] LNCS
• 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. [PDF] LNCS
• M. Sulzmann, J. Wazny, and P.J. Stuckey. A framework for extended algebraic data types. In P. Wadler and M. Hagiya, editors, Proceedings of 8th International Symposium on Functional and Logic Programming, LNCS 3945, page 47-64 Springer-Verlag, April 2006. [PDF] LNCS
• 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, page 103-117. Springer, 2006. LNCS [PDF]
• 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, page 118-133. Springer, 2006. LNCS [PDF]
• M. Wybrow, K. Marriott, and P.J. Stuckey. Incremental connector routing. In Proceedings of 13th International Symposium on Graph Drawing, LNCS 3843, pages 446--457. Springer-Verlag, 2006. Springer [PDF]
• T. Dwyer, K. Marriott, and P.J. Stuckey. Fast node overlap removal. In Proceedings of 13th International Symposium on Graph Drawing, LNCS 3843, pages 153-164. Springer Verlag, 2006. Springer [PDF]

  2005

• 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, LNCS 3668 pages 326-340. Springer, 2005. [PDF]
• T. Schrijvers, P.J. Stuckey, and G.J. Duck. Abstract interpretation for constraint handling rules. In Amy Felty, editor, PPDP05: Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, pages 218-229, Lisbon, Portugal, July 2005. ACM. [PDF] [ACM]
• J. Bailey and P.J. Stuckey. Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In M. Hermenegildo, editor, Proceedings of the International Conference of Practical Applications of Declarative Languages, LNCS, page 174-186. Springer-Verlag, 2005. [PDF]

  2004

• P. Hawkins, V. Lagoon, and P.J. Stuckey. Set bounds and (split) set domain propagation using ROBDDs. In G. Webb and X. Yu, editors, AI 2004: Advances in Artificial Intelligence, 17th Australian Joint Conference on Artificial Intelligence, LNCS 3339, pages 706--717. Springer-Verlag, 2004. [PDF]
• P.J. Stuckey, M. Sulzmann, and J. Wazny. Improving type error diagnosis. In Proceedings of the ACM SIGPLAN 2004 Haskell Workshop, page to appear. ACM Press, 2004. ACM Haskell Workshop page [Postscript] [ACM]
• K. Sagonas and P.J. Stuckey. Just enough tabling. In D.S. Warren, editor, Proceedings of the Sixth ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, pages 78-89. ACM Press, 2004. ACM PPDP page [Postscript] [ACM]
• J. Mashford, R. Drogemuller, and P.J. Stuckey. Building design optimization using constraint logic programming. In Eighteenth W(C)LP Workshop on Constraint Logic Programming, 2004. [Postscript]
• G.J. Duck, M. Garcia de la Banda, and P.J. Stuckey. Compiling ask constraints. In B. Demoen and V. Lifschitz, editors, Proceedings of the 20th International Conference on Logic Programming,LNCS, page 105-119. Springer-Verlag, 2004. [Postscript]
• G.J. Duck, M. Garcia de la Banda, P.J. Stuckey, and C. Holzbaur. The refined operational semantics for constraint handling rules. In B. Demoen and V. Lifschitz, editors, Proceedings of the 20th International Conference on Logic Programming,LNCS, page 120-136. Springer-Verlag, 2004. [Postscript] Full version [PDF] Test of Time 10 Year Award: Best Logic Programming paper in 2004, awarded 2014
• V. Lagoon and P.J. Stuckey Set domain propagation using ROBDDs In M. Wallace, editor, Proceedings of the Ninth International Conference on Principles and Practices of Constraint Programming, LNCS 3258, pages 347-361. Springer-Verlag, 2004. [Postscript]
• C. Schulte and P.J. Stuckey. Speeding up constraint propagation. In M. Wallace, editor, Proceedings of the Ninth International Conference on Principles and Practices of Constraint Programming, LNCS 3258, pages 619-633. Springer-Verlag, 2004. [Postscript]
• G.J. Duck, S. Peyton-Jones, P.J. Stuckey, and M. Sulzmann. Sound and decidable type inference for functional dependencies. In D. Schmidt, editor, Proceedings of European Symposium on Programming, LNCS 2986, pages 49--63. Springer-Verlag, 2004. [Postscript]

  2003

• P.J. Stuckey, M. Sulzmann, and J. Wazny. Interactive type debugging in Haskell. In J. Juring, editor, Proceedings of the ACM SIGPLAN 2003 Haskell Workshop, pages 72-83. ACM Press, 2003. [PDF] [ACM]
• P.J. Stuckey, M. Sulzmann, and J. Wazny. The Chameleon type debugger (tool demonstration). In M. Ronsse, editor, Proceedings of the Fifth International Workshop on Automated Debugging, pages 247-260, 2003. [PDF]
• P.J. Stuckey and L. Zheng. Improving nogood recording using 2SAT. In Proceedings of Fifteenth IEEE International Conference on Tools with Artificial Intelligence, page to 94--99, IEEE Computer Society, 2003. [DOI]
• K. Marriott, P.J. Stuckey, and M. Sulzmann. Resource usage verification. In Atsushi Ohori, editor, Proceedings of First Asian Symposium on Programming Languages and Systems, LNCS 2895, page 212--229. Springer-Verlag, 2003. [Postscript] LNCS
• M. Wybrow, K. Marriott, L. McIver, and P.J. Stuckey. The usefulness of constraints for diagram editing. In Stephen Viller and Peta Wyeth, editors, OZCHI Proceedings, page 192--201, Information Environments Program, University of Queensland, 2003. [PDF]
• V. Lagoon, F. Mesnard, and P.J. Stuckey. Termination analysis with types is more accurate. In Catuscia Palamidessi, editor, Proceedings of the 19th International Conference on Logic Programming, LNCS 2916, page 254--268. Springer-Verlag, 2003. [Postscript]
• C.W. Choi, J.H.M. Lee, and P. J. Stuckey. Propagation redundancy in redundant modelling. In F. Rossi, editor, Proceedings of the Eighth International Conference on Principles and Practices of Constraint Programming, LNCS 2833, page 229--243. Springer-Verlag, 2003. [Postscript]
• K. C. K. Cheng, J.H.M. Lee, and P. J. Stuckey. Box constraint collections for adhoc constraints. In F. Rossi, editor, Proceedings of the Eighth International Conference on Principles and Practices of Constraint Programming, LNCS 2833, page 214--228. Springer-Verlag, 2003. [Postscript]
• M. Garcia de la Banda, P.J. Stuckey, and J. Wazny. Finding all minimal unsatisfiable subsets. In D. Miller, editor, Proceedings of the Fifth ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, page 32--43. ACM Press, 2003. ACM page [Postscript] [ACM] Most Influential Paper 10 Year Award: 2013 for PPDP 2003

  2002

• L. Merlot, N. Boland, B. Hughes, and P.J. Stuckey. A hybrid algorithm for the examination timetabling problem. In Proceedings of PATAT2002, LNCS 2740, page 207--231, Springer-Verlag, 2002. [PDF] LNCS
• G.J. Duck, P.J. Stuckey, M. Garcia de la Banda, and C. Holzbaur. Extending arbitrary solvers with constraint handling rules. In D. Miller, editor, Proceedings of the Fifth ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, page 79--90. ACM Press, 2003. ACM page [Postscript] [ACM]
• H. Fang, Y. Kilani, J.H.M. Lee, and P.J. Stuckey. Reducing search space in local search for constraint satisfaction. In R. Dechter, R. Sutton, and M. Kearns, editors, Proceedings of the 18th National Conference on Artificial Intelligence, 28--33 2002. AAAI proceedings page [PDF]
• V. Lagoon and P. J. Stuckey. Precise pair-sharing analysis of logic programs. In C. Kirchner, editor, Proceedings of the Fourth International Conference on Principles and Practice of Declarative Programming, 99--108. ACM Press, 2002. ACM page Tech Report version [Postscript] [ACM]
• Z. Somogyi and P. J. Stuckey. Using the heap to eliminate stack accesses. In C. Kirchner, editor, Proceedings of the Fourth International Conference on Principles and Practice of Declarative Programming, 121--132. ACM Press, 2002. ACM page [Postscript] [ACM]
• D. Overton, Z. Somogyi, and P. J. Stuckey. Constraint-based mode analysis of mercury. In C. Kirchner, editor, Proceedings of the Fourth International Conference on Principles and Practice of Declarative Programming, 109--120. ACM Press, 2002. ACM page [ACM]
• K. Glynn, P. J. Stuckey, M. Sulzmann, and H. Sondergaard. Exception Analysis for Non-Strict Languages In S. Peyton-Jones, editor, Proceedings of the International Conference on Functional Programming, ACM Press, 98--109, 2002. ACM page [ACM]
• P. J. Stuckey and M. Sulzmann. A theory of overloading. In S. Peyton-Jones, editor, Proceedings of the International Conference on Functional Programming, ACM Press, 167--178, 2002. ACM page Tech Report [Postscript] [ACM]
• I. Sitzmann and P.J. Stuckey. Compacting discriminator information for spatial trees. In Proceedings of the Thirteenth Australasian Database Conference (ADC2002), page 167--176, January 2002. [Postscript]
• L. Zheng and P.J. Stuckey. Improving SAT using 2SAT. In Proceedings of the 25th Australasian Computer Science Conference, page 331--340, Melbourne, 2002. [Postscript]

  2001

• C. Holzbaur, P.J. Stuckey, M. Garcia de la Banda, and D. Jeffery. Optimizing compilation of constraint handling rules. In P. Codognet, editor, Logic Programming: Proceedings of the 17th International Conference, LNCS, pages 74--89. Springer-Verlag, 2001. [Postscript]
• M. Garcia de la Banda, D. Jeffery, K. Marriott, P.J. Stuckey, N. Nethercote, and C. Holzbaur. Building constraint solvers with HAL. In P. Codognet, editor, Logic Programming: Proceedings of the 17th International Conference, LNCS, pages 90--104. Springer-Verlag, 2001. [Postscript]
• S. Genaim, M. Codish, H. Sondergaard, and P.J. Stuckey. Beyond Pos: High-precision groundness and uniqueness analysis. In P. Codognet, editor, Logic Programming: Proceedings of the 17th International Conference, LNCS, pages 135--149. Springer-Verlag, 2001. [Postscript]
• K. Marriott, P. Moulder, P.J. Stuckey, and A. Borning. Solving disjunctive constraints for interactive graphical applications. In T. Walsh, editor, Proceedings of the Sixth International Conference on Principles and Practices of Constraint Programming, LNCS, pages 361--374. Springer-Verlag, 2001. [Postscript]
• C. Schulte and P.J. Stuckey. When do bounds and domain propagation lead to the same search space. In Proceedings of Third International Conference on Principles and Practice of Declarative Programming, page 115--126. ACM Press, 2001. ACM page [Postscript] [ACM]
• K. Glynn, M. Sulzmann, and P.J. Stuckey. Efficient strictness analysis with HORN constraints. In P. Cousot, editor, Proceedings of the Eighth International Static Analysis Symposium, number 2126 in LNCS, pages 73--92, 2001. [Postscript]
• K. Ross, I. Sitzmann, and P.J. Stuckey. Cost-based unbalanced R-trees. In Proceedings of the Thirteenth International Conference on Scientific and Statistical Database Management, page 203--212, IEEE Press, 2001. [Postscript]
• K. Glynn, M. Sulzmann, P.J. Stuckey, and H. Sondergaard. Boolean constraints for binding-time analysis. In O. Danvy and A. Filinski, editors, Proceedings of the Second Symposium on Programs as Data Objects, LNCS 2053, pages 36--92, 2001. [Postscript] [DOI]
• V. Lagoon and P.J. Stuckey. A framework for analysis of typed logic programs. In A. Middeldorp, H. Kuchen, and K. Ueda, editors, Proceedings of the Fifth International Symposium on Functional and Logic Programming, LNCS 2024, pages 296--310, 2001. [Postscript] [DOI]
• F. Bueno, M. Garcia de la Banda, M. Hermenegildo, K. Marriott, G. Puebla, and P. Stuckey. A model for inter-module analysis and optimizing compilation. In Kung-Kiu Lau, editor, Tenth International Workshop on Logic-based Program Synthesis and Transformation, LNCS 2042, pages 86--102. Springer-Verlag, July 2001. [Postscript] [DOI]

  2000

• I. Sitzmann and P.J. Stuckey. Improving temporal joins using histograms. In Proceedings of the DEXA 2000, LNCS 1873, pages 488--498, 2000. Springer-Verlag. [Postscript]
• M. Garcia de la Banda, P.J. Stuckey, W. Harvey, and K. Marriott. Mode checking in HAL. In J. LLoyd et al., editor, Proceedings of the First International Conference on Computational Logic, LNCS 1861, 1270--1284. Springer-Verlag, July 2000. [Postscript]
• I. Sitzmann and P.J. Stuckey. O-trees: a constraint based index structure. In M. Orlowska, editor, Proceedings of the Eleventh Australasian Database Conference (ADC2000), pages 127--135. IEEE Press, January 2000. [Postscript] Best Student Paper Award: ADC 2000

  1999

• G. Badros, A. Borning, K. Marriott, and P.J. Stuckey. Constraint cascading style sheets for the web. In Proceedings of the 1999 ACM Symposium on User Interface Software and Technology, page 73--82. ACM Press, 1999. ACM page [Postscript] [ACM]
• B. Demoen, M. Garcia de la Banda, W. Harvey, K. Marriott, and P.J. Stuckey. Herbrand constraint solving in HAL. In D. De Schreye, editor, Logic Programming: Proceedings of the 16th International Conference, pages 260--274. MIT Press, 1999. [Postscript]
• B. Demoen, M. Garcia de la Banda, W. Harvey, K. Marriott, and P.J. Stuckey. An overview of HAL. In J. Jaffar, editor, Proceedings of the Fourth International Conference on Principles and Practices of Constraint Programming, LNCS. Springer-Verlag, pages 174--188, October 1999. [Postscript]
• R. Lin, K. Marriott, and P.J. Stuckey. Flexible font-size specification in web documents. In J. Edwards, editor, Proceedings of the 22nd Australian Computer Science Conference, pages 15--26. Springer-Verlag, January 1999. [Postscript] Best Student Paper Award: ACSC 1999
• B. Demoen, M. Garcia de la Banda, and P.J. Stuckey. Type constraint solving for parametric and ad-hoc polymorphism. In J. Edwards, editor, Proceedings of the 22nd Australian Computer Science Conference, pages 217--228. Springer-Verlag, January 1999. [Postscript]

  1998

• K.F. Choi, J.H.M. Lee, and P.J. Stuckey. A Lagrangian reconstruction of a class of local search methods. In Proceedings of the Tenth IEEE International Conference on Tools with Artificial Intelligence, pages 166--175. IEEE Press, November 1998. [Postscript]
• W. Harvey and P.J. Stuckey. Constraint representation for propagation. In M. Maher and J-F. Puget, editors, Proceedings of the Fourth International Conference on Principles and Practices of Constraint Programming, LNCS, pages 235--249. Springer-Verlag, October 1998. [Postscript] (fuller version)
• V. Tam and P.J. Stuckey. An efficient heuristic-based evolutionary algorithm for solving constraint satisfaction problems. In Proceedings of the Intelligence in Neural and Biological Systems Conference, pages 75--82, 1998. [Postscript]
• P.J. Stuckey and V. Tam. Improving GENET and EGENET by new variable ordering strategies. In H. Selvaraj and B. Verna, editors, Proceedings of International Conference on Computational Intelligence and Multimedia Applications, pages 107--112, 1998. [PDF]

  1997

• P.J. Stuckey and V. Tam. Extending EGENET with lazy constraint consistency. In Proceedings of the Ninth IEEE International Conference on Tools with Artificial Intelligence, pages 248 -- 257, 1997. [PDF]
• W. Harvey, P.J. Stuckey, and A. Borning. Compiling constraint solving using projection. In G. Smolka, editor, Proceedings of the Third International Conference on Principles and Practices of Constraint Programming, LNCS, pages 491--505. Springer-Verlag, October 1997. [Postscript] LNCS site
• A. Borning, K. Marriott, P.J. Stuckey, and I. Xiao. Solving linear arithmetic constraints for user interface applcations. In C. Schwandt, editor, Proceedings of the 1997 ACM Symposium on User Interface Software and Technology, pages 87--96. ACM Press, October 1997. [PDF] [ACM]
• P.J. Stuckey. Constraint search trees. In L. Naish, editor, Logic Programming: Proceedings of the 14th International Conference, pages 301--315, Leuven, Belgium, July 1997. MIT Press. [Postscript]
• M. Garcia de la Banda, G. Puebla, K. Marriott, and P.J. Stuckey. Optimization of logic programs with dynamic scheduling. In L. Naish, editor, Logic Programming: Proceedings of the 14th International Conference, pages 93--107, Leuven, Belgium, July 1997. MIT Press. [Postscript]
• W. Harvey and P.J. Stuckey. A unit two variable per inequality integer constraint solver for constraint logic programming. In Proceedings of the 20th Australasian Computer Science Conference, pages 102--111, 1997. [Postscript]
• A. Kelly, K. Marriott, H. Sondergaard, and P.J. Stuckey. A generic object oriented incremental analyser for constraint logic programs. In Proceedings of the 20th Australasian Computer Science Conference, pages 92--101, 1997. [Postscript]

  1996

• J.H.M. Lee, H.F. Leung, P.J. Stuckey, V.W.L. Tam, and H.W. Won. Using stochastic methods to guide search in constraint logic programming: a preliminary report. In Proceedings of the 1996 Asian Conference on Computer Science, number 1179 in LNCS, pages 43--52, Singapore, December 1996. Springer-Verlag. LNCS Site
• P.J. Stuckey and V. Tam. Models for using stochastic solvers in constraint logic programming. In Proceedings of the International Conference on Programming Languages: Implementations, Logics and Programs, number 1140 in LNCS, pages 423--437, Aachen, Germany, September 1996. Springer-Verlag. Springer Online
• R. Johnston, A. Moffat, H. Sondergaard, and P.J. Stuckey. Low-contact learning in a first year programming course. In J. Rosenberg, editor, Proceedings of the First Australasian Conference on Computer Science Education, pages 19--26. ACM Press, 1996. [PDF]
• A. Kelly, A. Macdonald, K. Marriott, P.J. Stuckey, and R.H.C. Yap. Effectiveness of optimizing compilation of CLP(R). In M.J. Maher, editor, Logic Programming: Proceedings of the 1992 Joint International Conference and Symposium, pages 37--51, Bonn, Germany, September 1996. MIT Press. [PDF]
• P. Seshadri, J. Hellerstein, R. Ramakrishnan, T.Y.C. Leung, H. Pirahesh, D. Srivastava, P.J. Stuckey, , and S. Sudarshan. Cost-based magic optimization: Algebra and implementation. In Proceedings of the ACM SIGMOD Conference on Management of Databases, pages 435--446, 1996. [PDF] [ACM]
• P.J. Stuckey and V. Tam. Using stochastic solvers in constraint logic programming. In Proceedings of the 19th Australian Computer Science Conference, pages 174--183, Melbourne, Australia, January 1996. [PDF]

  1995

• M. Garcia de la Banda, K. Marriott, and P.J. Stuckey. Efficient analysis of logic programs with dynamic scheduling. In Logic Programming: Proceedings of the 1995 International Symposium, pages 417--43, Portland, Oregon, December 1995. MIT Press. [PDF]
• D.B. Kemp, P.J. Stuckey, and K. Ramamohanarao. ELS-programs and the efficient evaluation of non-stratified programs by transformation to ELS. In Proceedings of the Fourth International Conference on Deductive and Object-Oriented Databases, number 1013 in LNCS, pages 91--108, Singapore, December 1995. Springer Online
• A. Kelly, A. Macdonald, K. Marriott, H. Sondergaard, P.J. Stuckey, and R.H.C. Yap. An optimizing compiler for CLP(R). In Proceedings of the First International Conference on Principles and Practices of Constraint Programming, number 976 in LNCS, pages 222--239, Cassis, Franc, September 1995.
• M. Hermenegildo, G. Peubla, K. Marriott, and P. Stuckey. Incremental analysis of logic programs. In L. Sterling, editor, Logic Programming: Proceedings of the 12th International Conference, pages 797--814, Tokyo, Japan, June 1995. MIT Press. [PDF]
• J. Burg, P.J. Stuckey, J.C.H. Tai, and R.H.C. Yap. Linear equation solving for constraint logic programming. In L. Sterling, editor, Logic Programming: Proceedings of the 12th International Conference, pages 33--48, Tokyo, Japan, June 1995. MIT Press. [PDF]

  1994

• J. Jaffar, M. J. Maher, P.J. Stuckey, and R.H.C. Yap. Beyond finite domains. In Proceedings of the International Workshop on Principle and Practices of Constraint Programming, number 874 in LNCS, pages 86--93, Orcas Island, Washington, May 1994. Springer-Verlag. Springer Online
• K.A. Ross, D. Srivastava, P.J. Stuckey, and S. Sudarshan. Foundations of aggregation constraints. In Proceedings of the International Workshop on Principle and Practices of Constraint Programming, number 874 in LNCS, pages 94--104, Orcas Island, Washington, May 1994. Springer-Verlag. Springer Online
• P.J. Stuckey and S. Sudarshan. Compiling query constraints. In Proceedings of the ACM SIGMOD Symposium on Principles of Database Systems, pages 56--67, 1994. [DOI] [ACM]
• K. Marriott and P.J. Stuckey. Approximating interaction between linear arithmetic constraints. In M. Bruynooghe, editor, Logic Programming: Proceedings of the 1994 International Symposium, pages 571--585, Ithaca, New York, November 1994. MIT Press.
• K. Marriott, H. Sondergaard, P. J. Stuckey, and R. Yap. Optimizing compilation for CLP(R). In G. Gupta, editor, Proceedings of the 17th Australian Computer Science Conference, pages 551--560, Christchurch, New Zealand, January 1994.

  1993

• P.J. Stuckey and S. Sudarshan. Well founded ordered search. In R.K. Shymasundar, editor, Proceedings of the Conference on Foundations of Software Technology and Theoretical Computer Science, number 761 in LNCS, pages 161--172, Bombay, India, December 1993. Springer-Verlag. Springer Online
• A.D. Macdonald, P.J. Stuckey, and R.H.C. Yap. Redundancy of variables in CLP(R). In Logic Programming: Proceedings of the 1993 International Symposium, pages 75--93, Vancouver, Canada, October 1993. MIT Press. [PDF]
• D.B. Kemp and P. J. Stuckey. Analysis based constraint query optimization. In D.S. Warren, editor, Logic Programming: Proceedings of the 10th International Conference, pages 666--682, Budapest, Hungary, June 1993. MIT Press.
• K. Marriott and P.J. Stuckey. The 3 R's of optimizing constraint logic programs: Refinement, removal and reordering. In Proceedings of the Twentieth ACM Symposium on Principles of Programming Languages, pages 334--344, Charleston, South Carolina, 1993. [ACM]

  1992

• D.B. Kemp, D. Srivastava, and P. J. Stuckey. Query restricted bottom-up evaluation of normal programs. In K. Apt, editor, Logic Programming: Proceedings of the 1992 Joint International Conference and Symposium, pages 288--302, Washington, D.C., November 1992. MIT Press. [PDF]
• J. Jaffar, S. Michaylov, P.J. Stuckey, and R.H.C. Yap. An abstract machine for CLP(R). In Proceedings of the ACM Symposium on Programmming Languages Design and Implementation, pages 128--139, San Francisco, June 1992. [ACM]
• J. Jaffar, M. Maher, P.J. Stuckey, and R.H.C. Yap. Output in CLP(R). In Proceedings of the 1992 Conference on Fifth Generation Computer Systems, volume 2, pages 987--995, Tokyo, June 1992.

  1991

• D.B. Kemp and P.J. Stuckey. Semantics of logic programs with aggregates. In V. Saraswat and K. Ueda, editors, Logic Programming: Proceedings of the 1991 International Symposium, pages 387--404, San Diego. California, October 1991. [PDF]
• D.B. Kemp, D. Srivastava, and P.J. Stuckey. Magic sets and bottom up computation of well-founded models. In V. Saraswat and K. Ueda, editors, Logic Programming: Proceedings of the 1991 International Symposium, pages 337--354, San Diego. California, October 1991. PDF
• P.J. Stuckey. Constructive negation for constraint logic programming. In Proceedings of the Fifth Logic in Computer Science Conference, pages 328--341, Amsterdam, 1991.
• P.J. Stuckey. A new approch to constructive negation. In Proceedings of the 14th Australian Computer Science Conference, pages 20.1--20.11, Sydney, Australia, 1991.
• J. Vaghani, K. Ramamohanarao, D.B. Kemp, Z. Somogyi, and P.J. Stuckey. Design overview of the Aditi deductive database system. In Proceedings of the Seventh International Conference on Data Engineering, pages 240--247, 1991.

  1990

• K. Kanchanasut and P.J. Stuckey. Eliminating negation from normal logic programs. In H. Kirchner and W. Wechler, editors, Proceedings of the First International Conference on Algebraic and Logic Programming, number 463 in LNCS, pages 217--231. Springer-Verlag, 1990. PDF
• P. Lim and P.J. Stuckey. A constraint logic programming shell. In Proceedings of the International Workshop on Programming Languages Implementation and Logic Programming, number 456 in LNCS, pages 75--88. Springer-Verlag, 1990.
• P. Lim and P.J. Stuckey. Meta-programming as constraint programming. In S. Debray and M. Hermengildo, editors, Logic Programming: Proceedings of the 1990 North American Conference, pages 406--420, Austin, Texas, October 1990. MIT Press.

  1989

• N.C. Heintze, S. Michaylov, P.J. Stuckey, and R. Yap. On meta programming in CLP(R). In E. Lusk and R. Overbeek, editors, Logic Programming: Proceedings of the 1989 North American Conference, pages 52--68, Cleveland, Ohio, October 1989. MIT Press.
• M.J. Maher and P.J. Stuckey. Expanding query power in constraint logic programming. In E. Lusk and R. Overbeek, editors, Logic Programming: Proceedings of the 1989 North American Conference, pages 20--36, Cleveland, Ohio, October 1989. MIT Press.

  1987

• N.C. Heintze, S. Michaylov, and P.J. Stuckey. CLP(R) and some electrical engineering problems. In J.-L. Lassez, editor, Logic Programming: Proceedings of 4th International Conference, pages 675--703, Melbourne, Australia, September 1987. MIT Press.

  1986

• J. Jaffar and P.J. Stuckey. Logic program semantics for programming with equations. In E. Shapiro, editor, Logic Programming: Proceedings of 3rd International Conference, number 225 in LNCS, pages 314--326, London, U.K., July 1986. Springer-Verlag.

Technical Reports

• L. De Koninck and S. Brand and P.J. Stuckey, Data independent type reduction for Zinc, in: T. Mancini, J. Pearson (Eds.), Proceedings of the 9th International Workshop on Constraint Modelling and Reformulation (ModRef 2010), 2010, p. 15. [PDF]
• P.J. Stuckey Admissible closure for structures with uninterpreted functors. University of Melbourne Department of Computer Science Tech Report 92/23 1992. [PDF]