uu.seUppsala University Publications
Change search
Refine search result
12 1 - 50 of 97
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. 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)
  • 2.
    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.

  • 3. 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)
  • 4. 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)
  • 5. 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)
  • 6. Balck, Kenneth
    et al.
    Grinchtein, Olga
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Model-based protocol log generation for testing a telecommunication test harness using CLP2014In: Proc. 17th Conference on Design, Automation and Test in Europe, Piscataway, NJ: IEEE , 2014Conference paper (Refereed)
  • 7. Balck, Kenneth
    et al.
    Grinchtein, Olga
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Model-based protocol log generation for testing a telecommunication test harness using CLP2014In: 2014 DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION (DATE), 2014Conference paper (Refereed)
    Abstract [en]

    Within telecommunications development it is vital to have frameworks and systems to replay complicated scenarios on equipment under test, often there are not enough available scenarios. In this paper we study the problem of testing a test harness, which replays scenarios and analyses protocol logs for the Public Warning System service, which is a part of the Long Term Evolution (LTE) 4G standard. Protocol logs are sequences of messages with timestamps; and are generated by different mobile network entities. In our case study we focus on user equipment protocol logs. In order to test the test harness we require that logs have both incorrect and correct behaviour. It is easy to collect logs from real system runs, but these logs do not show much variation in the behaviour of system under test. We present an approach where we use constraint logic programming (CLP) for both modelling and test generation, where each test case is a protocol log. In this case study, we uncovered previously unknown faults in the test harness.

  • 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, 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)
  • 14. 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)
  • 15.
    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.

  • 16.
    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.

  • 17.
    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.

  • 18.
    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)
  • 19.
    Carlsson, Mats
    et al.
    SICS, Stockholm, Sweden.
    Grinchtein, Olga
    Ericsson AB, Stockholm, Sweden.
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Modelling and verification of user interactions using constraint programming2017In: Proc. 3rd International Conference on Software Quality, Reliability and Security, IEEE Computer Society, 2017, p. 541-547Conference paper (Refereed)
    Abstract [en]

    Graphical user interfaces are important components of today's software. User interfaces often require checking correctness of user interactions. In web applications such checks can be a part of the JavaScript code. User interfaces in web applications can evolve, some elements can be removed and new elements can be added. To check JavaScript code covers all possible incorrect scenarios in user interactions in web application, constraint programming is used. We use the MiniZinc constraint modelling language to model incorrect user behaviour and to convert JavaScript code into a constraint model. Then we perform an equivalence check to find deviations in JavaScript code. The approach was applied to design user interface of an industrial software product.

  • 20. Carlsson, Mats
    et al.
    Grinchtein, Olga
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Protocol log analysis with constraint programming: Work in progress2014In: Satisfiability Modulo Theories: SMT 2014, RWTH Aachen University , 2014, p. 17-26Conference paper (Refereed)
  • 21.
    Dalmau, V
    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.
    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. Docs.
    Closure functions and width 1 problems1999Conference paper (Refereed)
    Abstract [en]

    Local Consistency has proven to be an important notion in the study of constraint satisfaction problems. We give an algebraic condition that characterizes all the constraint types for which generalized are-consistency is sufficient to ensure the existence

  • 22. Dubois, Catherine
    et al.
    Grinchtein, Olga
    Pearson, Justin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Carlsson, Mats
    RISE SICS, Stockholm, Sweden.
    Exploring properties of a telecommunication protocol with message delay using interactive theorem prover2018In: Software Engineering and Formal Methods, Springer, 2018, p. 239-253Conference paper (Refereed)
  • 23.
    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)
  • 24.
    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)
  • 25.
    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)
  • 26.
    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)
  • 27.
    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)
  • 28.
    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)
  • 29.
    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)
  • 30.
    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)
  • 31.
    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)
  • 32.
    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)
  • 33.
    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)
  • 34.
    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)
  • 35.
    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)
  • 36.
    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)
  • 37.
    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)
  • 38.
    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)
  • 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. 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)
  • 40.
    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)
  • 41.
    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
    Ågren, Magnus
    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.
    Efficient structural symmetry breaking for constraint satisfaction problems2007In: International Symmetry Conference, 2007Conference paper (Refereed)
  • 42.
    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
    Ågren, Magnus
    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.
    Structural symmetry breaking for constraint satisfaction problems2007Report (Other scientific)
  • 43.
    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.
    Ågren, Magnus
    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.
    Air-traffic complexity resolution using constraint programming2004Report (Other scientific)
  • 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.
    Ågren, Magnus
    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.
    Introducing ESRA, a relational language for modelling combinatorial problems2004In: LOPSTR'03: Revised Selected Papers, Springer-Verlag , 2004, p. 214-232Chapter in book (Refereed)
  • 45.
    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.
    Ågren, Magnus
    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.
    Garcia Avello, Carlos
    Celiktin, Mete
    Air-Traffic Complexity Resolution in Multi-Sector Planning2007Report (Other scientific)
  • 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. 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.
    Ågren, Magnus
    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.
    Garcia Avello, Carlos
    Celiktin, Mete
    Dissing, Søren
    Air-traffic complexity resolution in multi-sector planning using constraint programming2007In: Proceedings of ATM'07, the 7th USA/Europe R&D Seminar on Air Traffic Management, 2007Conference 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.
    Ågren, Magnus
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Garcia Avello, Carlos
    Çeliktin, Mete
    Dissing, Søren
    Air-traffic complexity resolution in multi-sector planning2007In: Journal of Air Transport Management, ISSN 0969-6997, E-ISSN 1873-2089, Vol. 13, no 6, p. 323-328Article in journal (Refereed)
  • 48.
    Francisco Rodríguez, María Andreína
    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.
    Automatic generation of descriptions of time-series constraints2017In: IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, 2017, p. 102-109Conference paper (Refereed)
    Abstract [en]

    Integer time series are often subject to constraints on the aggregation of the features of all occurrences of some pattern within the series. For example, the number of inflexions may be constrained, or the sum of the peak maxima, or the minimum of the valley widths. Many time-series constraints can be described by transducers. The output alphabet of such a transducer consists of symbols that denote the phases of identifying the maximal occurrences of a pattern. It was recently shown how to synthesise automatically a constraint propagator and a constraint checker from such a transducer, which however has to be designed manually from a pattern. Here we define a large class of patterns, present an algorithm for automatically generating a low-level transducer from such a high-level pattern, and prove it correct. This class covers all 20 patterns of the Time-Series Constraint Catalogue, which can now be automatically extended at will.

  • 49. Francisco Rodríguez, María Andreína
    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.
    Consistency of constraint networks induced by automaton-based constraint specifications2011In: Proc. 10th International Workshop on Constraint Modelling and Reformulation, Italy: Department of Mathematics and Informatics, University of Perugia , 2011, p. 117-131Conference paper (Refereed)
  • 50.
    Francisco Rodríguez, María Andreína
    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.
    Generation of implied constraints for automaton-induced decompositions2013In: Proc. 25th International Conference on Tools with Artificial Intelligence, IEEE Computer Society, 2013, p. 1076-1083Conference paper (Refereed)
12 1 - 50 of 97
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