uu.seUppsala University Publications
Change search
Refine search result
123 1 - 50 of 106
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1. Alexander, Perry
    et al.
    Flener, PierreUppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. CSD.
    Special Issue on ASE'002003Collection (editor) (Other scientific)
  • 2. Allignol, Cyril
    et al.
    Barnier, Nicolas
    Flener, Pierre
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Constraint programming for air traffic management: a survey2012In: Knowledge engineering review (Print), ISSN 0269-8889, E-ISSN 1469-8005, Vol. 27, no 3, p. 361-392Article, review/survey (Refereed)
  • 3.
    Amadini, Roberto
    et al.
    University of Melbourne, Melbourne, Australia.
    Flener, Pierre
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Scott, Joseph D.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Stuckey, Peter J.
    University of Melbourne, Melbourne, Australia.
    Tack, Guido
    Monash University, Melbourne, Australia.
    MiniZinc with strings2017In: Logic-Based Program Synthesis and Transformation, Springer, 2017, p. 59-75Conference paper (Refereed)
    Abstract [en]

    Strings are extensively used in modern programming languages and constraints over strings of unknown length occur in a wide range of real-world applications such as software analysis and verification, testing, model checking, and web security. Nevertheless, practically no constraint programming solver natively supports string constraints. We introduce string variables and a suitable set of string constraints as builtin features of the MiniZinc modelling language. Furthermore, we define an interpreter for converting a MiniZinc model with strings into a FlatZinc instance relying only on integer variables. This conversion is obtained via rewrite rules, and does not require any extension of the existing FlatZinc specification. This provides a user-friendly interface for modelling combinatorial problems with strings, and enables both string and non-string solvers to actually solve such problems.

  • 4. Arafailova, Ekaterina
    et al.
    Beldiceanu, Nicolas
    Carlsson, Mats
    Flener, Pierre
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Francisco Rodríguez, María Andreína
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Simonis, Helmut
    Systematic derivation of bounds and glue constraints for time-series constraints2016In: Principles and Practice of Constraint Programming: CP 2016, Springer, 2016, p. 13-29Conference paper (Refereed)
  • 5. Arafailova, Ekaterina
    et al.
    Beldiceanu, Nicolas
    Douence, Rémi
    Carlsson, Mats
    Flener, Pierre
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Francisco Rodríguez, María Andreína
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Simonis, Helmut
    Global Constraint Catalog: Volume II, time-series constraints2016Report (Other academic)
  • 6. Arafailova, Ekaterina
    et al.
    Beldiceanu, Nicolas
    Douence, Rémi
    Flener, Pierre
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Francisco Rodríguez, María Andreína
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Simonis, Helmut
    Time-series constraints: Improvements and application in CP and MIP contexts2016In: Integration of AI and OR Techniques in Constraint Programming, Springer, 2016, p. 18-34Conference paper (Refereed)
  • 7. Basin, David
    et al.
    Deville, Yves
    Flener, Pierre
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    Hamfelt, Andreas
    Humanistisk-samhällsvetenskapliga vetenskapsområdet, Faculty of Social Sciences, Department of Information Science. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science.
    Fischer Nilsson, Jorgen
    Synthesis of Programs in Computational Logic2004In: Program Development in Computational Logic, Springer-Verlag , 2004, p. 30-65Chapter in book (Refereed)
  • 8. Beldiceanu, Nicolas
    et al.
    Carlsson, Mats
    Flener, Pierre
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Francisco Rodríguez, María Andreína
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Linking prefixes and suffixes for constraints encoded using automata with accumulators2014In: Principles and Practice of Constraint Programming: CP 2014, Springer, 2014, p. 142-157Conference paper (Refereed)
  • 9. Beldiceanu, Nicolas
    et al.
    Carlsson, Mats
    Flener, Pierre
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Lorca, Xavier
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Petit, Thierry
    Prud'homme, Charles
    A modelling pearl with sortedness constraints2015In: Global Conference on Artificial Intelligence: GCAI 2015, Manchester, UK: Cool Press , 2015, p. 27-41Conference paper (Refereed)
  • 10. Beldiceanu, Nicolas
    et al.
    Carlsson, Mats
    Flener, Pierre
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    On matrices, automata, and double counting2010In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Berlin: Springer-Verlag , 2010, p. 10-24Conference paper (Refereed)
  • 11. Beldiceanu, Nicolas
    et al.
    Carlsson, Mats
    Flener, Pierre
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    On matrices, automata, and double counting in constraint programming2013In: Constraints, ISSN 1383-7133, E-ISSN 1572-9354, Vol. 18, no 1, p. 108-140Article in journal (Refereed)
  • 12. Beldiceanu, Nicolas
    et al.
    Carlsson, Mats
    Flener, Pierre
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    On the reification of global constraints2013In: Constraints, ISSN 1383-7133, E-ISSN 1572-9354, Vol. 18, no 1, p. 1-6Article in journal (Refereed)
  • 13. Beldiceanu, Nicolas
    et al.
    Flener, Pierre
    Uppsala University, Disciplinary Domain of Science and Technology, Biology, Department of Cell and Molecular Biology, The Linnaeus Centre for Bioinformatics. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Lorca, Xavier
    Combining tree partitioning, precedence, and incomparability constraints2008In: Constraints, ISSN 1383-7133, E-ISSN 1572-9354, Vol. 13, no 4, p. 459-489Article in journal (Refereed)
  • 14. Beldiceanu, Nicolas
    et al.
    Flener, Pierre
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. CSD.
    Lorca, Xavier
    Combining Tree Partitioning, Precedence, Incomparability, and Degree Constraints, with an Application to Phylogenetic and Ordered-Path Problems2006Report (Other scientific)
  • 15. Beldiceanu, Nicolas
    et al.
    Flener, Pierre
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. CSD.
    Lorca, Xavier
    Partitionnement de graphes par des arbres sous contraintes de degré2006In: Deuxièmes Journées Francophones de Programmation par Contraintes (JFPC'06), 2006Conference paper (Refereed)
  • 16. Beldiceanu, Nicolas
    et al.
    Flener, Pierre
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, The Linnaeus Centre for Bioinformatics. Department of Ecology and Evolution, Computing Science. Datalogi.
    Lorca, Xavier
    The tree constraint2005In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: Second International Conference, CPAIOR 2005, Proceedings, 2005, p. 64-78Conference paper (Refereed)
  • 17. Beldiceanu, Nicolas
    et al.
    Flener, Pierre
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Monette, Jean-Noël
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Simonis, Helmut
    Toward sustainable development in constraint programming2014In: Constraints, ISSN 1383-7133, E-ISSN 1572-9354, Vol. 19, no 2, p. 139-149Article in journal (Refereed)
  • 18. Beldiceanu, Nicolas
    et al.
    Flener, Pierre
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Van Hentenryck, Pascal
    Propagating regular counting constraints2014In: Proc. 28th AAAI Conference on Artificial Intelligence: Volume 4, Palo Alto, CA: AAAI Press, 2014, p. 2616-2622Conference paper (Refereed)
  • 19.
    Björdal, Gustav
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Flener, Pierre
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Generating compound moves in local search by hybridisation with complete search2019In: Integration of Constraint Programming, Artificial Intelligence, and Operations Research / [ed] L.-M. Rousseau and K. Stergiou, Springer, 2019, Vol. 11494, p. 95-111Conference paper (Refereed)
    Abstract [en]

    A black-box local-search backend to a solving-technology-independent modelling language, such as MiniZinc, automatically infers from the structure of a declarative model for a satisfaction or optimisation problem a combination of a neighbourhood, heuristic, and meta-heuristic. These ingredients are then provided to a local-search solver, but are manually designed in a handcrafted local-search algorithm. However, such a backend can perform poorly due to model structure that is inappropriate for local search, for example when it considers moves modifying only variables that represent auxiliary information. Towards overcoming such inefficiency, we propose compound-move generation, an extension to local-search solvers that uses a complete-search solver in order to augment moves modifying non-auxiliary variables so that they also modify auxiliary ones. Since compound-move generation is intended to be applied to such models, we discuss how to identify them.

    We present several refinements of compound-move generation and show its very positive impact on several third-party models. This helps reduce the unavoidable gap between black-box local search and local-search algorithms crafted by experts.

  • 20.
    Björdal, Gustav
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Flener, Pierre
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Stuckey, Peter J.
    Faculty of Information Technology, Monash University, Melbourne, Australia.
    Exploring declarative local-search neighbourhoods with constraint programming2019In: Principles and Practice of Constraint Programming / [ed] Thomas Schiex and Simon de Givry, Switzerland: Springer, 2019, Vol. 11802, p. 37-53Conference paper (Refereed)
    Abstract [en]

    Using constraint programming (CP) to explore a local-search neighbourhood was first tried in the mid 1990s. The advantage is that constraint propagation can quickly rule out uninteresting neighbours, sometimes greatly reducing the number actually probed. However, a CP model of the neighbourhood has to be handcrafted from the model of the problem: this can be difficult and tedious. That research direction appears abandoned since large-neighbourhood search (LNS) and constraint-based local search (CBLS) arose as alternatives that seem easier to use. Recently, the notion of declarative neighbourhood was added to the technology-independent modelling language MiniZinc, for use by any backend to MiniZinc, but currently only used by a CBLS backend. We demonstrate that declarative neighbourhoods are indeed technology-independent by using the old idea of CP-based neighbourhood exploration: we explain how to encode automatically a declarative neighbourhood into a CP model of the neighbourhood. This enables us to lift any CP solver into a local-search backend to MiniZinc. Our prototype is competitive with CP, CBLS, and LNS backends to MiniZinc.

  • 21.
    Björdal, Gustav
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Flener, Pierre
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Stuckey, Peter J.
    Tack, Guido
    Declarative local-search neighbourhoods in MiniZinc2018In: PROCEEDINGS OF THE 2018 IEEE 30TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI), IEEE Computer Society, 2018, p. 98-105Conference paper (Refereed)
    Abstract [en]

    The aim of solver-independent modelling is to create a model of a satisfaction or optimisation problem independent of a particular technology. This avoids early commitment to a solving technology and allows easy comparison of technologies. MiniZinc is a solver-independent modelling language, supported by CP, MIP, SAT, SMT, and constraint-based local search (CBLS) backends. Some technologies, in particular CP and CBLS, require not only a model but also a search strategy. While backends for these technologies offer default search strategies, it is often beneficial to include in a model a user-specified search strategy for a particular technology, especially if the strategy can encapsulate knowledge about the problem structure. This is complex since a local-search strategy (comprising a neighbourhood, a heuristic, and a meta-heuristic) is often tightly tied to the model. Hence we wish to use the same language for specifying the model and the local search. We show how to extend MiniZinc so that one can attach a fully declarative neighbourhood specification to a model, while maintaining the solver-independence of the language. We explain how to integrate a model-specific declarative neighbourhood with an existing CBLS backend for MiniZinc.

  • 22.
    Björdal, Gustav
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Monette, Jean-Noël
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Flener, Pierre
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    A constraint-based local search backend for MiniZinc2015In: Constraints, ISSN 1383-7133, E-ISSN 1572-9354, Vol. 20, no 3, p. 325-345Article in journal (Refereed)
  • 23. Dekker, Jip J.
    et al.
    Björdal, Gustav
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Carlsson, Mats
    Flener, Pierre
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Monette, Jean-Noël
    Auto-tabling for subproblem presolving in MiniZinc2017In: Constraints, ISSN 1383-7133, E-ISSN 1572-9354, Vol. 22, no 4, p. 512-529Article in journal (Refereed)
  • 24.
    Flener, P
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Computing science.
    Frisch, A
    Humanistisk-samhällsvetenskapliga vetenskapsområdet, Faculty of Social Sciences, Department of Information Science.
    Hnich, B
    Humanistisk-samhällsvetenskapliga vetenskapsområdet, Faculty of Social Sciences, Department of Information Science.
    Kiziltan, Z
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology.
    Miguel, I
    Walsh, T
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology.
    Matrix modelling2001In: Proc. of Formul'01, the CP'01 Workshop on Modelling and Problem Formulation, 2001Conference paper (Refereed)
  • 25.
    Flener, P
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Computing science.
    Frisch, AM
    Humanistisk-samhällsvetenskapliga vetenskapsområdet, Faculty of Social Sciences, Department of Information Science. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science.
    Hnich, B
    Humanistisk-samhällsvetenskapliga vetenskapsområdet, Faculty of Social Sciences, Department of Information Science. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science.
    Kiziltan, Z
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science.
    Miguel, I
    Pearson, J
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science.
    Walsh, T
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science.
    Symmetry in matrix models2001In: Proc. of SymCon'01, the First International Workshop on Symmetry in CSPs, 2001, p. 41-47Conference paper (Refereed)
  • 26.
    Flener, P
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Computing science.
    Partridge, D
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Computing science.
    Inductive Programming2001In: Automated Software Engineering Journal, Vol. 8, no 2, p. 131-137Article in journal (Refereed)
  • 27.
    Flener, Pierre
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. CSD.
    Achievements and prospects of program synthesis2002In: Computational Logic: Logic Programming and Beyond;Computational Logic: Logic Programming and Beyond; Essays in Honour of Robert A. Kowalski, Springer-Verlag , 2002, p. 310-346Chapter in book (Refereed)
  • 28.
    Flener, Pierre
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. CSD.
    Program synthesis for combinatorial optimisation problems: Position statement2002In: Working Notes of the AAAI'02 Spring Symposium on the State of the Art and Future Trends of Logic-based Program Synthesis, 2002Conference paper (Refereed)
  • 29.
    Flener, Pierre
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. CSD.
    Realism in project-based software engineering courses: Rewards, risks, and recommendations2006In: International Symposium on Computer and Information Sciences (ISCIS'06), 2006Conference paper (Refereed)
  • 30.
    Flener, Pierre
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Carlsson, Mats
    Schulte, Christian
    Constraint Programming in Sweden2009In: IEEE Intelligent Systems, ISSN 1541-1672, Vol. 24, no 2, p. 87-89Article, review/survey (Other academic)
  • 31.
    Flener, Pierre
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. CSD.
    Frisch, Alan M.
    Hnich, Brahim
    Humanistisk-samhällsvetenskapliga vetenskapsområdet, Faculty of Social Sciences, Department of Information Science. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Jefferson, Chris
    Kiziltan, Zeynep
    Humanistisk-samhällsvetenskapliga vetenskapsområdet, Faculty of Social Sciences, Department of Information Science. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Miguel, Ian
    Pearson, Justin
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. DoCS.
    Walsh, Toby
    Breaking symmetries in matrix models: A brief overview.2003In: Proceedings of the Tenth Workshop on Automated Reasoning (ARW'03), 2003Conference paper (Other scientific)
  • 32.
    Flener, Pierre
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Frisch, Alan M.
    Hnich, Brahim
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Social Sciences, Department of Information Science, Computer Systems Sciences.
    Kiziltan, Zeynep
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Social Sciences, Department of Information Science, Computer Systems Sciences.
    Miguel, Ian
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Walsh, Toby
    Breaking row and column symmetries in matrix models2002In: Principles and Practice of Constraint Programming – CP 2002, Berlin: Springer-Verlag , 2002, p. 462-476Conference paper (Refereed)
  • 33.
    Flener, Pierre
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. CSD.
    Frisch, Alan M.
    Hnich, Brahim
    Humanistisk-samhällsvetenskapliga vetenskapsområdet, Faculty of Social Sciences, Department of Information Science. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science.
    Kiziltan, Zeynep
    Humanistisk-samhällsvetenskapliga vetenskapsområdet, Faculty of Social Sciences, Department of Information Science. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science.
    Miguel, Ian
    Walsh, Toby
    Matrix modelling: Exploiting common patterns in constraint programming2002In: Proceedings of the International Workshop on Reformulating CSPs, 2002Conference paper (Refereed)
  • 34.
    Flener, Pierre
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Computing science.
    Hnich, Brahim
    Humanistisk-samhällsvetenskapliga vetenskapsområdet, Faculty of Social Sciences, Department of Information Science.
    Kiziltan, Zeynep
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology.
    Towards schema-guided compilation of set constraint programs1999In: Proc. of DPS'99, 1999, p. 59-66Conference paper (Other scientific)
  • 35.
    Flener, Pierre
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Naveh, Yehuda
    Proceedings of LSCS'08, the Fifth International Workshop on Local Search Techniques in Constraint Satisfaction2008Conference proceedings (editor) (Other academic)
  • 36.
    Flener, Pierre
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Automatic airspace sectorisation: A survey2013Report (Other academic)
  • 37.
    Flener, Pierre
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. CSD.
    Pearson, Justin
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. DoCS.
    Breaking all the symmetries in matrix models: Results, conjectures, and directions2002In: Proceedings of SymCon'02, the Second International Workshop on Symmetry in CSPs, 2002Conference paper (Refereed)
  • 38.
    Flener, Pierre
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, JustinUppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Proc. 10th International Workshop on Symmetry in Constraint Satisfaction Problems2010Conference proceedings (editor) (Refereed)
  • 39.
    Flener, Pierre
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    Pearson, JustinUppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datorteknik.
    Proceedings of SymCon'01, the First International Workshop on Symmetry in CSPs2001Conference proceedings (editor) (Refereed)
  • 40.
    Flener, Pierre
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datalogi.
    Pearson, JustinUppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Proceedings of SymCon'02, the Second International Workshop on Symmetry in CSPs2002Conference proceedings (editor) (Refereed)
  • 41.
    Flener, Pierre
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Propagators and violation functions for geometric and workload constraints arising in airspace sectorisation2014Report (Other academic)
  • 42.
    Flener, Pierre
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Solving necklace constraint problems2009In: Journal of Algorithms, ISSN 0196-6774, E-ISSN 1090-2678, Vol. 64, no 2-3, p. 61-73Article in journal (Refereed)
  • 43.
    Flener, Pierre
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Solving necklace constraint problems2008In: Proc. 18th European Conference on Artificial Intelligence, Amsterdam, The Netherlands: IOS Press , 2008, p. 520-524Conference paper (Refereed)
  • 44.
    Flener, Pierre
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datalogi.
    Pearson, Justin
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Worst-case air-traffic generation using constraint programming2004Report (Other scientific)
  • 45.
    Flener, Pierre
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Bourgois, Marc
    Constraint Programming for Air Traffic Management: Preface2012In: Knowledge engineering review (Print), ISSN 0269-8889, E-ISSN 1469-8005, Vol. 27, no 3, p. 287-289Article in journal (Refereed)
  • 46.
    Flener, Pierre
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datalogi.
    Pearson, Justin
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Reyna, Luis G.
    Merrill Lynch, USA.
    Financial portfolio optimisation2004In: 10th International Conference on Principles and Practice of Constraint Programming: CP 2004, 2004, p. 227-241Conference paper (Refereed)
  • 47.
    Flener, Pierre
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Reyna, Luis G.
    Sivertsson, Olof
    Design of financial CDO squared transactions using constraint programming2007In: Constraints, ISSN 1383-7133, E-ISSN 1572-9354, Vol. 12, no 2, p. 179-205Article in journal (Refereed)
  • 48.
    Flener, Pierre
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Sellmann, Meinolf
    Static and dynamic structural symmetry breaking2009In: Annals of Mathematics and Artificial Intelligence, ISSN 1012-2443, E-ISSN 1573-7470, Vol. 57, no 1, p. 37-57Article in journal (Refereed)
  • 49.
    Flener, Pierre
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. CSD.
    Pearson, Justin
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. DoCS.
    Sellmann, Meinolf
    Van Hentenryck, Pascal
    Static and dynamic structural symmetry breaking2006In: Twelfth International Conference on Principles and Practice of Constraint Programming (CP'06), 2006Conference paper (Refereed)
  • 50.
    Flener, Pierre
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Sellmann, Meinolf
    Van Hentenryck, Pascal
    Ågren, Magnus
    Dynamic structural symmetry breaking for constraint satisfaction problems2009In: Constraints, ISSN 1383-7133, E-ISSN 1572-9354, Vol. 14, no 4, p. 506-538Article in journal (Refereed)
123 1 - 50 of 106
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf