default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre Flener
Person information
- affiliation: Uppsala University, Sweden
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j29]Kamran Forghani
, Mats Carlsson, Pierre Flener, Magnus Fredriksson, Justin Pearson, Di Yuan:
Maximizing value yield in wood industry through flexible sawing and product grading based on wane and log shape. Comput. Electron. Agric. 216: 108513 (2024)- 2023
- [j28]Johan Wessén, Mats Carlsson, Christian Schulte, Pierre Flener, Federico Pecora, Mihhail Matskin:
A constraint programming model for the scheduling and workspace layout design of a dual-arm multi-tool assembly robot. Constraints An Int. J. 28(2): 71-104 (2023) - 2020
- [c61]Gustav Björdal, Pierre Flener, Justin Pearson, Peter J. Stuckey, Guido Tack:
Solving Satisfaction Problems Using Large-Neighbourhood Search. CP 2020: 55-71
2010 – 2019
- 2019
- [c60]Gustav Björdal, Pierre Flener, Justin Pearson, Peter J. Stuckey:
Exploring Declarative Local-Search Neighbourhoods with Constraint Programming. CP 2019: 37-53 - [c59]Gustav Björdal, Pierre Flener, Justin Pearson:
Generating Compound Moves in Local Search by Hybridisation with Complete Search. CPAIOR 2019: 95-111 - 2018
- [c58]Gustav Björdal, Pierre Flener, Justin Pearson, Peter J. Stuckey, Guido Tack:
Declarative Local-Search Neighbourhoods in MiniZinc. ICTAI 2018: 98-105 - 2017
- [j27]Jip J. Dekker, Gustav Björdal, Mats Carlsson, Pierre Flener, Jean-Noël Monette:
Auto-tabling for subproblem presolving in MiniZinc. Constraints An Int. J. 22(4): 512-529 (2017) - [c57]Joseph D. Scott, Pierre Flener, Justin Pearson, Christian Schulte:
Design and Implementation of Bounded-Length Sequence Variables. CPAIOR 2017: 51-67 - [c56]María Andreína Francisco Rodríguez, Pierre Flener, Justin Pearson:
Automatic Generation of Descriptions of Time-Series Constraints. ICTAI 2017: 102-109 - [r6]Pierre Flener, Ute Schmid:
Inductive Programming. Encyclopedia of Machine Learning and Data Mining 2017: 658-666 - [r5]Pierre Flener, Ute Schmid:
Programming by Demonstration. Encyclopedia of Machine Learning and Data Mining 2017: 1017-1018 - [r4]Pierre Flener, Ute Schmid:
Trace-Based Programming. Encyclopedia of Machine Learning and Data Mining 2017: 1281-1282 - 2016
- [j26]Jean-Noël Monette, Nicolas Beldiceanu, Pierre Flener, Justin Pearson:
A parametric propagator for pairs of Sum constraints with a discrete convexity property. Artif. Intell. 241: 170-190 (2016) - [c55]Ekaterina Arafailova, Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, María Andreína Francisco Rodríguez, Justin Pearson, Helmut Simonis:
Systematic Derivation of Bounds and Glue Constraints for Time-Series Constraints. CP 2016: 13-29 - [c54]Ekaterina Arafailova, Nicolas Beldiceanu, Rémi Douence, Pierre Flener, María Andreína Francisco Rodríguez, Justin Pearson, Helmut Simonis:
Time-Series Constraints: Improvements and Application in CP and MIP Contexts. CPAIOR 2016: 18-34 - [c53]Roberto Amadini, Pierre Flener, Justin Pearson, Joseph D. Scott, Peter J. Stuckey, Guido Tack:
MiniZinc with Strings. LOPSTR 2016: 59-75 - [i5]Roberto Amadini, Pierre Flener, Justin Pearson, Joseph D. Scott, Peter J. Stuckey, Guido Tack:
MiniZinc with Strings. CoRR abs/1608.03650 (2016) - [i4]Ekaterina Arafailova, Nicolas Beldiceanu, Rémi Douence, Mats Carlsson, Pierre Flener, María Andreína Francisco Rodríguez, Justin Pearson, Helmut Simonis:
Global Constraint Catalog, Volume II, Time-Series Constraints. CoRR abs/1609.08925 (2016) - 2015
- [j25]Gustav Björdal, Jean-Noël Monette, Pierre Flener, Justin Pearson:
A constraint-based local search backend for MiniZinc. Constraints An Int. J. 20(3): 325-345 (2015) - [c52]Jean-Noël Monette, Pierre Flener, Justin Pearson:
Automated Auxiliary Variable Elimination Through On-the-Fly Propagator Generation. CP 2015: 313-329 - [c51]Joseph D. Scott, Pierre Flener, Justin Pearson:
Constraint Solving on Bounded String Variables. CPAIOR 2015: 375-392 - [c50]Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Xavier Lorca, Justin Pearson, Thierry Petit, Charles Prud'homme:
A Modelling Pearl with Sortedness Constraints. GCAI 2015: 27-41 - [c49]María Andreína Francisco Rodríguez, Pierre Flener, Justin Pearson:
Implied Constraints for Automaton Constraints. GCAI 2015: 113-126 - 2014
- [j24]Nicolas Beldiceanu, Pierre Flener, Jean-Noël Monette, Justin Pearson, Helmut Simonis:
Toward sustainable development in constraint programming. Constraints An Int. J. 19(2): 139-149 (2014) - [c48]Nicolas Beldiceanu, Pierre Flener, Justin Pearson, Pascal Van Hentenryck:
Propagating Regular Counting Constraints. AAAI 2014: 2616-2622 - [c47]Jean-Noël Monette, Pierre Flener, Justin Pearson:
A Propagator Design Framework for Constraints over Sequences. AAAI 2014: 2710-2716 - [c46]Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, María Andreína Francisco Rodríguez, Justin Pearson:
Linking Prefixes and Suffixes for Constraints Encoded Using Automata with Accumulators. CP 2014: 142-157 - [i3]Pierre Flener, Justin Pearson:
Propagators and Violation Functions for Geometric and Workload Constraints Arising in Airspace Sectorisation. CoRR abs/1401.7463 (2014) - 2013
- [j23]Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson:
On the reification of global constraints. Constraints An Int. J. 18(1): 1-6 (2013) - [j22]Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson:
On matrices, automata, and double counting in constraint programming. Constraints An Int. J. 18(1): 108-140 (2013) - [j21]Jun He, Pierre Flener, Justin Pearson:
Underestimating the cost of a soft constraint is dangerous: revisiting the edit-distance based soft regular constraint. J. Heuristics 19(5): 729-756 (2013) - [c45]Jun He, Pierre Flener, Justin Pearson, Weiming Zhang:
Solving String Constraints: The Case for Constraint Programming. CP 2013: 381-397 - [c44]Jean-Noël Monette, Nicolas Beldiceanu, Pierre Flener, Justin Pearson:
A Parametric Propagator for Discretely Convex Pairs of Sum Constraints. CP 2013: 529-544 - [c43]Joseph D. Scott, Pierre Flener, Justin Pearson:
Bounded Strings for Constraint Programming. ICTAI 2013: 1036-1043 - [c42]María Andreína Francisco Rodríguez, Pierre Flener, Justin Pearson:
Generation of Implied Constraints for Automaton-Induced Decompositions. ICTAI 2013: 1076-1083 - [c41]Farshid Hassani Bijarbooneh, Pierre Flener, Edith Cheuk-Han Ngai, Justin Pearson:
Optimising quality of information in data collection for mobile sensor networks. IWQoS 2013: 163-172 - [i2]Nicolas Beldiceanu, Pierre Flener, Justin Pearson, Pascal Van Hentenryck:
Propagating Regular Counting Constraints. CoRR abs/1309.7145 (2013) - [i1]Pierre Flener, Justin Pearson:
Automatic Airspace Sectorisation: A Survey. CoRR abs/1311.0653 (2013) - 2012
- [j20]Pierre Flener, Justin Pearson, Marc Bourgois:
Constraint programming for air traffic management: preface. Knowl. Eng. Rev. 27(3): 287-289 (2012) - [j19]Cyril Allignol, Nicolas Barnier, Pierre Flener, Justin Pearson:
Constraint programming for air traffic management: a survey - In memory of Pascal Brisset. Knowl. Eng. Rev. 27(3): 361-392 (2012) - [c40]Jean-Noël Monette, Pierre Flener, Justin Pearson:
Towards Solver-Independent Propagators. CP 2012: 544-560 - [c39]Jun He, Pierre Flener, Justin Pearson:
Solution neighbourhoods for constraint-directed local search. SAC 2012: 74-79 - [c38]Toni Mancini, Pierre Flener, Justin Pearson:
Combinatorial problem solving over relational databases: view synthesis through constraint-based local search. SAC 2012: 80-87 - [c37]Farshid Hassani Bijarbooneh, Pierre Flener, Edith C. H. Ngai, Justin Pearson:
An optimisation-based approach for wireless sensor deployment in mobile sensing environments. WCNC 2012: 2108-2112 - 2011
- [j18]Jun He, Pierre Flener, Justin Pearson:
An automaton Constraint for Local Search. Fundam. Informaticae 107(2-3): 223-248 (2011) - 2010
- [c36]Karl Sundequist Blomdahl, Pierre Flener, Justin Pearson:
Contingency Plans for Air Traffic Management. CP 2010: 643-657 - [c35]Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson:
On Matrices, Automata, and Double Counting. CPAIOR 2010: 10-24 - [r3]Pierre Flener, Ute Schmid:
Inductive Programming. Encyclopedia of Machine Learning 2010: 537-544 - [r2]Pierre Flener, Ute Schmid:
Programming by Demonstration. Encyclopedia of Machine Learning 2010: 805 - [r1]Pierre Flener, Ute Schmid:
Trace-Based Programming. Encyclopedia of Machine Learning 2010: 989
2000 – 2009
- 2009
- [j17]Pierre Flener, Justin Pearson, Meinolf Sellmann:
Static and dynamic structural symmetry breaking. Ann. Math. Artif. Intell. 57(1): 37-57 (2009) - [j16]Pierre Flener, Justin Pearson, Meinolf Sellmann, Pascal Van Hentenryck, Magnus Ågren:
Dynamic structural symmetry breaking for constraint satisfaction problems. Constraints An Int. J. 14(4): 506-538 (2009) - [j15]Pierre Flener, Mats Carlsson, Christian Schulte:
Constraint Programming in Sweden. IEEE Intell. Syst. 24(2): 87-89 (2009) - [j14]Magnus Ågren, Pierre Flener, Justin Pearson:
Revisiting constraint-directed search. Inf. Comput. 207(3): 438-457 (2009) - [j13]Pierre Flener, Justin Pearson:
Solving necklace constraint problems. J. Algorithms 64(2-3): 61-73 (2009) - [c34]Toni Mancini, Pierre Flener, Amir Hossein Monshi, Justin Pearson:
Constrained Optimization Over Massive Databases. RCRA@AI*IA 2009 - [c33]Jun He, Pierre Flener, Justin Pearson:
Toward an automaton Constraint for Local Search. LSCS 2009: 13-25 - [c32]Farshid Hassani Bijarbooneh, Pierre Flener, Justin Pearson:
Dynamic Demand-Capacity Balancing for Air Traffic Management Using Constraint-Based Local Search: First Results. LSCS 2009: 27-40 - 2008
- [j12]Pierre Flener, Ute Schmid:
An introduction to inductive programming. Artif. Intell. Rev. 29(1): 45-62 (2008) - [j11]Nicolas Beldiceanu, Pierre Flener, Xavier Lorca:
Combining Tree Partitioning, Precedence, and Incomparability Constraints. Constraints An Int. J. 13(4): 459-489 (2008) - [c31]Pierre Flener, Justin Pearson:
Solving Necklace Constraint Problems. ECAI 2008: 520-524 - 2007
- [j10]Pierre Flener, Justin Pearson, Luis G. Reyna, Olof Sivertsson:
Design of Financial CDO Squared Transactions Using Constraint Programming. Constraints An Int. J. 12(2): 179-205 (2007) - [j9]Magnus Ågren, Pierre Flener, Justin Pearson:
Generic Incremental Algorithms for Local Search. Constraints An Int. J. 12(3): 293-324 (2007) - 2006
- [c30]Magnus Ågren, Pierre Flener, Justin Pearson:
Inferring Variable Conflicts for Local Search. CP 2006: 665-669 - [c29]Pierre Flener, Justin Pearson, Meinolf Sellmann, Pascal Van Hentenryck:
Static and Dynamic Structural Symmetry Breaking. CP 2006: 695-699 - [c28]Pierre Flener:
Realism in Project-Based Software Engineering Courses: Rewards, Risks, and Recommendations. ISCIS 2006: 1031-1039 - 2005
- [c27]Magnus Ågren, Pierre Flener, Justin Pearson:
Incremental Algorithms for Local Search from Existential Second-Order Logic. CP 2005: 47-61 - [c26]Magnus Ågren, Pierre Flener, Justin Pearson:
Set Variables and Local Search. CPAIOR 2005: 19-33 - [c25]Nicolas Beldiceanu, Pierre Flener, Xavier Lorca:
The tree Constraint. CPAIOR 2005: 64-78 - [c24]Pascal Van Hentenryck, Pierre Flener, Justin Pearson, Magnus Ågren:
Compositional Derivation of Symmetries for Constraint Satisfaction. SARA 2005: 234-247 - 2004
- [c23]Pierre Flener, Justin Pearson, Luis G. Reyna:
Financial Portfolio Optimisation. CP 2004: 227-241 - [p1]David A. Basin, Yves Deville, Pierre Flener, Andreas Hamfelt, Jørgen Fischer Nilsson:
Synthesis of Programs in Computational Logic. Program Development in Computational Logic 2004: 30-65 - 2003
- [j8]Perry Alexander, Pierre Flener:
Guest Editorial: ASE 2000 Special Issue. Autom. Softw. Eng. 10(2): 119-120 (2003) - [c22]Pierre Flener, Justin Pearson, Magnus Ågren:
Introducing ESRA, a Relational Language for Modelling Combinatorial Problems. CP 2003: 971 - [c21]Pascal Van Hentenryck, Pierre Flener, Justin Pearson, Magnus Ågren:
Tractable Symmetry Breaking for CSPs with Interchangeable Values. IJCAI 2003: 277-284 - [c20]Pierre Flener, Justin Pearson, Magnus Ågren:
Introducing esra, a Relational Language for Modelling Combinatorial Problems. LOPSTR 2003: 214-232 - 2002
- [c19]Pierre Flener:
Achievements and Prospects of Program Synthesis. Computational Logic: Logic Programming and Beyond 2002: 310-346 - [c18]Pierre Flener, Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Justin Pearson, Toby Walsh:
Breaking Row and Column Symmetries in Matrix Models. CP 2002: 462-476 - 2001
- [j7]Pierre Flener, Derek Partridge:
Inductive Programming. Autom. Softw. Eng. 8(2): 131-137 (2001) - [c17]Brahim Hnich, Pierre Flener:
High-Level Reformulation of Constraint Programs. JFPLC 2001: 75-90 - [c16]Zeynep Kiziltan, Pierre Flener, Brahim Hnich:
Towards Inferring Labelling Heuristics for CSP Application Domains. KI/ÖGAI 2001: 275-289 - [c15]Pierre Flener, Brahim Hnich, Zeynep Kiziltan:
Compiling High-Level Type Constructors in Constraint Programming. PADL 2001: 229-244 - [c14]Pierre Flener, Brahim Hnich, Zeynep Kiziltan:
A Meta-heuristic for Subset Problems. PADL 2001: 274-287 - 2000
- [j6]Pierre Flener, Kung-Kiu Lau, Wolfgang Bibel:
Foreword to the Special Issue on Schemas. J. Symb. Comput. 30(1): 1-3 (2000) - [j5]Pierre Flener, Kung-Kiu Lau, Mario Ornaghi, Julian Richardson:
An Abstract Formalization of Correct Schemas for Program Synthesis. J. Symb. Comput. 30(1): 93-127 (2000) - [c13]Esra Erdem, Pierre Flener:
A New Declarative Bias for ILP: Construction Modes. ILP Work-in-progress reports 2000
1990 – 1999
- 1999
- [j4]Esra Erdem, Pierre Flener:
Completing open logic programs by constructive induction. Int. J. Intell. Syst. 14(10): 995-1019 (1999) - [j3]Pierre Flener, Serap Yilmaz:
Inductive Synthesis of Recursive Logic Programs: Achievements and Prospects. J. Log. Program. 41(2-3): 141-195 (1999) - 1998
- [j2]Baudouin Le Charlier, Pierre Flener:
Specifications are necessarily informal or: Some more myths of formal methods. J. Syst. Softw. 40(3): 275-296 (1998) - [c12]Pierre Flener, Hamza Zidoum, Brahim Hnich:
Schema-Guided Synthesis of Constraint Logic Programs. ASE 1998: 168-176 - [c11]Hamza Zidoum, Pierre Flener, Brahim Hnich:
Schema-Guided Synthesis of CLP Programs. LOPSTR 1998: 309-312 - 1997
- [c10]Pierre Flener, Kung-Kiu Lau, Mario Ornaghi:
Correct-Schema-Guided Synthesis of Steadfast Programs. ASE 1997: 153- - [c9]Halime Büyükyildiz, Pierre Flener:
Generalised Logic Program Transformation Schemas. LOPSTR 1997: 49-68 - [c8]Pierre Flener, Kung-Kiu Lau, Mario Ornaghi:
On Correct Program Schemas. LOPSTR 1997: 128-147 - [c7]Baudouin Le Charlier, Pierre Flener:
On the Desirable Link Between Theory and Practice in Abstract Interpretation (Extended Abstract). SAS 1997: 379-387 - 1996
- [c6]Pierre Flener:
Inductive Logic Program Synthesis with DIALOGS. Inductive Logic Programming Workshop 1996: 175-198 - 1995
- [b1]Pierre Flener:
Logic program synthesis from incomplete information. The Kluwer international series in engineering and computer science 295, Kluwer 1995, ISBN 978-0-7923-9532-4, pp. I-XVIII, 1-242 - [c5]Pierre Flener, Yves Deville:
Logic Program Transformation through Generalization Schemata. LOPSTR 1995: 171-173 - 1994
- [c4]Pierre Flener, Lubos Popelínský:
On the Use of Inductive Reasoning in Program Synthesis: Prejudice and Prospects. LOPSTR 1994: 69-87 - 1993
- [j1]Pierre Flener, Yves Deville:
Logic Program Synthesis from Incomplete Specifications. J. Symb. Comput. 15(5/6): 778-805 (1993) - 1992
- [c3]Pierre Flener, Yves Deville:
SYNAPSE- A System for Logic Program Synthesis from Incomplete Specifications. LPE 1992: 9-15 - 1991
- [c2]Pierre Flener, Yves Deville:
Synthesis of Composition and Discrimination Operators for Divide-and-Conquer Logic Programs. ICLP Workshop on Construction of Logic Programs 1991: 67-96 - [c1]Pierre Flener, Yves Deville:
Towards Stepwise, Schema-guided Synthesis of Logic Programms. LOPSTR 1991: 46-64 - 1990
- [e1]Pierre Flener:
Logic Programming Synthesis and Transformation, 8th International Workshop, LOPSTR'98, Manchester, UK, June 15-19, 1998, Proceedings. Lecture Notes in Computer Science 1559, Springer 1990, ISBN 3-540-65765-7 [contents]
Coauthor Index
[j29] [c61] [c60] [c59] [c58] [c57] [c56] [j26] [c55] [c54] [c53] [i5] [i4] [j25] [c52] [c51] [c50] [c49] [j24] [c48] [c47] [c46] [i3] [j23] [j22] [j21] [c45] [c44] [c43] [c42] [c41] [i2] [i1] [j20] [j19] [c40] [c39] [c38] [c37] [j18] [c36] [c35] [j17] [j16] [j14] [j13] [c34] [c33] [c32] [c31] [j10] [j9] [c30] [c29] [c27] [c26] [c24] [c23] [c22] [c21] [c20] [c18]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
