Research
Until recently I was a research student at the University of York, supervised by Alan Frisch and Toby Walsh. My main research interest was combining inference and backtracking search for propositional satisfiability (SAT) algorithms, hopefully resulting in a DPhil thesis before too long. I was a member of the Artificial Intelligence Group in the Computer Science Department at York, as well as a member of the inter-university APES research group.
Publications
Most of these papers are in PDF format, with a few PS files thrown in for good measure.
Conference publications:
- L. Drake and A. M. Frisch. The Interaction Between Inference and Branching Heuristics. In Proceedings of the Sixth International Conference on the Theory and Applications of Satisfiability Testing (SAT 03), Lecture Notes in Computer Science. Springer, 2003 (not yet published).
Workshop publications:
- L. Drake, A. M. Frisch, I. Gent and T. Walsh. Automatically reformulating SAT-encoded CSPs. In Proceedings of the International Workshop on Reformulating Constraint Satisfaction Problems, CP 2002, September 2002.
- L. Drake, A. M. Frisch and T. Walsh. Automatic generation of implied clauses for SAT. In P. Van Hentenryck (Ed.), Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming (CP 2002), Lecture Notes in Computer Science 2470, page 783. Springer, September 2002. (Also available: doctoral programme abstract.)
- L. Drake, A. M. Frisch and T. Walsh. Combining inference and search for the propositional satisfiability problem. In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI 02), Doctoral Consortium, July 2002.
- L. Drake, A. M. Frisch and T. Walsh. Adding resolution to the DPLL procedure for Boolean satisfiability. In Proceedings of the Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT 2002), Cincinnati, 2002.
- L. Drake, A. M. Frisch, I. Lynce, J. Marques-Silva and T. Walsh. Comparing SAT preprocessing techniques. In Proceedings of the 9th Workshop on Automated Reasoning (ARW 02), 2002.
- L. Drake, A. M. Frisch and T. Walsh. Automatic Generation of Implied Clauses for SAT. In T. Walsh (Ed.), Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming (CP 2001), Doctoral Programme, Lecture Notes in Computer Science 2239, page 761. Springer, 2001. (Also available: doctoral programme abstract.)
- S. Colton, L. Drake, A. M. Frisch, I. Miguel and T. Walsh. Automatic generation of implied constraints: Initial progress. In Proceedings of the 8th Workshop on Automated Reasoning (ARW 01), pages 17—18, 2001. (Also available: poster.)
Presentations
These talks are either in PDF or Powerpoint.
Invited talks:
- Inference and search for the propositional satisfiability problem. Presentation at the Department of Computer Science, University of Wales, Swansea, on July 01, 2003.
- Using inference to improve search on SAT problems. Presentation at the Department of Computer Science, University of Auckland, New Zealand, on May 31, 2002.
- Combining inference with search for SAT. Presentation at the SAT Group, INESC, Informatics Department, Instituto Superior Tecnico, Universidade Tecnica de Lisboa, on February 18, 2002.
Conference and workshop presentations:
- The interaction between inference and branching heuristics. Presented at the Sixth International Conference on the Theory and Applications of Satisfiability Testing, in May 2003.
- Automatically reformulating SAT-encoded CSPs. Presented at the International Workshop on Reformulating Constraint Satisfaction Problems, in September 2002.
- Using inference to improve search on SAT problems. Presented at the Doctoral Programme of the Eighth International Conference on Principles and Practice of Constraint Programming, in September 2002.
- Using inference to improve search on SAT problems. Presented at the Doctoral Consortium of the Eighteenth National Conference on Artificial Intelligence, July 2002.
- Adding resolution to the DPLL procedure for Boolean satisfiability. Presented at the Fifth International Symposium on the Theory and Applications of Satisfiability Testing , in May 2002.