Justin Pearson
Universitetslektor vid Institutionen för informationsteknologi; Datalogi
- Telefon:
- 018-471 72 92
- E-post:
- Justin.Pearson@it.uu.se
- Besöksadress:
- Hus 10, Regementsvägen 10
- Postadress:
- Box 337
751 05 UPPSALA
Ladda ned kontaktuppgifter för Justin Pearson vid Institutionen för informationsteknologi; Datalogi
- Akademiska meriter:
- PhD, Docent
Kort presentation
Docent in Computer Science. My research focuses on combinatorial optimisation: in particular I work on the theory and practice of constraint satisfaction.
My homepage can be found here I am a member of the optimisation group at the IT department.
Nyckelord
- combinatorial (or discrete) optimisation
- constraint programming
- software testing
- complexity theory
Publikationer
Senaste publikationer
Parameterised Treewidth for Constraint Modelling Languages
Ingår i 2024 IEEE 36th International Conference on Tools with Artificial Intelligence (ICTAI), s. 43-48, 2024
Ingår i Computers and Electronics in Agriculture, 2024
When bounds consistency implies domain consistency for regular counting constraints
Ingår i Constraints, s. 161-167, 2022
Solving Satisfaction Problems using Large-Neighbourhood Search
Ingår i Principles and Practice of Constraint Programming, s. 55-71, 2020
Generating compound moves in local search by hybridisation with complete search
Ingår i Integration of Constraint Programming, Artificial Intelligence, and Operations Research, s. 95-111, 2019
Alla publikationer
Artiklar i tidskrift
Ingår i Computers and Electronics in Agriculture, 2024
When bounds consistency implies domain consistency for regular counting constraints
Ingår i Constraints, s. 161-167, 2022
A parametric propagator for pairs of SUM constraints with a discrete convexity property
Ingår i Artificial Intelligence, s. 170-190, 2016
A constraint-based local search backend for MiniZinc
Ingår i Constraints, s. 325-345, 2015
Toward sustainable development in constraint programming
Ingår i Constraints, s. 139-149, 2014
On the reification of global constraints
Ingår i Constraints, s. 1-6, 2013
On matrices, automata, and double counting in constraint programming
Ingår i Constraints, s. 108-140, 2013
Ingår i Journal of Heuristics, s. 729-756, 2013
Constraint Programming for Air Traffic Management: Preface
Ingår i Knowledge engineering review (Print), s. 287-289, 2012
Contingency plans for air traffic flow and capacity management using constraint programming
Ingår i Journal of Aerospace Operations, s. 249-266, 2012
An automaton constraint for local search
Ingår i Fundamenta Informaticae, s. 223-248, 2011
Solving necklace constraint problems
Ingår i Journal of Algorithms, s. 61-73, 2009
Revisiting constraint-directed search
Ingår i Information and Computation, s. 438-457, 2009
Dynamic structural symmetry breaking for constraint satisfaction problems
Ingår i Constraints, s. 506-538, 2009
Static and dynamic structural symmetry breaking
Ingår i Annals of Mathematics and Artificial Intelligence, s. 37-57, 2009
A bound on the overlap of same-sized subsets
Ingår i Annals of Combinatorics, s. 347-352, 2008
Design of financial CDO squared transactions using constraint programming
Ingår i Constraints, s. 179-205, 2007
Air-traffic complexity resolution in multi-sector planning
Ingår i Journal of Air Transport Management, s. 323-328, 2007
Generic incremental algorithms for local search
Ingår i Constraints, s. 293-324, 2007
Constraints and universal algebra
Ingår i ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, s. 51-67, 1998
Artiklar, forskningsöversikt
Constraint programming for air traffic management: a survey
Ingår i Knowledge engineering review (Print), s. 361-392, 2012
Kapitel i böcker, delar av antologi
Introducing ESRA, a relational language for modelling combinatorial problems
Ingår i LOPSTR'03: Revised Selected Papers, s. 214-232, Springer-Verlag, 2004
Ingår i Complex-Valued Neural Networks Theories and Applications, 2003
Konferensbidrag
Parameterised Treewidth for Constraint Modelling Languages
Ingår i 2024 IEEE 36th International Conference on Tools with Artificial Intelligence (ICTAI), s. 43-48, 2024
Solving Satisfaction Problems using Large-Neighbourhood Search
Ingår i Principles and Practice of Constraint Programming, s. 55-71, 2020
Generating compound moves in local search by hybridisation with complete search
Ingår i Integration of Constraint Programming, Artificial Intelligence, and Operations Research, s. 95-111, 2019
Exploring declarative local-search neighbourhoods with constraint programming
Ingår i Principles and Practice of Constraint Programming, s. 37-53, 2019
Declarative local-search neighbourhoods in MiniZinc
Ingår i PROCEEDINGS OF THE 2018 IEEE 30TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI), s. 98-105, 2018
Ingår i Software Engineering and Formal Methods, s. 239-253, 2018
Automatic generation of descriptions of time-series constraints
Ingår i IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI), s. 102-109, 2017
Ingår i Logic-Based Program Synthesis and Transformation, s. 59-75, 2017
Design and implementation of bounded-length sequence variables
Ingår i Integration of AI and OR Techniques in Constraint Programming, s. 51-67, 2017
Modelling and verification of user interactions using constraint programming
Ingår i Proc. 3rd International Conference on Software Quality, Reliability and Security, s. 541-547, 2017
Time-series constraints: Improvements and application in CP and MIP contexts
Ingår i Integration of AI and OR Techniques in Constraint Programming, s. 18-34, 2016
Systematic derivation of bounds and glue constraints for time-series constraints
Ingår i Principles and Practice of Constraint Programming, s. 13-29, 2016
On the Reification of Global Constraints (Abstract)
Ingår i Principles and practice of constraint programming, CP 2015, s. 733-733, 2015
A constraint optimisation model for analysis of telecommunication protocol logs
Ingår i Tests and Proofs, s. 137-154, 2015
Constraint solving on bounded string variables
Ingår i Integration of AI and OR Techniques in Constraint Programming, s. 375-392, 2015
A modelling pearl with sortedness constraints
Ingår i Global Conference on Artificial Intelligence, s. 27-41, 2015
Automated auxiliary variable elimination through on-the-fly propagator generation
Ingår i Principles and Practice of Constraint Programming, s. 313-329, 2015
Implied constraints for AUTOMATON constraints
Ingår i Global Conference on Artificial Intelligence, s. 113-126, 2015
Testing of a telecommunication protocol using constraint programming
Ingår i 2015 IEEE Eighth International Conference On Software Testing, Verification And Validation Workshops (ICSTW), 2015
Model-based protocol log generation for testing a telecommunication test harness using CLP
Ingår i 2014 DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION (DATE), 2014
A propagator design framework for constraints over sequences
Ingår i Proc. 28th AAAI Conference on Artificial Intelligence, s. 2710-2716, 2014
Linking prefixes and suffixes for constraints encoded using automata with accumulators
Ingår i Principles and Practice of Constraint Programming, s. 142-157, 2014
Model-based protocol log generation for testing a telecommunication test harness using CLP
Ingår i Proc. 17th Conference on Design, Automation and Test in Europe, 2014
Protocol log analysis with constraint programming: Work in progress
Ingår i Satisfiability Modulo Theories, s. 17-26, 2014
Propagating regular counting constraints
Ingår i Proc. 28th AAAI Conference on Artificial Intelligence, s. 2616-2622, 2014
Ingår i Proc. 3rd International Conference on Sensor Networks, s. 28-40, 2014
Solving string constraints: The case for constraint programming
Ingår i Principles and Practice of Constraint Programming, s. 381-397, 2013
A parametric propagator for discretely convex pairs of sum constraints
Ingår i Principles and Practice of Constraint Programming, s. 529-544, 2013
Airspace sectorisation using constraint-based local search
Ingår i Proc. 10th USA/Europe Air Traffic Management Research and Development Seminar, 2013
Bounded strings for constraint programming
Ingår i Proc. 25th International Conference on Tools with Artificial Intelligence, s. 1036-1043, 2013
Optimising quality of information in data collection for mobile sensor networks
Ingår i Proc. 21st International Symposium on Quality of Service, s. 163-172, 2013
Des propagateurs indépendants des solveurs
Ingår i Actes des Neuvièmes Journées Francophones de Programmation par Contraintes, s. 227-236, 2013
Generation of implied constraints for automaton-induced decompositions
Ingår i Proc. 25th International Conference on Tools with Artificial Intelligence, s. 1076-1083, 2013
Solution neighbourhoods for constraint-directed local search
Ingår i Proc. 27th ACM Symposium on Applied Computing, s. 74-79, 2012
Towards solver-independent propagators
Ingår i Principles and Practice of Constraint Programming, s. 544-560, 2012
- DOI för Towards solver-independent propagators
- Ladda ner fulltext (pdf) av Towards solver-independent propagators
An optimisation-based approach for wireless sensor deployment in mobile sensing environments
Ingår i Proc. Wireless Communications and Networking Conference 2012, s. 2108-2112, 2012
Ingår i Proc. 27th ACM Symposium on Applied Computing, s. 80-87, 2012
Consistency of constraint networks induced by automaton-based constraint specifications
Ingår i Proc. 10th International Workshop on Constraint Modelling and Reformulation, s. 117-131, 2011
Ingår i Operations Research, Computing, and Homeland Defense, s. 199-209, 2011
Contingency plans for air traffic management
Ingår i Principles and Practice of Constraint Programming – CP 2010, s. 643-657, 2010
On matrices, automata, and double counting
Ingår i Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, s. 10-24, 2010
Local search over relational databases
Ingår i Proc. 7th International Workshop on Local Search Techniques in Constraint Satisfaction, s. 15, 2010
Ingår i Proc. 9th International Workshop on Constraint Modelling and Reformulation, s. 13, 2010
Contingency plans for air traffic flow and capacity management
Ingår i Proc. 9th Innovative Research Workshop and Exhibition, s. 119-126, 2010
Toward an automaton constraint for local search
Ingår i Proc. 6th International Workshop on Local Search Techniques in Constraint Satisfaction, s. 13-25, 2009
Constrained optimisation over massive databases
Ingår i Proc. 16th RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, s. 16, 2009
Ingår i Proc. 6th International Workshop on Local Search Techniques in Constraint Satisfaction, s. 27-40, 2009
Solving necklace constraint problems
Ingår i Proc. 18th European Conference on Artificial Intelligence, s. 520-524, 2008
Efficient structural symmetry breaking for constraint satisfaction problems
Ingår i International Symmetry Conference, 2007
Revisiting constraint-directed search
Ingår i Proceedings of LSCS'07, the 4th International Workshop on Local Search Techniques in Constraint Satisfaction, 2007
Air-traffic complexity resolution in multi-sector planning using constraint programming
Ingår i Proceedings of ATM'07, the 7th USA/Europe R&D Seminar on Air Traffic Management, 2007
Groupoids and conditional symmetry
Ingår i Principles and Practice of Constraint Programming – CP 2007, s. 823-830, 2007
Static and dynamic structural symmetry breaking
Ingår i Twelfth International Conference on Principles and Practice of Constraint Programming (CP'06), 2006
Inferring variable conflicts for local search
Ingår i Principles and Practice of Constraint Programming - CP 2006, 2006
Set variables and local search
Ingår i Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: Second International Conference, CPAIOR 2005, Proceedings, s. 19-33, 2005
Compositional derivation of symmetries for constraint satisfaction
Ingår i Abstraction, Reformulation and Approximation, s. 234-247, 2005
Incremental algorithms for local search from existential second-order logic
Ingår i Proceedings of Principles and Practice of Constraint Programming - CP 2005, s. 47-61, 2005
Financial portfolio optimisation
Ingår i 10th International Conference on Principles and Practice of Constraint Programming, s. 227-241, 2004
Symmetry breaking in constraint satisfaction with graph-isomorphism: Comma-free codes
Ingår i Proceedings of AI&M'04, 2004
Tractable symmetry breaking for CSPs with interchangeable values.
Ingår i Proceedings of the eighteenth International Joint Conference on Artificial Intelligence (IJCAI 2003), s. 277-282, 2003
Breaking symmetries in matrix models: A brief overview.
Ingår i Proceedings of the Tenth Workshop on Automated Reasoning (ARW'03), 2003
Breaking all the symmetries in matrix models: Results, conjectures, and directions
Ingår i Proceedings of SymCon'02, the Second International Workshop on Symmetry in CSPs, 2002
Breaking row and column symmetries in matrix models
Ingår i Principles and Practice of Constraint Programming – CP 2002, s. 462-476, 2002
Ingår i Proc. of SymCon'01, the First International Workshop on Symmetry in CSPs, s. 41-47, 2001
Closure functions and width 1 problems
1999
Proceedings (redaktörskap)
Proc. 9th International Workshop on Constraint Modelling and Reformulation
2010
Proc. 10th International Workshop on Symmetry in Constraint Satisfaction Problems
2010
2004
Proceedings of SymCon'02, the Second International Workshop on Symmetry in CSPs
2002
Proceedings of SymCon'01, the First International Workshop on Symmetry in CSPs
2001
Rapporter
Global Constraint Catalog: Volume II, time-series constraints
2016
2014
Automatic airspace sectorisation: A survey
2013
Structural symmetry breaking for constraint satisfaction problems
2007
On Constraint-Oriented Neighbours for Local Search
2007
Air-Traffic Complexity Resolution in Multi-Sector Planning
2007
Worst-case air-traffic generation using constraint programming
2004
Air-traffic complexity resolution using constraint programming
2004
2001
Övriga
2003