Andrew J. Parkes

I am interested in optimization and search in general, with an emphasis on scheduling and constraint-based planning.

Publications in Artificial Intelligence

• Scaling Properties of Pure Random Walk on Random 3-SAT
  Andrew J. Parkes.
  Proceedings of Eighth International Conference on Principles and Practice of Constraint Programming (CP 2002)
  Lecture Notes in Computer Science, LNCS 2470, pp. 708-713, 2002.
  abstract

• Likely Near-term Advances in SAT Solvers
  Heidi E. Dixon, Matthew L. Ginsberg, and Andrew J. Parkes.
  Workshop on Microprocessor Test and Verification (MTV'02). Held in Austin, Texas, USA. June, 2002.
  Postscript PDF

• Easy Predictions for the Easy-Hard-Easy Transition
  Andrew J. Parkes.
  Proceedings of The Eighteenth National Conference on Artificial Intelligence (AAAI-2002)
  Postscript PDF

• Exploiting Solution Clusters for Coarse-grained Distributed Search
  Andrew J. Parkes.
  In the Workshop Distributed Constraint Reasoning at the International Joint Conference on Artificial Intelligence (IJCAI-01)
  Abstract Postscript PDF

• Distributed Local Search, Phase Transitions, and Polylog Time
  Andrew J. Parkes.
  In the Workshop "Stochastic Search Algorithms" at the International Joint Conference on Artificial Intelligence (IJCAI-01)
  Abstract Postscript PDF

• Universally Quantified Constraints for Planning
  Andrew J. Parkes.
  (Poster presentation)
  Proceedings of the Nineteenth Workshop of the UK Planning and Scheduling Special Interest Group (PLANSIG 2000).
  Postscript PDF

• Satisfiability Algorithms and Finite Quantification.
  Matthew L. Ginsberg and Andrew J. Parkes
  In Proceedings of KR-2000
  Abstract Postscript PDF citeseer

• Worldwide Aeronautical Route Planner.
  Charles B. McVey, David P. Clements, Barton C. Massey, and Andrew J. Parkes
  (Intelligent Systems Demonstration)
  Proceedings of AAAI/IAAI 1999, pages 916-917.
  Includes a brief description of the "Multi-pass A*" that I developed.
  Postscript PDF (Note: page length changed due to printer-dependent formatting on .doc to .ps conversion)

• Lifted Search Engines for Satisfiability.
  Andrew J. Parkes
  Ph.D. dissertation. Submitted to the University of Oregon, June 1999.
  Start at at the Quantified Propositional Logic section of the CIRL Research overview for a quick description of this area of research.
  Abstract
  Gzip'ed postscript (290kB) in format as required by the graduate school.
  Gzip'ed postscript (330kB) Postscript (1.5MB) reformatted into a technical report style. Recommended as it is far more compact for printing, and also more readable (IMHO). The contents and all section/chapter/figure numbers are unchanged, only the page numbers are different.
  

• Supermodels and Robustness
  Matthew L. Ginsberg, Andrew J. Parkes and Amitabha Roy
  In Proceedings of AAAI-98
  Postscript PDF

• Clustering at the Phase Transition
  Andrew J. Parkes.
  In Proceedings of AAAI-97 Providence RI, USA.
  Abstract Postscript (gzip'ed)

• Tuning Local Search for Satisfiability Testing.
  Andrew J. Parkes and Joachim P. Walser.
  Describes a method to tune the Maxflips parameter of local search. Gives experimental results for the scaling of the performance of WSAT on random 3SAT at crossover. In Proceedings of AAAI-96, Portland, Oregon, USA.
  Postscript (gzip'ed)

• Generator Induction for Relational Proofs, Logic Program Synthesis and Reasoning About Database Systems
  Andrew J. Parkes
  Masters Thesis, 1994, Department of Artificial Intelligence, University of Edinburgh
  Abstract

Some Bibtex entries (with abstracts)

Other Interests

Other Information

I joined CIRL as a student in October 1994. I graduated in June 1999 and since then I have been a member of the faculty.

Before moving into artificial intelligence, I was a physicist working in the area of supersymmetry (e.g. often with Peter West) and superstrings (e.g. papers with Olaf Lechtenfeld). Try doing "FIND AUTHOR ANDREW PARKES" at SPIRES. If lucky, this link might do it for you. Or for the citation summary, click here.

Contact Information

Email: parkes 'at' cirl.uoregon.edu (attempting to avoid spammers)

Please feel free to email to request papers not already online.

The URL for this page is http://www.cirl.uoregon.edu/parkes/
Last modified 2003-05-11.