Research interests
My research interests are available here.
Publications
Journal papers
Peter Nightingale,
Non-binary Quantified CSP: Algorithms and Modelling,
To appear in Constraints.
Ian P. Gent and Ian Miguel and Peter Nightingale,
Generalised Arc Consistency for the AllDifferent Constraint: An Empirical Survey,
Artificial Intelligence, Volume 172 number 18, pages 1973-2000, 2008.
Ian P. Gent, Peter Nightingale, Andrew Rowley and Kostas Stergiou,
Solving Quantified Constraint Satisfaction Problems,
Artificial Intelligence, Volume 172, pages 738–771, 2008.
Ian P. Gent, Christopher Jefferson, Tom Kelsey, Inês Lynce, Ian Miguel, Peter Nightingale and Barbara M. Smith,
Search in the Patience Game "Black Hole",
AI Communications, Volume 20, Number 3, pages 211-226, 2007.
Alan M. Frisch, Timothy J. Peugniez, Anthony J. Doggett and Peter Nightingale,
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings,
Journal of Automated Reasoning, SAT 2005 special edition, 2005.
Iain Bate, John McDermid and Peter Nightingale,
Establishing Timing Requirements for Control Loops in Real-Time Systems,
Journal of Microprocessors and Microsystems, 27(4), 159-169, 2003.
Conference papers
Sophie Huczynska, Paul McKay, Ian Miguel and Peter Nightingale,
Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics,
in Proceedings of Principles and Practice of Constraint Programming (CP 2009).
Ian P. Gent, Christopher Jefferson, Ian Miguel and Peter Nightingale,
Data Structures for Generalised Arc Consistency for Extensional Constraints, (slides)
in Proceedings of the Twenty Second Conference on Artificial Intelligence (AAAI-07), 191-197, 2007.
Ian P. Gent, Peter Nightingale and Kostas Stergiou,
QCSP-Solve: A Solver for Quantified Constraint Satisfaction Problems,
in Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), 2005.
Peter Nightingale,
Consistency for Quantified Constraint Satisfaction Problems,
Poster and short paper in Proceedings of the 11th International Conference on
Principles and Practice of Constraint Programming (CP 2005), pages 792-796, 2005.
Ian P. Gent, Peter Nightingale and Andrew Rowley,
Encoding Quantified CSPs as Quantified Boolean Formulae,
(slides)
in Proceedings of the 16th European Conference on Artificial Intelligence (ECAI 2004), pages 176-180, 2004.
Iain Bate, Peter Nightingale and Anton Cervin,
Establishing Timing Requirements and Control Attributes for Control Loops in Real-Time Systems,
in Proceedings of the 15th Euromicro Conference on Real-Time Systems, 121-128, 2003.
Workshop papers
Ian P. Gent, Paul McKay, Ian Miguel, Peter Nightingale and Sophie Huczynska
Modelling Equidistant Frequency Permutation Arrays in Constraints,
to appear in Proceedings of the Eighth Symposium on Abstraction, Reformulation and Approximation (SARA 2009).
Peter Nightingale,
Consistency for Quantified Constraint Satisfaction Problems,
(slides)
in Proceedings of 1st Workshop on Quantification in Constraint Programming, Kostas Stergiou (ed), 2005.
Ian P. Gent and Peter Nightingale,
A New Encoding of AllDifferent into SAT,
in Proceedings 3rd International Workshop on Modelling and
Reformulating Constraint Satisfaction Problems, CP2004, Toronto, Canada, Frisch, AM, Miguel, I (eds), pages 95-110, 2004.
Submitted papers
Thesis
Thesis (corrected version) available here.
Talks
Invited talk at ACP Summer School 2008
(slides)
Software
Queso is a non-binary QCSP solver written in Java for my PhD. The source code is available on the
basis that it is unsupported, but I may be able to help with some simple problems. (There is a timing
component written in C for Linux, but this can probably be easily removed if you wish to run it on
other systems.)
queso-15-9-08.tgz
|
