Peter J. Stuckey's Publication List
(Always out of date)
In Press

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, page to appear. 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, page to appear. 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, page to appear. Springer.
[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, page to appear. Springer, 2017.
[PDF]
 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, page to appear, 2017.
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.
SpringerVerlag, 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
SpringerVerlag, 2004.

Peter J. Stuckey, editor
Proceedings of the Eighteenth International Conference on Logic
Programming Lecture Notes in Computer Science 2401,
SpringerVerlag, 2002.

John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, KungKiu 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. SpringerVerlag, 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 135160. 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 ResourceConstrained Net Present Value Problem, pages 299318. 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 409452. Elsevier, 2006.

B. Demoen, M. Garcia de la Banda, W. Harvey, K. Marriot, D. Overton, and
P.J. Stuckey.
Herbrand constraints in HAL.
In KK. Lau and M. Bruynooghe, editors, Program Development in
Computational Logic,
Lecture Notes in Computer Science 3049,
pages 501540. SpringerVerlag,
2004.

J. Correas, M. Hermegildo, G. Puebla, M. Garcia de la Banda, K. Marriot,
and P.J. Stuckey.
A generic framework for contextsensitive analysis of modular
programs.
In KK. Lau and M. Bruynooghe, editors, Program Development in
Computational Logic,
Lecture Notes in Computer Science 3049,
pages 234261. SpringerVerlag,
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 16720. 1995.

J. Jaffar, S. Michaylov, P.J. Stuckey, and R.H.C. Yap.
Constraint programming languages.
In 1993 Yearbook of Science and Technology, pages 343346.
McGraw Hill, 1993.
Journal Publications
2016

Michelle Blom, Adrian Pearce, and Peter J. Stuckey. A decompositionbased algorithm for the scheduling of openpit networks over multiple time periods. Management Science, 62(10):30593084, 2016.
[PDF]
[DOI]
 Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Sondergaard, and Peter J. Stuckey. A complete refinement procedure for regular separability of contextfree languages. Theoretical Computer Science, 625:124, 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(45):526524, 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 minimalheight table layout.
INFORMS Journal of Computing, 27(3):449461, 2015.
[PDF]
 Geoffrey Chu and Peter J. Stuckey. Dominance breaking constraints. Constraints, 20(2):155182, 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:235286, 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 TenorioFornes:
Two type extensions for the constraint modeling language MiniZinc.
Sci. Comput. Program. 111: 156189 (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 20082013. AI Magazine, 35(2):5560, 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:904906, 2014.

Michelle L. Blom, Christina N. Burt, Adrian R. Pearce, and Peter J. Stuckey.
A decompositionbased heuristic for collaborative scheduling in a
network of open pit mines.
INFORMS Journal of Computing, 26(4):658676, 2014.
[PDF]

Maria Garcia de la Banda, Peter J. Stuckey, Pascal Van Hentenryck, and Mark
Wallace.
The future of optimization technology.
Constraints, 19(2):126138, 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):434462, 2014.
[PDF]
[DOI]

Kathryn Francis and Peter J. Stuckey.
Explaining Circuit Propagation.
Constraints 19(1):129, 2014.
[PDF]
[DOI]
2013

Elvira Albert, Maria Garcia de la Banda, Miguel GomezZamalloa, Jose Miguel
Rojas, and Peter J. Stuckey.
A CLP heap solver for test case generation.
Theory and Practice of Logic Programming 13(45):721735, 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(45):593607, 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(45):517532, 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):273289, 2013.
[PDF]
[DOI]

T. Schrijvers, G. Tack, P. Wuille, H. Samulowitz, and P.J. Stuckey.
Search combinators.
Constraints, 18(2):269305, 2013.
[PDF]
[DOI]
 Amit Metodi, Michael Codish, and Peter J. Stuckey. Boolean equipropagation for concise and efficient SAT encodings of combinatorial problems.
Journal of Artificial Intelligence Research,
46:303341, 2013.
JAIR

Raj Gaire, Lorey Smith, Patrick Humbert, James Bailey, Peter J. Stuckey, and Izhak Haviv. Discovery and analysis of consistent active subnetworks 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 proorigami. Bioinformatics, pages 33153316, 2011.
[DOI]
[PDF]

G. Chu and P.J. Stuckey.
A complete solution to the maximum density still life problem.
Artificial Intelligence, 184185:116, 2012.
[DOI]
[PDF]

Geoffrey Chu, Maria Garcia de la Banda, Peter J. Stuckey: Exploiting subproblem dominance in constraint programming. Constraints 17(1): 138 (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):173194, 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):120137, 2011.
[PDF]
[DOI]
 G. Gange, P.J. Stuckey, and R. Szymanek. MDD propagators with explanation. Constraints, 16(4):407429, 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):i43i51, 2011.
[DOI]

A. Schutt, T. Feydy, P.J. Stuckey, and M. Wallace. Explaining the cumulative propagator. Constraints, 16(3):173194, 2011.
[DOI]
[PDF]
 J. Puchinger, P.J. Stuckey, M. Wallace, and S. Brand. Dantzigwolfe decomposition and branchandprice solving in G12. Constraints, 16(1):7799, 2011
[DOI]
[PDF]
2010
 A. Schutt and P.J. Stuckey. Incremental satisfiability and implication for UTVPI constraints. INFORMS Journal of Computing, 22(4):514527, 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 BDDSAT hybrid.
Journal of Artificial Intelligence Research, 38:307338, 2010.
[JAIR]
[PDF]

A. Stivala, P.J. Stuckey, M. Garcia de la Banda, M. Hermenegildo, and A. Wirth.
Lockfree parallel dynamic programming.
Journal of Parallel and Distributed Computing, 70:839848, 2010.
[DOI]
[PDF]

P.J. Stuckey, R. Becket, and J. Fischer.
Philosophy of the MiniZinc challenge.
Constraints, 15(3):307316, 2010.
[DOI]
[PDF]
 A. Konagurthu, C. Reboul, J. Schmidberger, J. Irving, A. Lesk, P.J. Stuckey, J. Whisstock, and A. Buckle.
Mustangmr 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):161167, 2010.
[DOI]
2009

T. Schrijvers, P.J. Stuckey, and P. Wadler. Monadic constraint programming. Journal
of Functional Programming, 16(9):663697, 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):357391, 2009.
[PDF]
[DOI]
2010 University of Melbourne Woodward Medal for Science and Technology

A. Stivala, A. Wirth, and P.J. Stuckey. Tableaubased 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):235253, 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:99120, 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):229267, 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:193215,
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):22092233, 2008.
[PDF]

M. Wybrow, K. Marriott, L. McIver, and P.J. Stuckey. Comparing usability of one
way and multiway 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):251283, 2008
[PDF]
 M. Codish, V. Lagoon, and P.J. Stuckey. Logic programming with satisfiability. Theory
and Practice of Logic Programming, 8(1):121128, 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):645651, 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:557585,
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):607617
[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. PeytonJones, and P.J. Stuckey.
Understanding functional dependencies via constraint handling rules.
Journal of Functional Programming, 17(1):83129, 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):609644, 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):559574, August 2006.
Proteins
[PDF]

A. Konagurthu and P.J. Stuckey.
Optimal sumofpairs multiple sequence alignment using incremental CarrilloandLipman bounds.
Journal of Computational Biology, 13(3):668685, 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:93111,
January 2006.
ENTCS.
2005
 P. J. Stuckey and M. Sulzmann. A theory of overloading.
ACM Transactions on Programming Languages and Systems,
27(6):12161269, 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):623668, 2005.
CORR entry
 K. Marriott and P.J. Stuckey.
NPcompletenes of minimal width unordered tree layout.
Journal of Graph Algorithms and Applications, 8(3):295312, 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):388425, 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):503532, 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 109156, 2005
JAIR
[PDF]
2004

A. Konagurthu, J. Whisstock, and P.J. Stuckey.
Progressive multiple alignment using sequence triplet optimizations
and threeresidue exchange costs.
Journal of Bioinformatics and Computational Biology,
2(4): 719745, 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):501546,
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):143172, 2003.
[Postscript]

W. Harvey and P.J. Stuckey.
Improving linear constraint propagation by changing constraint
representation.
Constraints, 8(2):173207, 2003.
[Postscript]
2002

B. Davey, N. Boland, and P.J. Stuckey.
Efficient intelligent backtracking using linear programming.
INFORMS Journal of Computing, 14(4):373386, 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):3560, 2002.
[Postscript]

W. Harvey, P.J. Stuckey, and A. Borning.
Fourier elimination for compiling constraint heirarchies.
Constraints, 7:199212, 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):267306, 2001
[PDF]
[ACM]
2000

K.M.F. Choi, J.H.M. Lee, and P.J. Stuckey.
A Lagrangian reconstruction of GENET.
Artificial Intelligence, 123:139, 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):187223, 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):948976, 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):12231250, 1998.
[Postscript]
[ACM]

J. Jaffar, M. Maher, K. Marriott, and P.J. Stuckey.
The semantics of constraint logic programs.
Journal of Logic Programming, 37(13):146, 1998.
[Postscript]

A. Kelly, K. Marriott, H. Sondergaard, and P.J. Stuckey.
A practical objectoriented analysis engine for CLP.
Software: Practice and Experience, 28(2):199224, 1998.

P.J. Stuckey and V. Tam.
Extending GENET with lazy arc consistency.
IEEE Transactions on Systems, Man and Cybernetics,
28(5):698702, 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):137, 1998.
[Postscript]

D.B. Kemp, K. Ramamohanarao, and P.J. Stuckey.
An efficient evaluation technique for nonstratified programs by
transformation to explicitly locally stratified programs.
Journal of Systems Integration, 7:191230, 1998.

K.A. Ross, D. Srivastava, P.J. Stuckey, and S. Sudarshan.
Foundations of aggregation constraints.
Theoretical Computer Science, 193(12):149179, 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):123,
1998.
[PDF]
1997

N.C. Heintze, S. Michaylov, P.J. Stuckey, and R.H.C. Yap.
Metaprogramming in CLP(R).
Journal of Logic Programming, 33(3):221259, 1997.
[PDF]

P.J. Stuckey and S. Sudarshan.
Well founded ordered search: Goaldirected bottomup evaluation of
wellfounded models.
Journal of Logic Programming, 32(3):171205, 1997.
1996

D.B. Kemp and P.J. Stuckey.
Optimizing bottomup evaluation of constraint queries.
Journal of Logic Programming, 26(1):130, 1996.

D.B. Kemp, D. Srivastava, and P.J. Stuckey.
Bottomup evaluation and query optimization of wellfounded models.
Theoretical Computer Science, 146(12):145184, 1995.
1995

P.J. Stuckey.
Negation and constraint logic programming.
Information and Computation, 118(1):1233, 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(14):197212, 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:449469, 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):339395, 1992.
[ACM]

K. Kanchanasut and P.J. Stuckey.
Transforming normal logic programs to constraint logic programs.
Theoretical Computer Science, 105:2756, 1992.

N.C. Heintze, S. Michaylov, and P.J. Stuckey.
CLP(R) and some electrical engineering problems.
Journal of Automated Reasoning, 9:231260, 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):3752, 1991.

P.J. Stuckey.
Incremental linear constraint solving and detection of implicit
equalities.
ORSA Journal of Computing, 3(4):269274, 1991.
1989

J.N. Crossley, P. Lim, and P.J. Stuckey.
Interface logic programming.
Australian Computer Journal, 21(2):4955, 1989.
1986

J. Jaffar and P.J. Stuckey.
Canonical logic programs.
Journal of Logic Programming, 3(2):143155, 1986.

J. Jaffar and P.J. Stuckey.
Semantics of infinite tree logic programming.
Theoretical Computer Science, 42(4):141158, 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 56. 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 1921. 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 59. 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 125. 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 913. 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 1316. 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
380394. SpringerVerlag. 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, 4766, 2002.
[Postscript]
Conference Publications
2017

Elvira Albert, Puri Arenas, Maria Garcia de la Banda, Miguel GomezZamolloa, and Peter J. Stuckey. Context sensitive dynamic partial order reduction. In Proceedings of the Computer Aided Verification, 29th International Conference, LNCS, pages 526543. 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 340349. 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 113130. Springer, 2017.
[PDF]

Nicolas Beldiceanu, Mats Carlsson, Alban Derrien, Charles Prud'Homme, Andreas Schutt, and Peter J. Stuckey. Rangeconsistent forbidden regions of Allens relations. In Fourteenth International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, LNCS 10335, pages 2129. 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 4157, 2017.
[PDF]

Toby Davies, Graeme Gange, and Peter J. Stuckey. Automatic logicbased benders decomposition with MiniZinc. pages 787793. 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 288296, 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 480488, 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 4965. 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 224233. 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 484454. 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 157172. 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 189206. Springer, 2016.
[PDF]

Thorsten Ehlers and Peter J. Stuckey. Parallelizing constraint programming with learning. In ClaudeGuy Quimper, editor, Thirteenth International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, LNCS 9676, page pages 142158, 2016.
[PDF]
 Wenxi Wang, Harald Sondegaard, and Peter J. Stuckey. A bitvector solver with word level propagation. In ClaudeGuy Quimper, editor, Thirteenth International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, LNCS 9676, pages 374391, 2016.
[PDF]
 Diego de Una, Graeme Gange, Peter Schacte, and Peter J. Stuckey. Weighted spanning tree constraint with explanations. In ClaudeGuy Quimper, editor, Thirteenth International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, LNCS 9676, pages 98107, 2016.
[PDF]
 Ignasi Abio, Graeme Gange, Valentin MayerEichberger, and Peter J. Stuckey. On CNF encodings for decision diagrams. In ClaudeGuy Quimper, editor, Thirteenth International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, LNCS 9676, pages 117, 2016.
[PDF]
 Geoffrey Chu and Peter J. Stuckey. Lagrangian decomposition via subproblem search. In ClaudeGuy Quimper, editor, Thirteenth International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, LNCS 9676, pages 6580, 2016.
[PDF]
 Daniel Harabor and Peter J. Stuckey. Rail capacity planning with constraint programming. In ClaudeGuy Quimper, editor, Thirteenth International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, LNCS 9676, pages 170186, 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 85103. 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 (AAAI16), pages 33833389, 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 85103. Springer, 2015.
[PDF]

Ignasi Abo, Valentin MayerEichberger, 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 311. Springer, 2015.
[PDF]

Andrea Rendl, Tias Guns, Peter J. Stuckey, and Guido Tack. MiniSearch: a solverindependent metasearch language for MiniZinc. In Gilles Pesant, editor, Proceedings of the 21st International Conference on Principles and Practice of Constraint Proxgramming, LNCS 9255, pages 376392. 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 262278. 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 655670. 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 6169, 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 11411149. 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 91107. 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 108123. Springer, 2015.
[PDF]
[DOI]

Graeme Gange, Jorge Navas, Peter Schachte,
Harald Sondergaard, and Peter J. Stuckey,
A Tool for Intersecting ContextFree Grammars and Its
Applications.
In NASA Formal Methods:
Proceedings of the Seventh International Symposium,
LNCS 9058, pages 422428,
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 PostConference Proceedings of the
24th International Symposium on LogicBased Program Synthesis
and Transformation, LNCS 8981, pages 320.
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 (AAAI15).
pages 34683474.
[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 7591. 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 340355. 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 240255. 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 108124. 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 636645. 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 1922, Vienna, Austria, page 15.
Cambridge University Press, 2014. Supplementary material to the Introduction to Theory and Practice of Logic Programming / Volume 14 / Special Issue 45 / July 2014, pp 401414.
[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, 3137. 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 88103. 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 159175. 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 404412, 2014.
[PDF]

Toby Davies, Adrian Pearce, Peter J. Stuckey, and Harald Sondegaard.
Fragmentbased planning using column generation.
In S. Chien and A. Fern, editors, Proceedings of the 24th
International Conference on Automated Planning and Scheduling,
pages 8391, 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 510516. AAAI
Press, 2013.
[PDF]

Rafael Caballero, Peter J. Stuckey and Antonio TenoriaFornes.
Finite Type Extensions in Constraint Programming.
In, editor T. Schrijvers, Proceedings of the 15th International Symposium on
Principles and Practice of Declarative Programming
pages 217228, 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 217229, 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 315330, 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 628644, Springer, 2013
[PDF]
[DOI]

Ignasi Abio, Robert Nieuwenhuis, Albert Oliveras, Enric RodriguezCarbonell,
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 97106, Springer, 2013
[PDF]
[DOI]

Graeme Gange, Peter J. Stuckey, and Pascal Van Hentenryck.
Explaining propagators for edgevalued decision diagrams.
In Proceedings of the 19th International Conference on
Principles and Practice of Constraint Programming.
LNCS 8124, pages 340355, Springer, 2013
[PDF]
[DOI]

Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Sondergaard, and
Peter J. Stuckey.
Abstract interpretation over nonlattice abstract domains.
In F. Logozzo and M. Fahndrich, editors, Proceedings of the 20th
Static Analysis Symposium, LNCS 7935, pages 624. 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 215230. Springer, 2013.
[DOI]
[PDF]

Hanyu Gu, Andreas Schutt, and Peter J. Stuckey. A Lagrangian relaxation based forwardbackward improvement heuristic for maximising the net present value of resourceconstrained 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 340346. 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 268283. Springer, 2013.
[PDF]
 Andreas Schutt, Thibaut Feydy, and Peter J. Stuckey. Explaining timetableedgefinding 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 234250. Springer, 2013.
[PDF]

Graeme Gange, Jorge A. Navas, Peter J. Stuckey, Harald Sondergaard, and Peter Schachte. Unbounded modelchecking 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 279293. Springer, 2013.
[PDF]

Rehan Abdul Aziz, Peter J. Stuckey and Zoltan Somogyi.
Inductive definitions in constraint programming.
In Proceedings of the
ThirtySixth Australasian Computer Science Conference (ACSC 2013), page 4150, 2013.
[PDF]
2012

J. A. Navas, P. Schachte, H. Sondergaard, and P. J. Stuckey.
Signednessagnostic program analysis:
Precise integer bounds for lowlevel 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 115130.
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 7085. LNCS 7514. Springer, 2012.
[PDF]

G. Chu and P.J. Stuckey.
Interinstance nogood learning in constraint programming.
In M. Milano, editor, Proceedings of the 18th International
Conference on Principles and Practice of Constraint Programming, pages 238247. 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 622. 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 resourceconstrained
projects.
In M. Milano, editor, Proceedings of the 18th International
Conference on Principles and Practice of Constraint Programming, pages 767781. 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 274289. 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 5164. Springer,
2012.

G. Gange, K. Marriott, and P.J. Stuckey.
Optimal guillotine layout.
In Proceedings of the 12th International Symposium on Document
Engineering, page 1322. 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 48, 2012, Hungary, Budapest,
volume 12 of LIPIcs, page 117127. Schloss Dagstuhl  LeibnizZentrum
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 104119.
Springer, 2012.
[DOI]
[PDF]

N. Downing, T. Feydy, and P.J. Stuckey.
Explaining flowbased 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 146162. Springer, 2012.
[DOI]
[PDF]

A. Schutt, G. Chu, P.J. Stuckey, and M. Wallace.
Maximizing the netpresentvalue 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 363378. Springer, 2012.
[DOI]
[PDF]

G. Gange and P.J. Stuckey.
Explaining propagators for sDNNF 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 195210. 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 115124, 2012.
[PDF]
2011
 T. Feydy, Z. Somogyi, and P.J. Stuckey. Halfreification and flattening. In J.H.M. Lee, editor, Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming, LNCS, pages 286301. Springer, 2011.
[DOI]
[PDF]
 A. Metodi, M. Codish, V. Lagoon, and P.J. Stuckey. Boolean equipropagation 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 621636. 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 774788. 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 6984. Springer, 2011.
[DOI]
[PDF]
Runner Up, Best Application Paper Award: CP 2011
 L. De Koninck, S. Brand, and P.J. Stuckey. Constraints in nonboolean contexts. In Technical Communications of the 27th International Conference on Logic Programming, ICLP 2011, July 610, 2011, Lexington, Kentucky, USA, volume 11 of LIPIcs. Schloss Dagstuhl  LeibnizZentrum 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 2032, 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 6885, 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 516521, 2011.
[PDF]
 I. Abio, M. Deters, R. Nieuwenhuis, and P.J. Stuckey. Reducing chaos in SATlike 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 273286. Springer, 2011.
[DOI]
[PDF]
 G. Gange, K. Marriott, and P.J. Stuckey.
Optimal klevel planarization and crossing minimization.
In Proceedings of 17th International Symposium on Graph Drawing, volume 6695 of LNCS, pages 238249. 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 7186. 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 5155. 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 219231.
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 6169, 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 746761. SpringerVerlag, 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 242257. SpringerVerlag, 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 258273. SpringerVerlag, 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 352366. SpringerVerlag,
2009.
LNCS,
[PDF]

G. Chu, C. Schulte, and P.J. Stuckey. Confidencebased 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 226241. SpringerVerlag, 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 367382. SpringerVerlag, 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 692706. SpringerVerlag, 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 255266. ACM Press, 2009.
[PDF]

L. De Koninck, G. Duck, and P.J. Stuckey. Demanddriven normalisation for ACD
term rewriting. In Proceedings of the 25th International Conference on Logic Programming.
LNCS, page 484488. 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 531545.
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 332346. 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 749753. 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 constraintbased cooperative
layout. In C. North and S. Carpendale, editors, Proceedings of IEEE Information
Visualization Conference 2008, pages 12931300, 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
505509, 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 4559. 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 247257, 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 226235, 2008.
[PDF]
[ACM]

J. Puchinger, P.J. Stuckey, M. Wallace, and S. Brand. From highlevel model to branchand
price solution in G12. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, volume 5015 of LNCS, pages
218232. 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 3247 . 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 3948, 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 2738, 2008.
[PDF]

J. Puchinger and P.J. Stuckey.
Automating branchandbound 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, rulebased constraint model linearisation.
In P. Hudak and D.S. Warren, editors, Proceedings of Tenth
International Symposium on Practical Aspects of Declarative Languages
, LNCS, pages 6883. SpringerVerlag, 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, 544558. SpringerVerlag, 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, 529543. SpringerVerlag, 2007.
LNCS,
[PDF]
 S. Brand, N. Narodytska, CG. 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,
210224. SpringerVerlag, 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, 224239. SpringerVerlag, 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 consecutiveones property. In Proceedings of CPAIOR'07, LNCS 4510,
page 115. SpringerVerlag, 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 306310.
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 334335.
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 4958, 2006.
[PDF]
[LNCS]
 M. Sulzmann, T. Schrijvers, and P.J. Stuckey. Principal type inference for GHC
style multiparameter type classes. In N. Kobayashi, editor, Proceedings of the Fourth
ASIAN Symposium on Programming Languages and Systems (APLAS 2006), number
4279 in LNCS, page 2643. SpringerVerlag, 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 117131. SpringerVerlag, August 2006.
[PDF]
[LNCS]
 R. Muhammed and P.J. Stuckey.
A stochastic nonCNF SAT solver.
In Q. Yang and G. Webb, editors, 9th Biennial Pacific Rim International Conference on Artificial Intelligence (PRICAI 2006),
LNCS 4099,
page 120129. SpringerVerlag, 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 418. SpringerVerlag, August 2006.
[PDF]
LNCS

M. Codish, V. Lagoon, and P.J. Stuckey.
Sizechange termination analysis in kbits.
In P. Sestoft, editor,
Proceedings of European Symposium on Programming,
number 3924 in LNCS, pages 230245. SpringerVerlag, 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 4764
SpringerVerlag, 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 103117. 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 118133. 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 446457.
SpringerVerlag, 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 153164. 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 326340. 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 218229, 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 174186. SpringerVerlag, 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 706717. SpringerVerlag, 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 7889. 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 105119.
SpringerVerlag, 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 120136.
SpringerVerlag, 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 347361.
SpringerVerlag, 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 619633.
SpringerVerlag, 2004.
[Postscript]

G.J. Duck, S. PeytonJones, 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 4963. SpringerVerlag, 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 7283. 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 247260, 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 9499, 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 212229. SpringerVerlag,
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 192201, 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 254268. SpringerVerlag, 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
229243. SpringerVerlag, 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
214228. SpringerVerlag, 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 3243. 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 207231,
SpringerVerlag, 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 7990. 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, 2833
2002.
AAAI proceedings page
[PDF]

V. Lagoon and P. J. Stuckey.
Precise pairsharing analysis of logic programs.
In C. Kirchner, editor, Proceedings of the Fourth International
Conference on Principles and Practice of Declarative Programming,
99108. 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,
121132. ACM Press, 2002.
ACM page
[Postscript]
[ACM]

D. Overton, Z. Somogyi, and P. J. Stuckey.
Constraintbased mode analysis of mercury.
In C. Kirchner, editor, Proceedings of the Fourth International
Conference on Principles and Practice of Declarative Programming,
109120. ACM Press, 2002.
ACM page
[ACM]

K. Glynn, P. J. Stuckey, M. Sulzmann, and H. Sondergaard.
Exception Analysis for NonStrict Languages
In S. PeytonJones, editor, Proceedings of the International
Conference on Functional Programming, ACM Press, 98109, 2002.
ACM page
[ACM]

P. J. Stuckey and M. Sulzmann.
A theory of overloading.
In S. PeytonJones, editor, Proceedings of the International
Conference on Functional Programming, ACM Press, 167178, 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 167176, January 2002.
[Postscript]

L. Zheng and P.J. Stuckey.
Improving SAT using 2SAT.
In Proceedings of the 25th Australasian Computer Science
Conference, page 331340, 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 7489. SpringerVerlag, 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 90104. SpringerVerlag, 2001.
[Postscript]

S. Genaim, M. Codish, H. Sondergaard, and P.J. Stuckey.
Beyond Pos: Highprecision groundness and uniqueness analysis.
In P. Codognet, editor, Logic Programming: Proceedings of the
17th International Conference, LNCS, pages 135149. SpringerVerlag, 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 361374. SpringerVerlag, 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 115126.
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 7392, 2001.
[Postscript]

K. Ross, I. Sitzmann, and P.J. Stuckey.
Costbased unbalanced Rtrees.
In Proceedings of the Thirteenth International Conference on
Scientific and Statistical Database Management, page 203212,
IEEE Press, 2001.
[Postscript]

K. Glynn, M. Sulzmann, P.J. Stuckey, and H. Sondergaard.
Boolean constraints for bindingtime analysis.
In O. Danvy and A. Filinski, editors, Proceedings of the Second
Symposium on Programs as Data Objects, LNCS 2053, pages
3692, 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 296310, 2001.
[Postscript]
[DOI]

F. Bueno, M. Garcia de la Banda, M. Hermenegildo, K. Marriott, G. Puebla, and
P. Stuckey.
A model for intermodule analysis and optimizing compilation.
In KungKiu Lau, editor, Tenth International Workshop on
Logicbased Program Synthesis and Transformation, LNCS 2042,
pages 86102. SpringerVerlag, 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 488498,
2000. SpringerVerlag.
[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,
12701284.
SpringerVerlag, July 2000.
[Postscript]

I. Sitzmann and P.J. Stuckey.
Otrees: a constraint based index structure.
In M. Orlowska, editor, Proceedings of the Eleventh Australasian
Database Conference (ADC2000),
pages 127135. 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 7382. 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 260274. 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.
SpringerVerlag, pages 174188, October 1999.
[Postscript]

R. Lin, K. Marriott, and P.J. Stuckey.
Flexible fontsize specification in web documents.
In J. Edwards, editor, Proceedings of the 22nd Australian
Computer Science Conference, pages 1526. SpringerVerlag, 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 adhoc polymorphism.
In J. Edwards, editor, Proceedings of the 22nd Australian
Computer Science Conference, pages 217228. SpringerVerlag, 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 166175. IEEE Press, November
1998.
[Postscript]

W. Harvey and P.J. Stuckey.
Constraint representation for propagation.
In M. Maher and JF. Puget, editors, Proceedings of the Fourth
International Conference on Principles and Practices of Constraint
Programming, LNCS, pages 235249. SpringerVerlag, October 1998.
[Postscript] (fuller version)

V. Tam and P.J. Stuckey.
An efficient heuristicbased evolutionary algorithm for solving
constraint satisfaction problems.
In Proceedings of the Intelligence in Neural and Biological
Systems Conference, pages 7582, 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 107112, 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 491505. SpringerVerlag, 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 8796. 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 301315, 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 93107, 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 102111, 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 92101, 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 4352, Singapore, December 1996.
SpringerVerlag.
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
423437, Aachen, Germany, September 1996. SpringerVerlag.
Springer Online

R. Johnston, A. Moffat, H. Sondergaard, and P.J. Stuckey.
Lowcontact learning in a first year programming course.
In J. Rosenberg, editor, Proceedings of the First Australasian
Conference on Computer Science Education, pages 1926. 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 3751, 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.
Costbased magic optimization: Algebra and implementation.
In Proceedings of the ACM SIGMOD Conference on Management of
Databases, pages 435446, 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 174183, 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 41743, Portland, Oregon, December 1995. MIT Press.
[PDF]

D.B. Kemp, P.J. Stuckey, and K. Ramamohanarao.
ELSprograms and the efficient evaluation of nonstratified
programs by transformation to ELS.
In Proceedings of the Fourth International Conference on
Deductive and ObjectOriented Databases, number 1013 in LNCS, pages 91108,
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 222239, 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 797814, 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 3348, 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 8693, Orcas
Island, Washington, May 1994. SpringerVerlag.
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 94104,
Orcas Island, Washington, May 1994. SpringerVerlag.
Springer Online

P.J. Stuckey and S. Sudarshan.
Compiling query constraints.
In Proceedings of the ACM SIGMOD Symposium on Principles of
Database Systems, pages 5667, 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 571585, 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 551560, 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 161172, Bombay, India, December 1993. SpringerVerlag.
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 7593, 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 666682, 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 334344, Charleston, South Carolina, 1993.
[ACM]
1992

D.B. Kemp, D. Srivastava, and P. J. Stuckey.
Query restricted bottomup evaluation of normal programs.
In K. Apt, editor, Logic Programming: Proceedings of the 1992
Joint International Conference and Symposium, pages 288302, 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 128139, 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 987995, 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 387404, San Diego.
California, October 1991.
[PDF]

D.B. Kemp, D. Srivastava, and P.J. Stuckey.
Magic sets and bottom up computation of wellfounded models.
In V. Saraswat and K. Ueda, editors, Logic Programming:
Proceedings of the 1991 International Symposium, pages 337354, 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 328341, Amsterdam, 1991.

P.J. Stuckey.
A new approch to constructive negation.
In Proceedings of the 14th Australian Computer Science
Conference, pages 20.120.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 240247, 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 217231. SpringerVerlag, 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
7588. SpringerVerlag, 1990.

P. Lim and P.J. Stuckey.
Metaprogramming as constraint programming.
In S. Debray and M. Hermengildo, editors, Logic Programming:
Proceedings of the 1990 North American Conference, pages 406420, 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 5268, 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 2036, 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 675703, 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 314326, London, U.K.,
July 1986. SpringerVerlag.
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]