Department of Information Technology

ASTRA Publications

Please note: This material is provided for your personal use only and may not be retransmitted or redistributed without permission in writing from a paper's publisher and/or authors. You may not upload this material to any public server, on-line service, network, or bulletin board without prior written permission from the publisher and/or authors. You may not make copies for any commercial purpose. This material is not public domain. Reproduction or storage of materials retrieved from this web site are subject to Copyright Law. If you cannot access the official version of a paper, then contact us for a pre-print in case there is none below.

2017

  • [DBCFM17] J. J. Dekker, G. Björdal, M. Carlsson, P. Flener, and J.-N. Monette. Auto-tabling for subproblem presolving in MiniZinc. Constraints, journal fast track of CP-AI-OR 2017, vv(nn):ppp-qqq, 2017. (Summary in LNCS, volume 10335, page XV, Springer, 2017.) (PDF, open access)
  • [AFPSST17] R. Amadini, P. Flener, J. Pearson, J. Scott, P. Stuckey, and G. Tack. MiniZinc with strings. In: M. Hermenegildo and P. Lopez-Garcia (editors), LOPSTR 2016 Post-Proceedings. Lecture Notes in Computer Science, volume 10184, pages 52-67. Springer, 2017. (PDF forthcoming) (Preprint) (superseded Pre-Proceedings version)
  • [SFPS17] J. Scott, P. Flener, J. Pearson, and Ch. Schulte. Design and implementation of bounded-length sequence variables. In: D. Salvagnin and M. Lombardi (editors), CP-AI-OR 2017. Lecture Notes in Computer Science, volume 10335, pages 51-67. Springer, 2017. (PDF) (Preprint)
  • [Yon17] H. Yong. A Hybrid Recommender: Study and implementation of course selection recommender engine. Master Thesis, Report IT 17011, Faculty of Science and Technology, Uppsala University, Sweden, May 2017. (PDF)

2016

  • [MBFP16] J.-N. Monette, N. Beldiceanu, P. Flener, and J. Pearson. A parametric propagator for pairs of sum constraints with a discrete convexity property. Artificial Intelligence, 241:170-190, December 2016. (PDF) (Preprint) (Software) (Recomputation Package)
  • [Dek16] J. Dekker. Sub-Problem Pre-Solving in MiniZinc. Master Thesis, Report IT 16082, Faculty of Science and Technology, Uppsala University, Sweden, October 2016. (PDF)
  • [ABCDFFPS16] E. Arafailova, N. Beldiceanu, R. Douence, M. Carlsson, P. Flener, M. A. Francisco Rodríguez, J. Pearson, and H. Simonis. Global Constraint Catalog, Volume II, Time-Series Constraints. Computing Research Repository 1609.08925, September 2016. (PDF)
  • [ABCFFPS16] E. Arafailova, N. Beldiceanu, M. Carlsson, P. Flener, M. A. Francisco Rodriguez, J. Pearson, and H. Simonis. Systematic derivation of bounds and glue constraints for time-series constraints. In: M. Rueher (editor), CP 2016. Lecture Notes in Computer Science, volume 9892, pages 13-29. Springer, 2016. (PDF) (Preprint)
  • [VCDMS16] S. Van Cauwelaert, C. Dejemeppe, J.-N. Monette, and Pierre Schaus. Efficient filtering for the unary resource with family-based transition times. In: M. Rueher (editor), CP 2016. Lecture Notes in Computer Science, volume 9892, pages 520-535. Springer, 2016. (PDF)
  • [Bjö16] G. Björdal. String Variables for Constraint-Based Local Search. Master Thesis, Report IT 16057, Faculty of Science and Technology, Uppsala University, Sweden, August 2016. (PDF)
  • [Blo16] M. Block. Pre-Runtime Scheduling of an Avionics System. Master Thesis, Report IT 16043, Faculty of Science and Technology, Uppsala University, Sweden, August 2016. (PDF)
  • [Kob16] H. Koberg. Treewidth and Indexicals: Applying Results in Tractability to Propagators. Bachelor Thesis, Report IT 16030, Faculty of Science and Technology, Uppsala University, Sweden, June 2016. (PDF)
  • [ABDFFPS16] E. Arafailova, N. Beldiceanu, R. Douence, P. Flener, M. A. Francisco Rodriguez, J. Pearson, and H. Simonis. Time-series constraints: Improvements and application in CP and MIP contexts. In: C.-G. Quimper (editor), CP-AI-OR 2016. Lecture Notes in Computer Science, volume 9676, pages 18-34. Springer, 2016. (PDF) (Preprint) (Slides)
  • [HBDNFL16] F. Hassani Bijarbooneh, W. Du, E. Ngai, X. Fu, and J. Liu. Cloud-assisted data fusion and sensor selection for internet-of-things. IEEE Internet of Things Journal, 3(3):257-268, June 2016. (PDF)
  • [Bro16] P. Broman. Implementing Tuple Variables in Gecode. Bachelor Thesis, Report IT 16020, Faculty of Science and Technology, Uppsala University, Sweden, May 2016. (PDF)
  • [Sco16] J. Scott. Other Things Besides Number: Abstraction, Constraint Propagation, and String Variable Types. PhD thesis, Department of Information Technology, Uppsala University, Sweden, March 2016. (PDF)

2015

  • [Knu15] F. Knutar. Automatic Generation of Assembly Schedules for a Dual-Arm Robot Using Constraint Programming. Master Thesis, Report IT 15081, Faculty of Science and Technology, Uppsala University, Sweden, December 2015. (PDF)
  • [FFP15] M. A. Francisco Rodríguez, P. Flener, and J. Pearson. Implied constraints for AUTOMATON constraints. In: G. Gottlob, G. Sutcliffe, and A. Voronkov (editors), GCAI 2015. EasyChair Proceedings in Computing, volume 36, pages 113-126, 2015. (PDF) (Slides)
  • [BCFLP15] N. Beldiceanu, M. Carlsson, P. Flener, X. Lorca, J. Pearson, T. Petit, and Ch. Prud'homme. A modelling pearl with sortedness constraints. In: G. Gottlob, G. Sutcliffe, and A. Voronkov (editors), GCAI 2015. EasyChair Proceedings in Computing, volume 36, pages 27-41, 2015. (PDF)
  • [MFP15] J.-N. Monette, P. Flener, and J. Pearson. Automated auxiliary variable elimination through on-the-fly propagator generation. In: G. Pesant (editor), CP 2015. Lecture Notes in Computer Science, volume 9255, pages 313-329. Springer, 2015. (PDF) (Preprint) (Software)
  • [Kaj15] E. Kajgård. Route Optimisation for Winter Road Maintenance using Constraint Modelling. Master Thesis in Computer Science, Report UPTEC IT 15 015, Faculty of Science and Technology, Uppsala University, Sweden, October 2015. (PDF)
  • [GCP15] O. Grinchtein, M. Carlsson, and J. Pearson. A constraint optimisation model for analysis of telecommunication protocol logs. In: J. Christian Blanchette and N. Kosmatov (editors), TAP 2015. Lecture Notes in Computer Science, volume 9154, pages 137-154. Springer, 2015. (PDF)
  • [BMFP15] G. Björdal, J.-N. Monette, P. Flener, and J. Pearson. A constraint-based local search backend for MiniZinc. Constraints, journal fast track of CP-AI-OR 2015, 20(3):325-345, 2015. (Summary in LNCS, volume 9075, page 18, Springer, 2015.) (PDF) (Preprint) (Short video abstract) (Software)
  • [SFP15] J. Scott, P. Flener, and J. Pearson. Constraint solving on bounded string variables. In: L. Michel (editor), CP-AI-OR 2015. Lecture Notes in Computer Science, volume 9075, pages 375-392. Springer, 2015. (PDF) (Preprint)
  • [Has15] F. Hassani Bijarbooneh. Constraint Programming for Wireless Sensor Networks. PhD thesis, Department of Information Technology, Uppsala University, Sweden, 2015. (PDF)

2014

  • [Bjö14] G. Björdal. The First Constraint-Based Local Search Backend for MiniZinc. Bachelor Thesis in Computer Science, Report IT 14 066, Faculty of Science and Technology, Uppsala University, Sweden, October 2014. (PDF) (Software)
  • [Dye14] K. Dye. Implementation of Bit-Vector Variables in a CP Solver, with an Application to the Generation of Cryptographic S-Boxes. Master Thesis in Computer Science, Report IT 14 063, Faculty of Science and Technology, Uppsala University, Sweden, October 2014. (PDF) (Software)
  • [Ehr14] P. Ehrencrona Kjellin. Airspace Sectorisation Using Constraint-Based Local Search. Bachelor Thesis in Computer Science, Report IT 14 047, Faculty of Science and Technology, Uppsala University, Sweden, October 2014. (PDF)
  • [BCFFP14] N. Beldiceanu, M. Carlsson, P. Flener, M. A. Francisco Rodriguez, and J. Pearson. Linking prefixes and suffixes for constraints encoded using automata with accumulators. In: B. O'Sullivan (editor), CP 2014, pages 142-157. Lecture Notes in Computer Science, volume 8656. Springer, 2014. (PDF) (Preprint)
  • [Cou14] N. Couderc. Modelling and Simulation of a Telecommunication Application using Constraint Programming. Master Thesis in Computer Science, Report UPTEC IT 14 056, Faculty of Science and Technology, Uppsala University, Sweden, September 2014. (PDF)
  • [MFP14] J.-N. Monette, P. Flener, and J. Pearson. A propagator design framework for constraints over sequences. In: C. E. Brodley and P. Stone (editors), AAAI 2014, pages 2710-2716. AAAI Press, 2014. (PDF) (Preprint) (Appendix)
  • [BFPVH14] N. Beldiceanu, P. Flener, J. Pearson, and P. Van Hentenryck. Propagating regular counting constraints. In: C. E. Brodley and P. Stone (editors), AAAI 2014, pages 2616-2622. AAAI Press, 2014. (PDF) (Preprint)
  • [CGP14] M. Carlsson, O. Grinchtein, and J. Pearson. Protocol log analysis with constraint programming. In: Ph. Rümmer and Ch. Wintersteiger (editors), SMT 2014, the 12th International Workshop on Satisfiability Modulo Theories. 2014. (PDF) (Slides)
  • [Eje14] J. Ejenstam. Implementing a Time Optimal Task Sequence For Robot Assembly Using Constraint Programming. Master Thesis in Information Technology Engineering, Report UPTEC IT 14 011, Faculty of Science and Technology, Uppsala University, Sweden, August 2014. (PDF)
  • [Cha14] V. Chapovalova. Consistency of Constraint Reifications by Reformulation. Bachelor Thesis in Information Technology, Report IT 14 043, Faculty of Science and Technology, Uppsala University, Sweden, August 2014. (PDF)
  • [KFSN14] R. Kameugne, L.P. Fotso, J. Scott, and Y. Ngo-Kateu. A quadratic edge-finding filtering algorithm for cumulative resource constraints. Constraints, 19(3):243-269, June 2014. (PDF) (Preprint)
  • [HBDNF14] F. Hassani Bijarbooneh, W. Du, E. Ngai, and X. Fu. Energy-efficient sensor selection for data quality and load balancing in wireless sensor networks. In: X. Liu and X. Wang (editors), IWQoS 2014, the 22nd IEEE/ACM International Symposium on Quality of Service. IEEE Communications Society, 2014. (PDF)
  • [BFMPS14] N. Beldiceanu, P. Flener, J.-N. Monette, J. Pearson, and H. Simonis. Toward sustainable development in constraint programming. Constraints, 19(2):139-149, April 2014. (PDF) (Preprint)
  • [LJC14] J. Larson, M. Johansson, and M. Carlsson. An integrated constraint programming approach to scheduling sports leagues with divisional and round-robin tournaments. In: H. Simonis (editor), CP-AI-OR 2014, pages 144-158. Lecture Notes in Computer Science, volume 8451. Springer, 2014. (PDF) (not a UU publication)
  • [BGP14] K. Balck, O. Grinchtein, and J. Pearson. Model-based protocol log generation for testing a telecommunication test harness using CLP. In: L. Fanucci (editor), DATE 2014, the 3rd International Conference on Design, Automation, & Test in Europe. IEEE Computer Society, 2014. (PDF)
  • [HBPPIJ14] F. Hassani Bijarbooneh, A. Pathak, J. Pearson, V. Issarny, and B. Jonsson. A constraint programming approach for managing end-to-end requirements in sensor network macroprogramming. In: O. Postolache, M. Van Sinderen, and F. Ali (editors), SensorNets 2014, the 3rd International Conference on Sensor Networks. SciTePress, 2014. (PDF)
  • [FP14] P. Flener and J. Pearson. Propagators and Violation Functions for Geometric and Workload Constraints Arising in Airspace Sectorisation. Computing Research Repository 1401.7463, January 2014. (PDF)

2013

  • [KFS13] R. Kameugne, L. P. Fotso, and J. D. Scott. A quadratic extended edge-finding algorithm for cumulative resources. International Journal of Planning and Scheduling, 4(1):264-284, 2013. (PDF) (preprint)
  • [FFP13] M. A. Francisco Rodriguez, P. Flener, and J. Pearson. Generation of implied constraints for automaton-induced decompositions. In: É. Grégoire and B. Mazure (editors), ICTAI/CSP 2013, the special track on SAT and CSP technologies of the 25th IEEE International Conference on Tools with Artificial Intelligence, pages 1076-1083. IEEE Computer Society, 2013. (PDF) (Preprint) (Slides)
  • [SFP13] J. D. Scott, P. Flener, and J. Pearson. Bounded strings for constraint programming. In: É. Grégoire and B. Mazure (editors), ICTAI/CSP 2013, the special track on SAT and CSP technologies of the 25th IEEE International Conference on Tools with Artificial Intelligence, pages 1036-1043. IEEE Computer Society, 2013. (PDF) (Preprint)
  • [FP13] P. Flener and J. Pearson. Automatic Airspace Sectorisation: A Survey. Computing Research Repository 1311.0653, November 2013. (PDF)
  • [HFP13a] J. He, P. Flener, and J. Pearson. Underestimating the cost of a soft constraint is dangerous: Revisiting the edit-distance based SoftRegular constraint. Journal of Heuristics, 19(5):729-756, October 2013. (PDF) (Preprint)
  • [HFP13b] J. He, P. Flener, and J. Pearson. Solving string constraints: The case for constraint programming. In: Ch. Schulte (editor), CP 2013, pages 381-397. Lecture Notes in Computer Science, volume 8124. Springer, 2013. (PDF) (Preprint) (Slides) (Software)
  • [MBFP13] J.-N. Monette, N. Beldiceanu, P. Flener, and J. Pearson. A parametric propagator for discretely convex pairs of sum constraints. In: Ch. Schulte (editor), CP 2013, pages 529-544. Lecture Notes in Computer Science, volume 8124. Springer, 2013. (PDF) (Preprint) (Slides) (superseded by the Artificial Intelligence paper in 2016) (Software) (Recomputation Package)
  • [BFPVH13] N. Beldiceanu, P. Flener, J. Pearson, and P. Van Hentenryck. Propagating regular counting constraints. Computing Research Repository 1309.7145, September 2013. (PDF) (superseded by the AAAI 2014 paper)
  • [Bac13] P. Backeman. Solving the Haplotype Inference Problem Using the nVector Constraint. Master Thesis in Information Technology, Report IT 13 056, Faculty of Science and Technology, Uppsala University, Sweden, August 2013. (PDF)
  • [Lin13] J. Lindqvist. Implementing a Physician Roster Using Constraint Programming. Master Thesis in Information Technology, Report IT 13 046, Faculty of Science and Technology, Uppsala University, Sweden, August 2013. (PDF)
  • [He13] J. He. Constraints for Membership in Formal Languages under Systematic Search and Stochastic Local Search. PhD thesis, Department of Information Technology, Uppsala University, Sweden, 2013. (PDF)
  • [MFP13] J.-N. Monette, P. Flener, and J. Pearson. Des propagateurs indépendants des solveurs. In: Ch. Truchet (editor), JFPC 2013, les 9ièmes Journées Francophones de Programmation par Contraintes, pages 227-236. (translation of the CP 2012 paper) (PDF) (slides) (Software)
  • [HBFNP13] F. Hassani Bijarbooneh, P. Flener, E. Ngai, and J. Pearson. Optimising quality of information in data collection for mobile sensor networks. In: X. Gu and H. Wang (editors), IWQoS 2013, the 21st IEEE/ACM International Symposium on Quality of Service, pages 163-172. IEEE Communications Society, 2013. (PDF) (Preprint)
  • [BCFP13b] N. Beldiceanu, M. Carlsson, P. Flener, and J. Pearson. On matrices, automata, and double counting in constraint programming. Constraints, 18(1):108-140, January 2013. (PDF) (Preprint)
  • [BCFP13a] N. Beldiceanu, M. Carlsson, P. Flener, and J. Pearson. On the reification of global constraints. Constraints, 18(1):1-6, January 2013. (PDF) (Preprint)

2012

  • [MFP12] J.-N. Monette, P. Flener, and J. Pearson. Towards solver-independent propagators. In: M. Milano (editor), CP 2012, pages 544-560. Lecture Notes in Computer Science, volume 7514. Springer, 2012. (PDF) (Preprint) (Software)
  • [CCDS12] R. Castañeda Lozano, M. Carlsson, F. Drejhammar, and Ch. Schulte. Constraint-based register allocation and instruction scheduling. In: M. Milano (editor), CP 2012, pages 750-766. Lecture Notes in Computer Science, volume 7514. Springer, 2012. (PDF) (not a UU publication)
  • [LBC12] A. Letort, N. Beldiceanu, and M. Carlsson. A scalable sweep algorithm for the cumulative constraint. In: M. Milano (editor), CP 2012, pages 439-454. Lecture Notes in Computer Science, volume 7514. Springer, 2012. (PDF) (not a UU publication)
  • [ABFP12] C. Allignol, N. Barnier, P. Flener, and J. Pearson. Constraint programming for air traffic management: A survey. In [FPB12]: The Knowledge Engineering Review, 27(3):361-392, September 2012. (PDF)
  • [FPB12] P. Flener, J. Pearson, and M. Bourgois, editors. Special Issue on Constraint Programming for Air Traffic Management. The Knowledge Engineering Review, 27(3), September 2012. (Call) (TOC)
  • [BCTR12] N. Beldiceanu, M. Carlsson, Th. Petit, and J.-Ch. Régin. An O(n log n) bound consistency algorithm for the conjunction of an alldifferent and an inequality between a sum of variables and a constant, and its generalization. In: ECAI 2012, pages 145-150. IOS Press, 2012. (PDF) (not a UU publication)
  • [Öfv12] J. Öfverstedt. Water retention on magic squares with constraint-based local search. Bachelor Thesis in Information Technology, Report IT 12 018, Faculty of Science and Technology, Uppsala University, Sweden, 2012. (PDF)
  • [SBFP12] K. Sundequist Blomdahl, P. Flener, and J. Pearson. Contingency plans for air traffic flow and capacity management using constraint programming. Journal of Aerospace Operations, 1(3):249-266, March 2012. (PDF) (Preprint)
  • [HBFNP12] F. Hassani Bijarbooneh, P. Flener, E. Ngai, and J. Pearson. An optimisation-based approach for wireless sensor deployment in mobile sensing environments. In: P. Duhamel and P. Lorenz (editors), WCNC 2012, the 10th IEEE Wireless Communications and Networking Conference, pages 2108-2112. IEEE Communications Society, 2012. (PDF) (Preprint)
  • [HFP12] J. He, P. Flener, and J. Pearson. Solution neighbourhoods for constraint-directed local search. In: S. Bistarelli, E. Monfroy, and B. O'Sullivan (editors), SAC/CSP 2012, the track on Constraint Solving and Programming of the 27th ACM Symposium on Applied Computing, pages 74-79. ACM Press, 2012. (PDF) (Preprint)
  • [MFP12] T. Mancini, P. Flener, and J. Pearson. Combinatorial problem solving over relational databases: View synthesis through constraint-based local search. In: S. Bistarelli, E. Monfroy, and B. O'Sullivan (editors), SAC/CSP 2012, the track on Constraint Solving and Programming of the 27th ACM Symposium on Applied Computing, pages 80-87. ACM Press, 2012. (PDF) (Preprint)
  • [BCFP12] N. Beldiceanu, M. Carlsson, P. Flener, and J. Pearson. On the reification of global constraints. Technical Report T2012-02, Swedish Institute of Computer Science, 2012. (PDF) (summarised by the Constraints paper in 2013)
  • [HS12] H. Hellkvist and W. Sjöstedt. Toward Automated Timetabling at TekNat. Master Thesis in Information Technology, Report IT 12 001, Faculty of Science and Technology, Uppsala University, Sweden, 2012. (PDF)
  • [CM12] M. Carlsson and P. Mildner. SICStus Prolog - The first 25 years. Theory and Practice of Logic Programming, 12(1-2):35-66, 2012. (PDF) (not a UU publication)

2011

  • [KFSN11] R. Kameugne, L.P. Fotso, J. Scott, and Y. Ngo-Kateu. A quadratic edge-finding filtering algorithm for cumulative resource constraints. In: J.H.M. Lee (editor), CP 2011, pages 478-492. Lecture Notes in Computer Science, volume 6876. Springer, 2011. (PDF) (Preprint)
  • [Gum11] R. R. Gumucio Escobar. Constraints on Set Variables for Constraint-based Local Search. Master Thesis in Information Technology, Report IT 11 068, Faculty of Science and Technology, Uppsala University, Sweden, 2011. (PDF)
  • [Bal11] N. Baltzer. Backbone solver for water retaining magic squares via constraint based local search. Bachelor Thesis in Information Technology, Report IT 11 076, Faculty of Science and Technology, Uppsala University, Sweden, 2011. (PDF)
  • [FFP11] M. A. Francisco Rodriguez, P. Flener, and J. Pearson. Consistency of constraint networks induced by automaton-based constraint specifications. In: A. Rendl and Ch. Beck (editors), ModRef 2011, the 10th International Workshop on Constraint Modelling and Reformulation, held at CP 2011, 2011. (Preprint)
  • [Fra11] M. A. Francisco Rodriguez. Consistency of Constraint Networks Induced by Automaton-Based Constraint Specifications. Master Thesis in Information Technology, Report IT 11 049, Faculty of Science and Technology, Uppsala University, Sweden, 2011. (PDF)
  • [Alv11] C. E. Alvarez Divo. Automated Reasoning on Feature Models via Constraint Programming. Master Thesis in Information Technology, Report IT 11 041, Faculty of Science and Technology, Uppsala University, Sweden, 2011. (PDF)
  • [Jäg11] P. Jägare. Airspace Sectorisation Using Constraint Programming. Master Thesis in Information Technology, Report IT 11 021, Faculty of Science and Technology, Uppsala University, Sweden, 2011. (PDF)
  • [HFP11] J. He, P. Flener, and J. Pearson. An automaton constraint for local search. Fundamenta Informaticae, 107(2-3):223-248, 2011. (PDF) (Preprint)
  • [HBFNP11] F. Hassani Bijarbooneh, P. Flener, E. Ngai, and J. Pearson. Energy-efficient task-mapping for data-driven sensor network macroprogramming using constraint programming. In: R. Dell and K. Wood (editors), ICS 2011, the 12th INFORMS Computing Society Conference, pages 199-209. INFORMS Computing Society, 2011. (PDF, forthcoming) (Preprint)
  • [BCD+11] N. Beldiceanu, M. Carlsson, S. Demassey, and E. Poder. New filtering for the cumulative constraint in the context of non-overlapping rectangles. Annals of Operations Research, 184(1):27-50, 2011. (PDF) (not a UU publication)

2010

  • [SBFP10a] K. Sundequist Blomdahl, P. Flener, and J. Pearson. Contingency plans for air traffic management. In: D. Cohen (editor), CP 2010, pages 643-657. Lecture Notes in Computer Science, volume 6308. Springer, 2010. (PDF) (Preprint) (superseded by the Journal of Aerospace Operations paper in 2012)
  • [SDF+10] H. Simonis, P. Davern, J. Feldman, D. Mehta, L. Quesada, and M. Carlsson. A generic visualization platform for CP. In: D. Cohen (editor), CP 2010, pages 460-474. Lecture Notes in Computer Science, volume 6308. Springer, 2010. (PDF) (not a UU publication)
  • [SBFP10b] K. Sundequist Blomdahl, P. Flener, and J. Pearson. Contingency plans for air traffic flow and capacity management. In: D. Schaefer (editor), INO 2010, the 9th EuroControl Innovative Research Workshop & Exhibition, EUROCONTROL Experimental Centre, 2010. ISBN 978-2-87497-021-4. (Preprint) (superseded by the Journal of Aerospace Operations paper in 2012)
  • [Sco10] J. Scott. Filtering Algorithms for Discrete Cumulative Resources. Master Thesis in Information Technology, Report IT 10 048, Faculty of Science and Technology, Uppsala University, Sweden, 2010. (PDF)
  • [MFP10] T. Mancini, P. Flener, and J. Pearson. Local search over relational databases. In: Y. Deville and Ch. Solnon (editors), LSCS 2010, the 7th International Workshop on Local Search Techniques in Constraint Satisfaction, 2010. (Preprint)
  • [HBFNP10] F. Hassani Bijarbooneh, P. Flener, E. Ngai, and J. Pearson. Energy-efficient task-mapping for data-driven sensor network macroprogramming using constraint programming. In: T. Mancini and J. Pearson (editors), ModRef 2010, the 9th International Workshop on Constraint Modelling and Reformulation, 2010. (Revised PDF) (superseded by the ICS 2011 paper)
  • [FP10] P. Flener and J. Pearson (editors). SymCon 2010, the 10th International Workshop on Symmetry in Constraint Satisfaction Problems, held at CP 2010. (Proceedings)
  • [MP10] T. Mancini and J. Pearson (editors). ModRef 2010, the 9th International Workshop on Constraint Modelling and Reformulation. 2010. (Proceedings)
  • [Sun10] K. Sundequist Blomdahl. Contingency plans for air traffic management. Master Thesis in Information Technology, Report IT 10 020, Faculty of Science and Technology, Uppsala University, Sweden, 2010. (PDF)
  • [BCFP10] N. Beldiceanu, M. Carlsson, P. Flener, and J. Pearson. On matrices, automata, and double counting. In: A. Lodi, M. Milano, and P. Toth (editors), CP-AI-OR 2010, pages 10-24. Lecture Notes in Computer Science, volume 6140. Springer, 2010. (PDF) (Preprint) (superseded by the Constraints paper in 2013)
  • [ABC+10] A. Aggoun, N. Beldiceanu, M. Carlsson, and F. Fages. Integrating rule-based modelling and constraint programming for solving industrial packing problems. ERCIM News 81, April 2010. (PDF) (not a UU publication)

2009

  • [FPS+09] 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) (Preprint)
  • [MFHMP09] T. Mancini, P. Flener, A. Hossein Monshi, and J. Pearson. Constrained optimisation over massive databases. In: M. Gavanelli and T. Mancini (editors), RCRA 2009, the 16th RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2009. (PDF)
  • [Has09] F. Hassani Bijarbooneh. Dynamic Demand-Capacity Balancing for Air Traffic Management Using Constraint-Based Local Search. Master Thesis in Information Technology, Report IT 09 053, Faculty of Science and Technology, Uppsala University, Sweden, November 2009. (PDF)
  • [Xia09] P. Xiaoyue. Haplotype Inference by Pure Parsimony with Constraint Programming. Master Thesis in Information Technology, Report IT 09 050, Faculty of Science and Technology, Uppsala University, Sweden, October 2009. (PDF)
  • [HFP09] J. He, P. Flener, and J. Pearson. Toward an automaton constraint for local search. In: Y. Deville and Ch. Solnon (editors), LSCS 2009, the 6th International Workshop on Local Search Techniques in Constraint Satisfaction. Electronic Proceedings in Theoretical Computer Science, Volume 5, pages 13-25, 2009. (PDF) Also in: M. Gavanelli and T. Mancini (editors), RCRA 2009, the 16th RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2009. (superseded by the Fundamenta Informaticae paper in 2011)
  • [HBFP09] 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), LSCS 2009, the 6th International Workshop on Local Search Techniques in Constraint Satisfaction. Electronic Proceedings in Theoretical Computer Science, Volume 5, pages 27-40, 2009. (PDF) Also in: D. Schaefer (editor), INO 2009, the 8th EuroControl Innovative Research Workshop & Exhibition, 2009. (Preprint)
  • [Ågr09] M. Ågren. Memoisation for constraint-based local search. In: I.P. Gent (editor), CP 2009, pages 119-126. Lecture Notes in Computer Science, volume 5732. Springer, 2009. (PDF) (Preprint) (not a UU publication)
  • [FPS09] 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)
  • [ÅBC+09] M. Ågren, N. Beldiceanu, M. Carlsson, M. Sbihi, Ch. Truchet, and S. Zampelli. Six ways of integrating symmetries within non-overlapping constraints. In: W. J. van Hoeve and J. N. Hooker (editors), CP-AI-OR 2009, pages 11-25. Lecture Notes in Computer Science, volume 5547. Springer, 2009. (PDF) (not a UU publication)
  • [FP09] P. Flener and J. Pearson. Solving necklace constraint problems. Journal of Algorithms, 64(2-3):61-73, April-July 2009. (PDF)
  • [FCS09] P. Flener, M. Carlsson, and C. Schulte. Constraint programming in Sweden. IEEE Intelligent Systems 24(2):87-89, March/April 2009. (PDF)
  • [ÅFP09] M. Ågren, P. Flener, and J. Pearson. Revisiting constraint-directed search. Information and Computation 207(3):438-457, March 2009. (PDF)

2008

  • [BFL08] N. Beldiceanu, P. Flener, and X. Lorca. Combining tree partitioning, precedence, and incomparability constraints. Constraints 13(4):459-489, December 2008. (PDF) (Preprint)
  • [Edq08] S. Edqvist. Scheduling Physicians Using Constraint Programming. Master Thesis in Engineering Physics, Report UPTEC F08 064, Faculty of Science and Technology, Uppsala University, Sweden, November 2008. (PDF) (errata)
  • [SFP08] 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)
  • [FN08] P. Flener and Y. Naveh (editors). LSCS 2008, the 5th International Workshop on Local Search Techniques in Constraint Satisfaction. 2008. (Proceedings)
  • [FS08] P. Flener and H. Simonis (editors). ModRef 2008, the 7th International Workshop on Constraint Modelling and Reformulation. 2008. (Proceedings)
  • [FPS08] 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) (superseded by the Annals of Mathematics in Artificial Intelligence paper in 2009)
  • [FP08] P. Flener and J. Pearson. Solving necklace constraint problems. In: M. Ghallab (editor), ECAI 2008, pages 520-524. IOS Press, 2008. (PDF) (Preprint) (superseded by the Journal of Algorithms paper in 2009)
  • [FL08] P. Flener and X. Lorca. A complete characterisation of the classification tree problem. Technical Report 2008-018 at Department of Information Technology, Uppsala University, Sweden, June 2008. (PDF)

2007

  • [Ågr07] M. Ågren. Set Constraints for Local Search. PhD Thesis, Department of Information Technology, Uppsala University, Sweden, 2007. (PDF) (Errata)
  • [FPÅ+07c] 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)
  • [ÅFP07c] 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. (PDF) (Preprint)
  • [GKL+07] I.P. Gent, T. Kelsey, S. Linton, J. Pearson, and C. Roney-Dougal. Groupoids and conditional symmetry. In: Ch. Bessière (editor), CP 2007, pages 823-830. Lecture Notes in Computer Science, volume 4741. Springer, 2007. (PDF) (Preprint)
  • [ÅFP07b] M. Ågren, P. Flener, and J. Pearson. Revisiting constraint-directed search. In: Y. Naveh and A. Roli (editors), LSCS 2007, the 4th International Workshop on Local Search Techniques in Constraint Satisfaction, 2007. (Preprint) (superseded by the Information and Computation paper in 2009)
  • [FPÅ+07b] 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), ATM 2007, the 7th USA/Europe R&D Seminar on Air Traffic Management. Barcelona, Spain, July 2007. (Slides) (more recent Slides) (PDF) (slightly shorter version with permission in the JATM journal, November 2007)
  • [FPS+07b] P. Flener, J. Pearson, M. Sellmann, P. Van Hentenryck, and M. Ågren. Structural symmetry breaking for constraint satisfaction problems. Technical Report 2007-032 at Department of Information Technology, Uppsala University, Sweden, November 2007. (PDF) (superseded by the Constraints paper in 2009)
  • [FPRS07] 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) (Preprint)
  • [ÅFP07a] M. Ågren, P. Flener, and J. Pearson. On Constraint-Oriented Neighbours for Local Search. Technical Report 2007-009 at Department of Information Technology, Uppsala University, Sweden, March 2007. (PDF) (partially superseded by the Information and Computation paper in 2009)
  • [FPS+07a] 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), International Symmetry Conference. Edinburgh, UK, January 2007. (Preprint)
  • [FPÅ+07a] 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)

2006

  • [FPSV06] P. Flener, J. Pearson, M. Sellmann, and P. Van Hentenryck. Static and dynamic structural symmetry breaking. In: F. Benhamou (editor), CP 2006, pages 695-699. Lecture Notes in Computer Science, volume 4204. Springer, 2006. (PDF) (Preprint) (superseded by the Annals of Mathematics in Artificial Intelligence paper in 2009)
  • [ÅFP06b] M. Ågren, P. Flener, and J. Pearson. Inferring variable conflicts for local search. In: F. Benhamou (editor), CP 2006, pages 665-669. Lecture Notes in Computer Science, volume 4204. Springer, 2006. (PDF) (Preprint) (superseded by the Constraints paper in September 2007)
  • [BFL06b] N. Beldiceanu, P. Flener, and X. Lorca. Combining Tree Partitioning, Precedence, Incomparability, and Degree Constraints, with an Application to Phylogenetic and Ordered-Path Problems. Technical Report 2006-020 at Department of Information Technology, Uppsala University, Sweden, April 2006. (PDF) (superseded by the Constraints paper in December 2008)
  • [BFL06a] N. Beldiceanu, P. Flener, et X. Lorca. Partitionnement de graphes par des arbres sous contraintes de degré. (In French.) In: L. Henocque (editor), JFPC 2006, pages 35-42. INRIA, 2006. (PDF) (Preprint)
  • [Nor06] M. Norberg. Writing a Compiler for the Finite-Domain CSP Modelling Language ESRA. Master's Thesis in Computing Science, Department of Information Technology, Uppsala University, Sweden, March 2006. (PDF)
  • [ÅFP06a] 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. (PDF) (summarised by the CP'06 paper) (superseded by the Constraints paper in September 2007)

2005

  • [ÅFP05b] M. Ågren, P. Flener, and J. Pearson. Incremental algorithms for local search from existential second-order logic. In: P. van Beek (editor), CP 2005, pages 47-61. Lecture Notes in Computer Science, volume 3709. Springer, 2005. (PDF) (Preprint) (superseded by the Constraints paper in September 2007)
  • [Siv05] O. Sivertsson. Construction of Synthetic CDO Squared. Master's Thesis in Computing Science, Department of Information Technology, Uppsala University, Sweden, December 2005. (PDF)
  • [Öhr05] H. Öhrman. Breaking Symmetries in Matrix Models. Master's Thesis in Information Technology, Report UPTEC IT05 037, Faculty of Science and Technology, Uppsala University, Sweden, December 2005. (PDF)
  • [Eri05] M. Eriksson. Detecting Symmetries in Relational Models of CSPs. Master's Thesis in Computing Science, Department of Information Technology, Uppsala University, Sweden, November 2005. (PDF)
  • [Ågr05] M. Ågren. High-Level Modelling and Local Search. Licentiate Thesis 2005-003, Department of Information Technology, Uppsala University, Sweden, September 2005. (PDF)
  • [VFPÅ05] 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), SARA 2005, pages 234-247. Lecture Notes in Artificial Intelligence, volume 3607. Springer, 2005. (PDF) (Preprint)
  • [ÅFP05a] M. Ågren, P. Flener, and J. Pearson. Set variables and local search. In: R. Bartak and M. Milano (editors), CP-AI-OR 2005, pages 19-33. Lecture Notes in Computer Science, volume 3524. Springer, 2005. (PDF) (Preprint)
  • [BFL05] N. Beldiceanu, P. Flener, and X. Lorca. The tree constraint. In: R. Bartak and M. Milano (editors), CP-AI-OR 2005, pages 64-78. Lecture Notes in Computer Science, volume 3524. Springer, 2005. (PDF) (Preprint)

2004

  • [FPR04] P. Flener, J. Pearson, and L.G. Reyna. Financial portfolio optimisation. In: M. Wallace (editor), CP 2004, pages 227-241. Lecture Notes in Computer Science, volume 3258. Springer, 2004. (Abstract) (PDF) (Preprint) (Slides) (superseded by the Constraints paper in April 2007)
  • [Ågr04] M. Ågren. Set variables and local search (Abstract). In: M. Wallace (editor), CP 2004, p. 788. Lecture Notes in Computer Science, volume 3258. Springer, 2004. (superseded by the CPAIOR 2005 paper)
  • [FPÅ04] P. Flener, J. Pearson, and M. Ågren. Introducing ESRA, a relational language for modelling combinatorial problems. In: M. Bruynooghe (editor), LOPSTR 2003: Revised Selected Papers, pages 214-232. Lecture Notes in Computer Science, volume 3018. Springer, 2004. (PDF) (Preprint)
  • [FPÅ04] P. Flener, J. Pearson, and M. Ågren. The syntax, semantics, and type system of ESRA. ASTRA Research Report, August 2004. (PDF)
  • [HKMW04] B. Hnich, Z. Kiziltan, I. Miguel, and T. Walsh. Hybrid modelling for robust solving. Annals of Operations Research 130(1-4):19-39, 2004. (PDF)
  • [HSW04] B. Hnich, B.M. Smith, and T. Walsh. Dual modelling of permutation and injection problems. Journal of AI Research 21:357-391, 2004. (PDF)
  • [Kiz04b] Z. Kiziltan. Symmetry breaking ordering constraints. AI Communications 17(3):167-169, 2004. (PDF)
  • [Kiz04a] Z. Kiziltan. Symmetry Breaking Ordering Constraints. PhD Thesis, Department of Information Science, Uppsala University, Sweden, 2004. (PDF)
  • [Pea04] J. Pearson. Comma-free codes. In: P. van Beek (editor), AI&M 2004. (Preprint)

2003

  • [VFPÅ03] P. Van Hentenryck, P. Flener, J. Pearson, and M. Ågren. Tractable symmetry breaking for CSPs with interchangeable values. In IJCAI 2003, pages 277-282. Morgan Kaufmann Publishers, 2003. (PDF) (superseded by the Constraints paper in 2009)
  • [FPÅ03d] P. Flener, J. Pearson, and M. Ågren. Introducing ESRA, a relational language for modelling combinatorial problems. In: A.M. Frisch (editor), Second International Workshop on Modelling and Reformulating CSPs, held at CP 2003, pages 161-167. (PDF) (superseded by the LOPSTR 2003 paper in 2004)
  • [FPÅ03c] P. Flener, J. Pearson, and M. Ågren. Introducing ESRA, a relational language for modelling combinatorial problems (Abstract). In: F. Rossi (editor), CP 2003, p. 971. Lecture Notes in Computer Science, volume 2833. Springer, 2003. (PDF) (superseded by the LOPSTR 2003 paper in 2004)
  • [Kiz03] Z. Kiziltan. Symmetry breaking ordering constraints. In: F. Rossi (editor), CP 2003, p. 979. Lecture Notes in Computer Science, volume 2833. Springer, 2003. (PDF)
  • [Pea03] J. Pearson. Comma-free codes. In SymCon 2003, the Third International Workshop on Symmetry in CSPs, held at CP 2003, pages 63-77. (Preprint) (superseded by the AI&M 2004 paper)
  • [FPÅ03b] P. Flener, J. Pearson, and M. Ågren. Introducing ESRA, a relational language for modelling combinatorial problems (Extended abstract). In: M. Bruynooghe (editor), Pre-Proceedings of LOPSTR 2003, pages 239-248. Technical Report CW 365 at Department of Computer Science, KU Leuven, Belgium, 2003. (superseded by the LOPSTR 2003 paper in 2004)
  • [FPÅ03a] P. Flener, J. Pearson, and M. Ågren. The syntax, semantics, and type system of ESRA. ASTRA Research Report, April 2003. (superseded by the August 2004 version)
  • [FFH+03] P. Flener, A.M. Frisch, B. Hnich, Ch. Jefferson, Z. Kiziltan, I. Miguel, J. Pearson, and T. Walsh. Breaking symmetries in matrix models: A brief overview. In ARW 2003. (Postscript) (Preprint)
  • [Hni03b] B. Hnich. Function variables for constraint programming. AI Communications 16(2):131-132, 2003. (PDF)
  • [HRF03] B. Hnich, J.D.C. Richardson, and P. Flener. Towards automatic generation and evaluation of implied constraints. Technical Report 2003-014 at Department of Information Technology, Uppsala University, Sweden, 2003.
  • [RF03] J.D.C. Richardson and P. Flener. Program schemas as proof methods. Technical Report 2003-008 at Department of Information Technology, Uppsala University, Sweden, 2003.
  • [Hni03a] B. Hnich. Function Variables for Constraint Programming. PhD Thesis, Department of Information Science, Uppsala University, Sweden, 2003. (PDF)

2002

  • [FFH+02c] 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 (editor), CP 2002, pages 462-476. Lecture Notes in Computer Science, volume 2470. Springer, 2002. (PDF) (Preprint) (Slides)
  • [FHK+02] A.M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, and T. Walsh. Global constraints for lexicographic orderings. In: P. Van Hentenryck (editor), CP 2002, pages 93-108. Lecture Notes in Computer Science, volume 2470. Springer, 2002. (PDF)
  • [HW02b] B. Hnich and T. Walsh. Models of injection problems (Abstract). In: P. Van Hentenryck (editor), CP 2002, p. 781. Lecture Notes in Computer Science, volume 2470. Springer, 2002. (PDF) (superseded by the Journal of Artificial Intelligence Research paper in 2004)
  • [Kiz02] Z. Kiziltan. Reducing symmetry in matrix models (Abstract). In: P. Van Hentenryck (editor), CP 2002, p. 786. Lecture Notes in Computer Science, volume 2470. Springer, 2002. (PDF)
  • [FP02] P. Flener and J. Pearson. Breaking all the symmetries in matrix models: Results, conjectures, and directions. In: P. Flener and J. Pearson (editors), SymCon 2002, the Second International Workshop on Symmetry in CSPs, held at CP 2002. (PDF) (Slides)
  • [KM02] Z. Kiziltan and M. Milano. Group-graphs associated with row and column symmetries of matrix models: Some observations. In: P. Flener and J. Pearson (editors), SymCon 2002, the Second International Workshop on Symmetry in CSPs, held at CP 2002. (PDF)
  • [KS02] Z. Kiziltan and B.M. Smith. Symmetry breaking constraints for matrix models. In: P. Flener and J. Pearson (editors), SymCon 2002, the Second International Workshop on Symmetry in CSPs, held at CP 2002. (PDF)
  • [KW02] Z. Kiziltan and T. Walsh. Constraint programming with multisets. In: P. Flener and J. Pearson (editors), SymCon 2002, the Second International Workshop on Symmetry in CSPs, held at CP 2002. (PDF)
  • [FFH+02b] P. Flener, A.M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, and T. Walsh. Matrix modelling: Exploiting common patterns in constraint programming. In: A.M. Frisch (editor), International Workshop on Reformulating CSPs, held at CP 2002. (Postscript) (Preprint)
  • [FHM+02] A.M. Frisch, B. Hnich, I. Miguel, B.M. Smith, and T. Walsh. Towards CSP model reformulation at multiple levels of abstraction. In: A.M. Frisch (editor), International Workshop on Reformulating CSPs, held at CP 2002. (Postscript)
  • [FP02] P. Flener and J. Pearson (editors). SymCon'02, the 2nd International Workshop on Symmetry in Constraint Satisfaction Problems, held at CP 2002. (Proceedings)
  • [Wra02] S. Wrang. Implementation of the ESRA Constraint Modelling Language. Master's Thesis in Computing Science 223, Department of Information Technology, Uppsala University, Sweden, 2002. (PDF)
  • [FFH+02a] P. Flener, A.M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, J. Pearson, and T. Walsh. Breaking row and column symmetry in matrix models. In: T. Vidal and P. Liberatore (editors), STAIRS 2002. IOS Press, 2002. (Preprint) (short version of the CP 2002 paper)
  • [HW02a] B. Hnich and T. Walsh. Models of injection problems. In: T. Walsh (editor), ECAI 2002 Workshop on Modelling and Solving Problems with Constraints. (superseded by the Journal of Artificial Intelligence Research paper in 2004)
  • [Fle02] P. Flener. Program synthesis for combinatorial optimisation problems: Position statement. In: B. Fischer and D. Smith (editors), AAAI 2002 Spring Symposium on the State of the Art and Future Trends of Logic-based Program Synthesis. (Preprint)
  • [HKW02] B. Hnich, Z. Kiziltan, and T. Walsh. Modelling a balanced academic curriculum problem. In: N. Jussien and F. Laburthe (editors), CP-AI-OR 2002. (PDF) (superseded by the Annals of Operations Research paper in 2004)
  • [Pea02] J. Pearson. Reducing the number of constraints needed during symmetry breaking during search. Unpublished ASTRA report, January 2002. (PDF)

2001

  • [FFH+01b] P. Flener, A.M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, and T. Walsh. Matrix modelling. In: P. Prosser (editor), Formul 2001, the CP 2001 Workshop on Modelling and Problem Formulation, 2001. (Postscript) (Preprint)
  • [FFH+01a] P. Flener, A.M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, J. Pearson, and T. Walsh. Symmetry in matrix models. In: P. Flener and J. Pearson (editors), SymCon 2001, the First International Workshop on Symmetry in CSPs, held at CP 2001. (Preprint)
  • [FP01] P. Flener and J. Pearson (editors). SymCon 2001, the 1st International Workshop on Symmetry in Constraint Satisfaction Problems, held at CP 2001. (Proceedings)
  • [KFH01] Z. Kiziltan, P. Flener, and B. Hnich. Towards inferring labelling heuristics for CSP application domains. In: F. Baader, G. Brewka, and T. Eiter (editors), KI 2001, pages 275-289. Lecture Notes in Artificial Intelligence, volume 2174. Springer, 2001. (PDF) (Preprint)
  • [Fle01] P. Flener. Towards relational modelling of combinatorial optimisation problems. In: Ch. Bessière (editor), IJCAI 2001 Workshop on Modelling and Solving Problems with Constraints, pages 31-38, 2001. (Postscript) (Preprint)
  • [KH01] Z. Kiziltan and B. Hnich. Symmetry breaking in a rack configuration problem. In: Ch. Bessière (editor), IJCAI 2001 Workshop on Modelling and Solving Problems with Constraints, pages 83-88, 2001. (Postscript)
  • [HF01] B. Hnich and P. Flener. High-level reformulation of constraint programs. In: Ph. Codognet (editor), JFPLC 2001, pages 75-89. Éditions Hermès, 2001. (Preprint)
  • [FH01] P. Flener and B. Hnich. The syntax and semantics of ESRA. ASTRA report, March 2001. (PDF) (superseded by the 2004 version)
  • [FHK01b] P. Flener, B. Hnich, and Z. Kiziltan. Compiling high-level type constructors in constraint programming. In: I.V. Ramakrishnan (editor), PADL 2001, pages 229-244. Lecture Notes in Computer Science, volume 1990. Springer, 2001. (PDF) (Preprint)
  • [FHK01a] P. Flener, B. Hnich, and Z. Kiziltan. A meta-heuristic for subset problems. In: I.V. Ramakrishnan (editor), PADL 2001, pages 274-287. Lecture Notes in Computer Science, volume 1990. Springer, 2001. (PDF) (Preprint)

2000

  • [HKF00] B. Hnich, Z. Kiziltan, and P. Flener. A meta-heuristic for subset decision problems. In: K.R. Apt, E. Monfroy, and F. Rossi (editors), ERCIM / CompuLog Workshop on Constraint Programming 2000. (Preprint) (superseded by the PADL 2001 paper)
  • [HRF00] B. Hnich, J. Richardson, and P. Flener. Towards automatic generation and evaluation of implied constraints. Unfinished technical report, but of historical importance, August 2000. (PDF) (partially published as Technical Report 2003-014)

1999

  • [FR99] P. Flener and J. Richardson. A unified view of programming schemas and proof methods. In: A. Bossi (editor), Pre-Proceedings of LOPSTR 1999, pages 75-82. Technical Report CS-99-16, University of Venice, Italy, 1999. (Preprint)
  • [FHK99] P. Flener, B. Hnich, and Z. Kiziltan. Towards schema-guided compilation of set constraint programs. In: G. Rossi and B. Jayaraman (editors), DPS 1999, pages 59-66. Technical Report 200, Mathematics Department, University of Parma, Italy, 1999. (Preprint)
  • [HK99] B. Hnich and Z. Kiziltan. Generating programs for k-subset problems. In: P. Alexander (editor), ASE 1999 Doctoral Symposium, 1999. (Preprint)
  • [Kiz99] Z. Kiziltan. Schema-Guided Synthesis of Constraint Logic Programs. Master's Thesis, Uppsala University, Sweden, 1999.
  • [ZFH99] H. Zidoum, P. Flener, and B. Hnich. Schema-guided synthesis of CLP programs (Extended Abstract). In: P. Flener (editor), LOPSTR 1998: Selected Papers, pages 309-312. Lecture Notes in Computer Science, volume 1559. Springer, 1999. (PDF) (Preprint) (superseded by the ASE 1998 paper)

1998

  • [FZH98] P. Flener, H. Zidoum, and B. Hnich. Schema-guided synthesis of constraint logic programs. In: D.F. Redmiles and B. Nuseibeh (editors), ASE 1998, pages 168-176. IEEE Computer Society Press, 1998. (PDF) (Preprint)
  • [ZFH98] H. Zidoum, P. Flener, and B. Hnich. Schema-guided synthesis of constraint logic programs (extended abstract). In: P. Flener and K.-K. Lau (editors), Pre-Proceedings of LOPSTR 1998, pages 130-137. Technical Report UMCS-98-6-1, Department of Computer Science, University of Manchester, UK, 1998. (Postscript) (superseded by the ASE 1998 paper)
Updated  2017-07-24 16:41:08 by Pierre Flener.