Research Information about Justin Pearson

My current research is mainly concerned with Constraint Satisfaction. I am currently studying symmetry in constraint satisfaction as well as CSP techniques applied to local search. In the past I have worked on Model checking and Neural Networks.

Unrefereed Publications

These are either preprints or technical reports that are extended versions of published work, or things that I don't intend to publish that might be interesting.

• A Complete Classification of Constraint Languages gnereated by binary entropic minimal clones. After writing this paper I found that the result had been proved elsewhere. The paper might still be of some interest serving as an introduction to the classifaction of the complexity of constraint languages.

• M. Ågren, P. Flener, and J. Pearson. Inferring variable conflicts for local search from high-level models. Technical Report 2006-005 at Department of Information Technology, Uppsala University, Sweden, February 2006. Link (Summarised by the CP06 paper).

• P. Flener, J. Pearson, and M. Ågren. The syntax, semantics, and type system of ESRA. ASTRA Research Report, April 2003. (Postscript)

• Symmetry in Matrix Models a version of this avaliable as a technical report , see also the SymCon'01 workshop.

• A Survey of Tractable Constraint Satisfaction ProblemsTechnical Report CSD-TR-97-15 July 1997, Royal Holloway University of London. Google Scholar Cited by

• Reducing The Number of Constraints in Symmetry Breaking During Search

Constraint satisfaction and its applications

Some papers and technical reports avaliable on line.

• K. Sundequist Blomdahl, P. Flener, and J. Pearson. Contingency plans for air traffic management. In: D. Cohen (editor), Proceedings of CP'10, pages ppp-qqq. Lecture Notes in Computer Science, volume XXXX. © Springer-Verlag, 2010. (Preprint)

• N. Beldiceanu, M. Carlsson, P. Flener, and J. Pearson. On matrices, automata, and double counting. In: A. Lodi, M. Milano, and P. Toth (editors), Proceedings of CP-AI-OR'10, pages 10-24. Lecture Notes in Computer Science, volume 6140. © Springer-Verlag, 2010. (PDF)

• T. Mancini, P. Flener, A. Hossein Monshi, and J. Pearson. Constrained optimisation over massive databases. In: M. Gavanelli and T. Mancini (editors), Proceedings of RCRA'09, the 16th RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2009. (PDF)

• J. He, P. Flener, and J. Pearson. Toward an automaton constraint for local search. In: Y. Deville and Ch. Solnon (editors), Proceedings of LSCS'09, the 6th International Workshop on Local Search Techniques in Constraint Satisfaction. Electronic Proceedings in Theoretical Computer Science, Volume 5, pp. 13-25, 2009. (PDF) Also in: M. Gavanelli and T. Mancini (editors), Proceedings of RCRA'09, the 16th RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2009.

• F. Hassani Bijarbooneh, P. Flener, and J. Pearson. Dynamic demand-capacity balancing for air traffic management using constraint-based local search: First results. In: Y. Deville and Ch. Solnon (editors), Proceedings of LSCS'09, the 6th International Workshop on Local Search Techniques in Constraint Satisfaction. Electronic Proceedings in Theoretical Computer Science, Volume 5, pp. 27-40, 2009. PDF Also in: D. Schaefer (editor), Proceedings of INO'09, the 8th EuroControl Innovative Research Workshop & Exhibition, 2009. PDF

• P. Flener, J. Pearson, and M. Sellmann. Static and dynamic structural symmetry breaking. Annals of Mathematics and Artificial Intelligence, 57(1):37-57, September 2009. PDF

• P. Flener and J. Pearson. Solving necklace constraint problems. Journal of Algorithms, Journal of Algorithms, 64(2-3):61-73, April-July 2009. PDF

• P. Flener, J. Pearson, M. Sellmann, P. Van Hentenryck, and M. Ågren. Dynamic structural symmetry breaking for constraint satisfaction problems. Constraints, 14(4):506-538, December 2009. PDF

• M. Ågren, P. Flener, and J. Pearson. Revisiting constraint-directed search. Information and Computation 207(3):438-457, March 2009 PDF

• O. Sivertsson, P. Flener, and J. Pearson. A lower bound on the overlap of same-sized sets. Annals of Combinatorics 12(3):347-352, October 2008. PDF

• P. Flener, J. Pearson, and M. Sellmann. Static and dynamic structural symmetry breaking. Technical Report 2008-023 at Department of Information Technology, Uppsala University, Sweden, September 2008 PDF

• P. Flener and J. Pearson. Solving necklace constraint problems. In: M. Ghallab (editor), Proceedings of ECAI'08, pp. 520-524. IOS Press, 2008. PDF

• P. Flener, J. Pearson, M. Ågren, C. Garcia Avello, M. Çeliktin, and S. Dissing. Air-traffic complexity resolution in multi-sector planning. Journal of Air Transport Management 13(6):323-328, November 2007. PDF external link

• M. Ågren, P. Flener, and J. Pearson. Generic incremental algorithms for local search. Special Issue on Local Search Techniques for Constraint Satisfaction, Constraints 12(3):293-324, September 2007. External link PDF

• I.P. Gent, T. Kelsey, S. Linton, J. Pearson, and C. Roney-Dougal. Groupoids and conditional symmetry. In: Ch. Bessière (editor), Proceedings of CP'07, pp. 823-830. Lecture Notes in Computer Science, volume 4741. © Springer-Verlag, 2007. PDF external link PDF Original long version of the paper.

• P. Flener, J. Pearson, M. Ågren, C. Garcia Avello, M. Çeliktin, and S. Dissing. Air-traffic complexity resolution in multi-sector planning using constraint programming. In: Ch. Pusch and S. Saunders-Hodge (editors), Proceedings of ATM'07, the 7th USA/Europe R&D Seminar on Air Traffic Management. Barcelona, Spain, July 2007. PDF Proceedings link]) (slightly shorter version with permission in the JATM journal, November 2007)

• P.Flener, J. Pearson, L.G. Reyna, and O. Sivertsson. Design of financial CDO squared transactions using constraint programming. Constraints 12(2):179-205, April 2007. PDF external link PDF

• P. Flener, J. Pearson, M. Ågren, C. Garcia Avello, and M. Çeliktin. Air-Traffic Complexity Resolution in Multi-Sector Planning. Technical Report 2007-003 at Department of Information Technology, Uppsala University, Sweden, January 2007. PDF (summarised by the JATM and ATM'07 papers)

• P. Flener, J. Pearson, M. Sellmann, P. Van Hentenryck, and M. Ågren. Efficient structural symmetry breaking for constraint satisfaction problems. In: I.P. Gent and S. Linton (editors), Proceedings of the International Symmetry Conference. Edinburgh, UK, January 2007 (PDF)
• P. Flener, J. Pearson, M. Sellmann, and P. Van Hentenryck. Static and dynamic structural symmetry breaking. In: Frédéric Benhamou (editor), Proceedings of CP'06. Lecture Notes in Computer Science. © Springer-Verlag, 2006. (PDF) Published version Springer Link Google Scholar Cited by

• M. Ågren, P. Flener, and J. Pearson. Inferring variable conflicts for local search. In: Frédéric Benhamou (editor), Proceedings of CP'06. Lecture Notes in Computer Science. © Springer-Verlag, 2006. (PDF) Published version Springer link

• M. Ågren, P. Flener, and J. Pearson. Incremental algorithms for local search from existential second-order logic. In: P. van Beek (editor), Proceedings of CP'05, pp. 47-61. Lecture Notes in Computer Science, volume 3709. © Springer-Verlag, 2005. External link and (PDF)Google Scholar Cited by

• P. Van Hentenryck, P. Flener, J. Pearson, and M. Ågren. Compositional derivation of symmetries for constraint satisfaction. In: J.-D. Zucker and L. Saitta (editors), Proceedings of SARA'05, pp. 234-247. Lecture Notes in Artificial Intelligence, volume 3607. © Springer-Verlag, 2005. External link and (PDF) Google Scholar Cited by

• M. Ågren, P. Flener, and J. Pearson. Set variables and local search. In: R. Bartak and M. Milano (editors), Proceedings of CP-AI-OR'05, pp. 19-33. Lecture Notes in Computer Science, volume 3524. © Springer-Verlag, 2005. Externtal link and PDF

• P. Flener, J. Pearson, and L.G. Reyna. Financial portfolio optimisation. In: M.G. Wallace (ed), Proc. of CP'04, pp. 227-241. LNCS volume 3258. Springer-Verlag, 2004. Postscript

• P. Flener, J. Pearson, and M. Ågren. Introducing ESRA, a relational language for modelling combinatorial problems. In: M. Bruynooghe (editor), LOPSTR'03: Revised Selected Papers, pp. 214-232. Lecture Notes in Computer Science, volume 3018. © Springer-Verlag, 2004. External link and Postscript Google Scholar Cited by

• Comma-free codes. In: P. van Beek (editor), Proceedings of AI&M'04 and earlier version appeared in SymCon'03. (Postscript)

• P. Van Hentenryck, P. Flener, J. Pearson, and M. Ågren. Tractable symmetry breaking for CSPs with interchangeable values. In Proc. of IJCAI'03, Morgan Kaufmann Publishers, 2003. (Postscript)Google Scholar Cited by

• P. Flener, A.M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, J. Pearson, and T. Walsh.
  Breaking row and column symmetries in matrix models.
  In: P. Van Hentenryck (ed), Proc. of CP'02, pp. 462-476.
  Lecture Notes in Computer Science, volume 2470. Springer-Verlag, 2002. (Postscript) Google Scholar cited by.

• Constraints and Universal Algebra Appears in Annals of Mathematics and Artificial Intelligence, 1998, Vol. 24, pages 51-67. Google Scholar Cited by

• Closure Functions and Width 1 Problems Appears in CP'99. Google Scholar Cited By.

Timed Automata and Clock Decision Diagrams

• Clock Difference Diagrams Appears in Nordic Journal of Computing, Volume 6, Number 3.

• Efficient Timed Reachability Analysis Using Clock Difference Diagrams appears in Proceedings of CAV99, 11th INernational Conference on Computer-Aided Verification, July 7-10, 1999. Spring LNCS. Google Scholar Cited by

CSP and Temporal Logic.

Neural Networks and Clifford Algebras

• Clifford Networks a chapter in the bookComplex-Valued Networks. Edited by Akira Hirose.

• My PhD. theses was on Clifford Valued Neural Networks. Some papers and a copy of my thesis can be found here.

DATUM