Publications | Justin Pearson

Kamran Forghani, Mats Carlsson, Pierre Flener, Magnus Fredriksson, Justin Pearson, Di Yuan (2024). Maximizing value yield in wood industry through flexible sawing and product grading based on wane and log shape. Computers and Electronics in Agriculture.

PDF Cite DOI

Barnaby Martin, Justin Pearson (2022). When bounds consistency implies domain consistency for regular counting constraints. Constraints.

PDF Cite DOI

Gustav Björdal, Pierre Flener, Justin Pearson, Peter J. Stuckey, Guido Tack (2020). Solving satisfaction problems using large-neighbourhood search. CP 2020.

PDF Cite DOI

Gustav Björdal, Pierre Flener, Justin Pearson (2019). Generating compound moves in local search by hybridisation with complete search. CP-AI-OR 2019.

PDF Cite DOI

Gustav Björdal, Pierre Flener, Justin Pearson, Peter J. Stuckey (2019). Exploring declarative local-search neighbourhoods with constraint programming. CP 2019.

PDF Cite DOI

Mats Carlsson, Catherine Dubois, Olga Grinchtein, Justin Pearson (2018). Exploring properties of a telecommunication protocol with message delay using interactive theorem prover. SEFM 2018, the 16th International Conference on Software Engineering and Formal Methods.

PDF Cite DOI

Gustav Björdal, Pierre Flener, Justin Pearson, Peter J. Stuckey, Guido Tack (2018). Declarative local-search neighbourhoods in MiniZinc. ICTAI 2018.

PDF Cite DOI

Roberto Amadini, Pierre Flener, Justin Pearson, Joseph D. Scott, Peter J. Stuckey, Guido Tack (2017). MiniZinc with strings. LOPSTR 2016: Revised Selected Papers.

PDF Cite DOI

Joseph D. Scott, Pierre Flener, Justin Pearson, Christian Schulte (2017). Design and implementation of bounded-length sequence variables. CP-AI-OR 2017.

PDF Cite DOI

Maria Andreina Francisco Rodriguez, Pierre Flener, Justin Pearson (2017). Automatic generation of descriptions of time-series constraints. ICTAI 2017.

PDF Cite DOI

Ekaterina Arafailova, Nicolas Beldiceanu, Rémi Douence, Pierre Flener, Maria Andreina Francisco Rodriguez, Justin Pearson, Helmut Simonis (2016). Time-series constraints: Improvements and application in CP and MIP contexts. CP-AI-OR 2016.

PDF Cite DOI

Ekaterina Arafailova, Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Maria Andreina Francisco Rodriguez, Justin Pearson, Helmut Simonis (2016). Systematic derivation of bounds and glue constraints for time-series constraints. CP 2016.

PDF Cite DOI

Gustav Björdal, Jean-Noël Monette, Pierre Flener, Justin Pearson (2015). A constraint-based local search backend for MiniZinc. Constraints.

PDF Cite DOI

Maria Andreina Francisco Rodriguez, Pierre Flener, Justin Pearson (2015). Implied constraints for Automaton constraints. GCAI 2015: Global Conference on Artificial Intelligence.

PDF Cite DOI

Joseph D. Scott, Pierre Flener, Justin Pearson (2015). Constraint solving with bounded string variables. CP-AI-OR 2015.

PDF Cite DOI

Jean-Noël Monette, Pierre Flener, Justin Pearson (2015). Automated auxiliary variable elimination through on-the-fly propagator generation. CP 2015.

PDF Cite DOI

Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Xavier Lorca, Justin Pearson, Thierry Petit, Charles Prud'Homme (2015). A modelling pearl with sortedness constraints. GCAI 2015: Global Conference on Artificial Intelligence.

PDF Cite DOI

Nicolas Beldiceanu, Pierre Flener, Jean-Noël Monette, Justin Pearson, Helmut Simonis (2014). Toward sustainable development in constraint programming. Constraints.

PDF Cite DOI

Mats Carlsson, Olga Grinchtein, Justin Pearson (2014). Protocol log analysis with constraint programming. SMT 2014, the 12th International Workshop on Satisfiability Modulo Theories.

PDF Cite

Pierre Flener, Justin Pearson (2014). Propagators and violation functions for geometric and workload constraints arising in airspace sectorisation.

PDF Cite

Nicolas Beldiceanu, Pierre Flener, Justin Pearson, Pascal Van Hentenryck (2014). Propagating regular counting constraints. AAAI 2014.

PDF Cite

Kenneth Balck, Olga Grinchtein, Justin Pearson (2014). Model-based protocol log generation for testing a telecommunication test harness using CLP. DATE 2014: Design, Automation and Test in Europe.

PDF Cite DOI

Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Maria Andreina Francisco Rodriguez, Justin Pearson (2014). Linking prefixes and suffixes for constraints encoded using automata with accumulators. CP 2014.

PDF Cite DOI

Jean-Noël Monette, Pierre Flener, Justin Pearson (2014). A propagator design framework for constraints over sequences. AAAI 2014.

PDF Cite

Farshid Hassani Bijarbooneh, Animesh Pathak, Justin Pearson, Valerie Issarny, Bengt Jonsson, others (2014). A Constraint Programming Approach for Managing End-to-end Requirements in Sensor Network Macroprogramming.. Proceedings of the 3rd International Conference on Sensor Networks - SENSORNETS,.

Cite DOI

Pierre Flener, Justin Pearson (2013). Automatic airspace sectorisation: A survey.

PDF Cite

Jun He, Pierre Flener, Justin Pearson (2013). Underestimating the cost of a soft constraint is dangerous: Revisiting the edit-distance based SoftRegular constraint. Journal of Heuristics.

PDF Cite DOI

Nicolas Beldiceanu, Pierre Flener, Justin Pearson, Pascal Van Hentenryck (2013). Propagating regular counting constraints.

PDF Cite

Jun He, Pierre Flener, Justin Pearson, Wei Ming Zhang (2013). Solving string constraints: The case for constraint programming. CP 2013.

PDF Cite DOI

Farshid Hassani Bijarbooneh, Pierre Flener, Edith Ngai, Justin Pearson (2013). Optimising quality of information in data collection for mobile sensor networks. IWQoS 2013, the 21st IEEE/ACM International Symposium on Quality of Service.

PDF Cite DOI

Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson (2013). On the reification of global constraints. Constraints.

PDF Cite DOI

Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson (2013). On matrices, automata, and double counting in constraint programming. Constraints.

PDF Cite DOI

Maria Andreina Francisco Rodriguez, Pierre Flener, Justin Pearson (2013). Generation of implied constraints for automaton-induced decompositions. ICTAI 2013.

PDF Cite DOI

Joseph D. Scott, Pierre Flener, Justin Pearson (2013). Bounded strings for constraint programming. ICTAI 2013.

PDF Cite DOI

Jean-Noël Monette, Nicolas Beldiceanu, Pierre Flener, Justin Pearson (2013). A parametric propagator for discretely convex pairs of sum constraints. CP 2013.

PDF Cite DOI

Cyril Allignol, Nicolas Barnier, Pierre Flener, Justin Pearson (2012). Constraint programming for air traffic management: A survey. The Knowledge Engineering Review.

PDF Cite DOI

Karl Sundequist Blomdahl, Pierre Flener, Justin Pearson (2012). Contingency plans for air traffic flow and capacity management using constraint programming. Journal of Aerospace Operations.

PDF Cite DOI

Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson (2012). On the reification of global constraints.

PDF Cite

Jean-Noël Monette, Pierre Flener, Justin Pearson (2012). Towards solver-independent propagators. CP 2012.

PDF Cite DOI

Jun He, Pierre Flener, Justin Pearson (2012). Solution neighbourhoods for constraint-directed local search. SAC/CSP 2012, the track on Constraint Solving and Programming of the 27th ACM Symposium on Applied Computing.

PDF Cite DOI

Toni Mancini, Pierre Flener, Justin Pearson (2012). Combinatorial problem solving over relational databases: View synthesis through constraint-based local search. SAC/CSP 2012, the track on Constraint Solving and Programming of the 27th ACM Symposium on Applied Computing.

PDF Cite DOI

Farshid Hassani Bijarbooneh, Pierre Flener, Edith Ngai, Justin Pearson (2012). An optimisation-based approach for wireless sensor deployment in mobile sensing environments. WCNC 2012, the 10th IEEE Wireless Communications and Networking Conference.

PDF Cite DOI

Farshid Hassani Bijarbooneh, Pierre Flener, Edith Ngai, Justin Pearson (2011). Energy-efficient task-mapping for data-driven sensor network macroprogramming using constraint programming. ICS 2011, the 12th INFORMS Computing Society Conference.

PDF Cite DOI

Maria Andreina Francisco Rodriguez, Pierre Flener, Justin Pearson (2011). Consistency of constraint networks induced by automaton-based constraint specifications. ModRef 2011, the 10th International Workshop on Constraint Modelling and Reformulation.

Cite

Jun He, Pierre Flener, Justin Pearson (2011). An automaton constraint for local search. Fundamenta Informaticae.

PDF Cite DOI

Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson (2010). On matrices, automata, and double counting. CP-AI-OR 2010.

PDF Cite DOI

Karl Sundequist Blomdahl, Pierre Flener, Justin Pearson (2010). Contingency plans for air traffic management. CP 2010.

PDF Cite DOI

Karl Sundequist Blomdahl, Pierre Flener, Justin Pearson (2010). Contingency plans for air traffic flow and capacity management. INO 2010, the 9th EUROCONTROL Innovative Research Workshop & Exhibition.

PDF Cite

Pierre Flener, Justin Pearson, Meinolf Sellmann, Pascal Van Hentenryck, Magnus Ågren (2009). Dynamic structural symmetry breaking for constraint satisfaction problems. Constraints.

PDF Cite DOI

Pierre Flener, Justin Pearson, Meinolf Sellmann (2009). Static and dynamic structural symmetry breaking. Annals of Mathematics and Artificial Intelligence.

PDF Cite DOI

Pierre Flener, Justin Pearson (2009). Solving necklace constraint problems. Journal of Algorithms.

PDF Cite DOI

Magnus Ågren, Pierre Flener, Justin Pearson (2009). Revisiting constraint-directed search. Information and Computation.

PDF Cite DOI

Jun He, Pierre Flener, Justin Pearson (2009). Toward an automaton constraint for local search. LSCS 2009, the 6th International Workshop on Local Search Techniques in Constraint Satisfaction.

PDF Cite DOI

Farshid Hassani Bijarbooneh, Pierre Flener, Justin Pearson (2009). Dynamic demand-capacity balancing for air traffic management using constraint-based local search: First Results. LSCS 2009, the 6th International Workshop on Local Search Techniques in Constraint Satisfaction.

PDF Cite DOI

Olof Sivertsson, Pierre Flener, Justin Pearson (2008). A bound on the overlap of same-sized sets. Annals of Combinatorics.

PDF Cite DOI

Pierre Flener, Justin Pearson, Magnus Ågren, Carlos Garcia Avello, Mete Çeliktin, Søren Dissing (2007). Air-traffic complexity resolution in multi-sector planning. Journal of Air Transport Management.

PDF Cite DOI

Pierre Flener, Justin Pearson, Luis G. Reyna, Olof Sivertsson (2007). Design of financial CDO squared transactions using constraint programming. Constraints.

PDF Cite DOI

Magnus Ågren, Pierre Flener, Justin Pearson (2007). On constraint-oriented neighbours for local search.

PDF Cite

Pierre Flener, Justin Pearson, Meinolf Sellmann, Pascal Van Hentenryck, Magnus Ågren (2007). Structural symmetry breaking for constraint satisfaction problems. International Symmetry Conference, Edinburgh, UK.

PDF Cite

Ian P. Gent, Tom Kelsey, Steve Linton, Justin Pearson, Colva M. Roney-Dougal (2007). Groupoids and conditional symmetry. CP 2007.

PDF Cite DOI

Pierre Flener, Justin Pearson, Magnus Ågren, Carlos Garcia Avello, Mete Çeliktin, Søren Dissing (2007). Air-traffic complexity resolution in multi-sector planning using constraint programming. ATM 2007, the 7th USA / Europe R&D Seminar on Air Traffic Management, Barcelona, Spain.

PDF Cite

Magnus Ågren, Pierre Flener, Justin Pearson (2006). Inferring variable conflicts for local search.

PDF Cite

Pierre Flener, Justin Pearson, Meinolf Sellmann, Pascal Van Hentenryck (2006). Static and dynamic structural symmetry breaking. CP 2006.

PDF Cite DOI

Magnus Ågren, Pierre Flener, Justin Pearson (2005). Incremental algorithms for local search from existential second-order logic. CP 2005.

PDF Cite DOI

Pascal Van Hentenryck, Pierre Flener, Justin Pearson, Magnus Ågren (2005). Compositional derivation of symmetries for constraint satisfaction. SARA 2005.

PDF Cite DOI

Pierre Flener, Justin Pearson, Magnus Ågren (2004). Introducing ESRA, a relational language for modelling combinatorial problems. LOPSTR 2003: Revised Selected Papers.

PDF Cite DOI

Pierre Flener, Justin Pearson, Luis G. Reyna (2004). Financial portfolio optimisation. CP 2004.

PDF Cite DOI

Justin Pearson (2004). Comma-free codes. AI&M 2004.

PDF Cite

Pascal Van Hentenryck, Pierre Flener, Justin Pearson, Magnus Ågren (2003). Tractable symmetry breaking for CSPs with interchangeable values. IJCAI 2003.

PDF Cite

Justin Pearson (2003). Reducing The Number of Constraints in Symmetry Breaking During Search.

PDF Cite

Pierre Flener, Justin Pearson, Magnus Ågren (2003). Introducing ESRA, a Relational Language for Modelling Combinatorial Problems. Second International Workshop on Modelling and Reformulating Constraint Satisfaction Problems: Towards Systematisation and Automation.

PDF Cite

Justin Pearson (2003). Clifford Networks. Complex-Valued Neural Networks.

PDF Cite DOI

Pierre Flener, Alan M. Frisch, Brahim Hnich, Zeynep Kızıltan, Ian Miguel, Justin Pearson, Toby Walsh (2002). Breaking row and column symmetries in matrix models. CP 2002.

PDF Cite DOI

Pierre Flener, Justin Pearson (2002). Breaking all the symmetries in matrix models: Results, conjectures, and directions. SymCon 2002.

PDF Cite

G. Behrmann, K.G. Larsen, Justin Pearson, C. Weise, Wang Yi (1999). Efficient timed reachability analysis using clock difference diagrams. CAV 1999.

PDF Cite

Víctor Dalmau, Justin Pearson (1999). Closure functions and width 1 problems. CP 1999.

PDF Cite DOI

Kim G. Larsen, Carsten Weise, Wang Yi, Justin Pearson (1999). Clock difference diagrams. Nordic Journal of Computing.

PDF Cite

Peter Jeavons, David A. Cohen, Justin Pearson (1998). Constraints and universal algebra. Annals of Mathematics and Artificial Intelligence.

PDF Cite DOI

Justin Pearson, Jeremy Bryans (1998). Combining communicating sequential processes and temporal logic. The Journal of the Estonian Academy of Science and Engineering.

Cite

Justin Pearson, Peter Jeavons (1997). A survey of tractable constraint satisfaction problems.

PDF Cite

Justin Pearson (1996). Requirements Traceability and Formal Software Development or a Further Analysis of Requirements Traceability.

PDF Cite

Justin Pearson (1996). Computation with Clifford Valued Feed-Forward Networks.

PDF Cite

Justin K. Pearson (1995). Clifford Networks.

PDF Cite

Justin Pearson, D.L. Bisset (1994). Neural networks in the Clifford domain. Neural Networks, 1994. IEEE World Congress on Computational Intelligence.

PDF Cite DOI

Justin Pearson, David Bisset (1992). Back propagation in a Clifford algebra. Proceedings of the International Conference of Artificial Neural Networks (ICANN).

PDF Cite