Research
My doctoral research was carred out at the Department of Computing Science, Uppsala University, where I was a member of the ASTRA Group on Constraint Programming.
Abstract Propagation
My theoretical research focused on the use of Galois connections for specifying propagation strength (i.e., consistency and completeness) in constraint programming, with particular focus on mixed consistencies, combinations of variable types, and structured variable types.
String Constraints
My practical research was into the use of constraint programming for solving constraints on strings, such as those often found in software verification and validation problems. This was a joint project with the Algorithmic Program Verification Group.
Cumulative Resource Scheduling
I have also worked in constraint-based scheduling, particularly regarding filtering algorithms for cumulative resources. Previous work in this area includes my Master's project, carried out at SICS in Uppsala, which won the 2011 SAIS Award for Best AI Master's Thesis.
Publications
-
Doctoral Thesis
Other Things Besides Number: Abstraction, Constraint Propagation, and String Variable Types
Uppsala Dissertations from the Faculty of Science and Technology 120.
Uppsala: Acta Universitatis Upsaliensis, 2016.
Supervisors: Pierre Flener, Justin Pearson, Parosh Abdulla.
[BibTeX] [PDF][Erratum] -
Constraint Solving on Bounded String Variables
In: Laurent Michel (Ed.), Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2015), Proceedings of the 12th International Conference. LNCS #9075. pp. 375-392. Springer. 2015.
[BibTeX] [PDF] -
A Quadratic Edge-Finding Filtering Algorithm for Cumulative Resource Constraints
Constraints (19): 3 pp. 243–269. 2014.
[BibTeX] [PDF][Preprint] -
Rapid Prototyping of a Structured Domain through Indexical Compilation
In: COSpeL: The 1st Workshop on Domain Specific Languages in Combinatorial Optimization, Satellite workshop of CP 2013. 2013.
[BibTeX] -
Bounded Strings for Constraint Programming
In: Tools with Artificial Intelligence (ICTAI 2013), IEEE 25th International Conference. pp. 1036–1043. IEEE Computer Society. 2013.
[BibTeX] [PDF] -
A Quadratic Extended Edge-Finding Filtering Algorithm for Cumulative Resource Constraints
International Journal of Planning and Scheduling (1): 4 pp. 264–284. 2013.
[BibTeX] [PDF] -
A Quadratic Edge-Finding Filtering Algorithm for Cumulative Resource Constraints
In: Jimmy Ho-Man Lee (Ed.), Principles and Practice of Constraint Programming (CP 2011), Proceedings of the 17th International Conference. LNCS #6876. pp. 478–492. Springer. 2011.
[BibTeX] [PDF][Preprint][Additional Resources] -
M.Sc. Thesis
Filtering Algorithms for Discrete Cumulative Resources
Uppsala University, Department of Information Technology, #IT 10 048. 2010.
Supervisor: Mats Carlsson.
[BibTeX] [PDF]