| 2013 | ||
|---|---|---|
| j21 | Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson: On the reification of global constraints. Constraints 18(1): 1-6 (2013) | |
| j20 | Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson: On matrices, automata, and double counting in constraint programming. Constraints 18(1): 108-140 (2013) | |
| 2012 | ||
| j19 | Pierre Flener, Justin Pearson, Marc Bourgois: Constraint programming for air traffic management: preface. Knowledge Eng. Review 27(3): 287-289 (2012) | |
| j18 | Cyril Allignol, Nicolas Barnier, Pierre Flener, Justin Pearson: Constraint programming for air traffic management: a survey - In memory of Pascal Brisset. Knowledge Eng. Review 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 | ||
| j17 | Jun He, Pierre Flener, Justin Pearson: An automaton Constraint for Local Search. Fundam. Inform. 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 | ||
| r2 | ||
| r1 | ||
| 2009 | ||
| j16 | Pierre Flener, Justin Pearson, Meinolf Sellmann: Static and dynamic structural symmetry breaking. Ann. Math. Artif. Intell. 57(1): 37-57 (2009) | |
| j15 | Pierre Flener, Justin Pearson, Meinolf Sellmann, Pascal Van Hentenryck, Magnus Ågren: Dynamic structural symmetry breaking for constraint satisfaction problems. Constraints 14(4): 506-538 (2009) | |
| j14 | Pierre Flener, Mats Carlsson, Christian Schulte: Constraint Programming in Sweden. IEEE Intelligent Systems 24(2): 87-89 (2009) | |
| j13 | Magnus Ågren, Pierre Flener, Justin Pearson: Revisiting constraint-directed search. Inf. Comput. 207(3): 438-457 (2009) | |
| j12 | Pierre Flener, Justin Pearson: Solving necklace constraint problems. J. Algorithms 64(2-3): 61-73 (2009) | |
| c34 | Jun He, Pierre Flener, Justin Pearson: Toward an automaton Constraint for Local Search. LSCS 2009: 13-25 | |
| c33 | 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 | ||
| j11 | Pierre Flener, Ute Schmid: An introduction to inductive programming. Artif. Intell. Rev. 29(1): 45-62 (2008) | |
| j10 | Nicolas Beldiceanu, Pierre Flener, Xavier Lorca: Combining Tree Partitioning, Precedence, and Incomparability Constraints. Constraints 13(4): 459-489 (2008) | |
| c32 | ||
| 2007 | ||
| j9 | Pierre Flener, Justin Pearson, Luis G. Reyna, Olof Sivertsson: Design of Financial CDO Squared Transactions Using Constraint Programming. Constraints 12(2): 179-205 (2007) | |
| j8 | Magnus Ågren, Pierre Flener, Justin Pearson: Generic Incremental Algorithms for Local Search. Constraints 12(3): 293-324 (2007) | |
| 2006 | ||
| c31 | Magnus Ågren, Pierre Flener, Justin Pearson: Inferring Variable Conflicts for Local Search. CP 2006: 665-669 | |
| c30 | Pierre Flener, Justin Pearson, Meinolf Sellmann, Pascal Van Hentenryck: Static and Dynamic Structural Symmetry Breaking. CP 2006: 695-699 | |
| c29 | Pierre Flener: Realism in Project-Based Software Engineering Courses: Rewards, Risks, and Recommendations. ISCIS 2006: 1031-1039 | |
| 2005 | ||
| c28 | Magnus Ågren, Pierre Flener, Justin Pearson: Incremental Algorithms for Local Search from Existential Second-Order Logic. CP 2005: 47-61 | |
| c27 | ||
| c26 | ||
| c25 | Pascal Van Hentenryck, Pierre Flener, Justin Pearson, Magnus Ågren: Compositional Derivation of Symmetries for Constraint Satisfaction. SARA 2005: 234-247 | |
| 2004 | ||
| c24 | ||
| c23 | 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 | ||
| j7 | 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 | ||
| j6 | ||
| c17 | ||
| 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 | ||
| j5 | Pierre Flener, Kung-Kiu Lau, Wolfgang Bibel: Foreword to the Special Issue on Schemas. J. Symb. Comput. 30(1): 1-3 (2000) | |
| j4 | 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 | |
| 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. Journal of Systems and Software 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 | ||
| 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 | ||
| c5 | Pierre Flener, Yves Deville: Logic Program Transformation through Generalization Schemata. LOPSTR 1995: 171-173 | |
| 1994 | ||
| c4 | Pierre Flener, Lubos Popelínsky: 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 (Ed.): 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 | |
Data released under the ODC-BY 1.0 license — See also our legal information page