Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456

Peter J. Stuckey's Publication List

(Always out of date)

In Press

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, page to appear, 2008. [PDF]
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, page to appear, 2008. [PDF]
G. Chu, A. Harwood, and P.J. Stuckey. Cache Conscience Data Structures for Boolean Satisfiability Solvers. Submitted [PDF]
T. Feydy and P.J. Stuckey. Propagating systems of dense linear integer constraints. Constraints, page to appear, 2008. [PDF]
C. Schulte and P.J. Stuckey. Efficient constraint propagation engines. To appear in ACM TOPLAS [PDF]
K. Marriott, N. Nethercote, R. Rafeh, P.J. Stuckey, M. Garcia de la Banda, and M. Wallace. The Zinc modelling language. Constraints, page to appear, 2008. [PDF]
N. Boland, B. Hughes, L. Merlot, and P.J. Stuckey. New integer linear programming approaches for course timetabling. Computers and Operations Research, page to appear, 2008. [PDF]

Books Authored

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

Books Edited

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

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

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.
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]
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]
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.
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]
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]
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]
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.
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]
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]
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]
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 [Postscript]
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
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]
V. Tam and P.J. Stuckey. Improving evolutionary algorithms for efficient constraint satisfaction. The International Journal on Artificial Intelligence Tools, 8(2), 1999. [Postscript]
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]
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.
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.
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]
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.
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.
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.
P.J. Stuckey. Negation and constraint logic programming. Information and Computation, 118(1):12--33, 1995. Postscript TR
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
J. Jaffar, M. Maher, P.J. Stuckey, and R.H.C. Yap. Projecting CLP(R) constraints. New Generation Computing, 11:449--469, 1993.
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.
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.
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.
J.N. Crossley, P. Lim, and P.J. Stuckey. Interface logic programming. Australian Computer Journal, 21(2):49--55, 1989.
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

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

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]
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]
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]
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]
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
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
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]
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]
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]
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]
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]
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]
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]
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]
P.J. Stuckey, M. Sulzmann, and J. Wazny. The Chameleon type debugger (tool demonstration). In M. Ronsse, editor, Proceedings of the Fifth International Work- shop 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.
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.
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]
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]
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]
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
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]
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]
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
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
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]
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]
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]
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]
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]
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]
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]
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]
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.