Pierre Flener's Research Publications & Edited Volumes
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
(my publications at DBLP) (my publications & citations at Google Scholar) (my publications & citations at CiteSeer X)
Please note: The material below is provided for your personal use only and may not be retransmitted or redistributed without permission in writing from a paper's publisher and/or author. You may not upload this material to any public server, on-line service, network, or bulletin board without prior written permission from the publisher and/or author. You may not make copies for any commercial purpose. This material is not public domain. Reproduction or storage of materials retrieved from this web site are subject to Copyright Law.
Books
[Fle:95a]
P. Flener.
Logic Program Synthesis from Incomplete Information.
Kluwer Academic Publishers, 1995. ISBN 0-7923-9532-8.
(Book Announcement and Order Form)
Refereed Journal Papers
[SBFP11]
K. Sundequist Blomdahl, P. Flener, and J. Pearson.
Contingency plans for air traffic flow and capacity management using
constraint programming.
Journal of Aerospace Operations, forthcoming.
[HFP:11]
J. He, P. Flener, and J. Pearson.
An automaton constraint for local search.
Fundamenta Informaticae, 107(2-3):223-248, 2011.
[FPSVÅ:09]
P. Flener, J. Pearson, M. Sellmann, P. Van Hentenryck, and M. Ågren.
Dynamic structural symmetry breaking for constraint satisfaction problems.
Constraints, 14(4):506-538, December 2009.
(PDF)
(Preprint)
(omitted material can be found in Technical Report 2007-032)
[FPS:09]
P. Flener, J. Pearson, and M. Sellmann.
Static and dynamic structural symmetry breaking.
Annals of Mathematics and Artificial Intelligence,
57(1):37-57, September 2009.
(PDF)
(supersedes Technical Report 2008-023)
[FP:09]
P. Flener and J. Pearson.
Solving necklace constraint problems.
Journal of Algorithms, 64(2-3):61-73, April-July 2009.
(PDF)
[FCS:09]
P. Flener, M. Carlsson, and C. Schulte.
Constraint programming in Sweden.
IEEE Intelligent Systems 24(2):87-89, March/April 2009.
(PDF)
(PDF)
[ÅFP:09]
M. Ågren, P. Flener, and J. Pearson.
Revisiting constraint-directed search.
Information and Computation 207(3):438-457, March 2009.
(PDF)
[BFL:08]
N. Beldiceanu, P. Flener, and X. Lorca.
Combining tree partitioning, precedence, and incomparability constraints.
Constraints 13(4):459-489, December 2008.
(PDF)
(Preprint)
(supersedes Technical Report 2006-020)
[SFP:08]
O. Sivertsson, P. Flener, and J. Pearson.
A lower bound on the overlap of same-sized sets.
Annals of Combinatorics 12(3):347-352, October 2008.
(PDF)
[FS:08]
P. Flener and U. Schmid.
An introduction to inductive programming.
Artificial Intelligence Review, 29(1):45-62, March 2008.
(PDF)
[FPÅGCD:07a]
P. Flener, J. Pearson, M. Ågren, C. Garcia Avello, M. Celiktin, and S. Dissing.
Air-traffic complexity resolution in multi-sector planning.
Journal of Air Transport Management 13(6):323-328, November 2007.
(PDF)
(summarises Technical Report 2007-003)
[ÅFP:07]
M. Ågren, P. Flener, and J. Pearson.
Generic incremental algorithms for local search.
Constraints 12(3):293-324, September 2007 (Special Issue on Local Search Techniques for Constraint Satisfaction).
(PDF)
(Preprint)
[FPRS:07]
P. Flener, J. Pearson, L.G. Reyna, and O. Sivertsson.
Design of financial CDO squared transactions using constraint programming.
Constraints 12(2):179-205, April 2007.
(PDF)
(Preprint)
[FP:01a]
P. Flener and D. Partridge.
Inductive Programming.
Automated Software Engineering 8(2):131-137, April 2001 (Special Issue on Inductive Programming).
(Preprint)
[FLOR:00]
P. Flener, K.-K. Lau, M. Ornaghi, and J. Richardson.
An abstract formalisation of correct schemas for program synthesis.
Journal of Symbolic Computation 30(1):93-127, July 2000 (Special Issue on Schemas).
(Preprint)
[FY:99]
P. Flener and S. Yilmaz.
Inductive synthesis of recursive logic programs: Achievements and prospects.
Journal of Logic Programming 41(2-3):141-195, November/December 1999 (Special Issue on Synthesis, Transformation, and Analysis).
(PDF)
[EF:99]
E. Erdem and P. Flener.
Completing open logic programs by constructive induction.
International Journal of Intelligent Systems 14(10):995-1019, October 1999.
(Preprint)
[LCF:98]
B. Le Charlier and P. Flener.
Specifications are necessarily informal,
or: Some more myths of formal methods.
Journal of Systems and Software 40(3):275-296, March 1998 (Special Issue on Formal Methods Technology Transfer).
(Preprint)
[FD:93a]
P. Flener and Y. Deville.
Logic program synthesis from incomplete specifications.
Journal of Symbolic Computation 15(5-6):775-805, May/June 1993 (Special Issue on Automatic Programming).
(Preprint)
Refereed Invited Papers
[FS:10a]
P. Flener and U. Schmid.
Inductive programming.
Invited entry in: C. Sammut and G. Webb (eds),
Encyclopedia of Machine Learning, pages 537-544.
Springer-Verlag, 2010.
(PDF)
[FS:10b]
P. Flener and U. Schmid.
Programming by demonstration.
Invited entry in: C. Sammut and G. Webb (eds),
Encyclopedia of Machine Learning, page 805.
Springer-Verlag, 2010.
(PDF)
[FS:10c]
P. Flener and U. Schmid.
Trace-based programming.
Invited entry in: C. Sammut and G. Webb (eds),
Encyclopedia of Machine Learning, page 989.
Springer-Verlag, 2010.
(PDF)
[BDFHN:04]
D. Basin, Y. Deville, P. Flener, A. Hamfelt, and J. Fischer Nilsson.
Synthesis of Programs in Computational Logic.
Invited chapter in: M. Bruynooghe and K.-K. Lau (eds),
Program Development in Computational Logic, pages 30-65.
Lecture Notes in Computer Science,
volume 3049. Springer-Verlag, 2004.
(Preprint)
[Fle:02a]
P. Flener.
Achievements and prospects of program synthesis.
Invited chapter in: A.C. Kakas and F. Sadri (eds),
Computational Logic: Logic Programming and Beyond;
Essays in Honour of Robert A. Kowalski, pages 310-346.
Lecture Notes in Artificial Intelligence,
volume 2407. Springer-Verlag, 2002.
(Preprint)
[LCF:97]
B. Le Charlier and P. Flener.
On the desirable link between theory and practice in abstract interpretation.
Invited paper in: P. Van Hentenryck (ed), Proceedings of SAS'97, pages 379-387.
Lecture Notes in Computer Science,
volume 1302. Springer-Verlag, 1997.
(Preprint)
Refereed Chapters in Books
[FD:93b]
P. Flener and Y. Deville.
Synthesis of composition and discrimination operators for
divide-and-conquer logic programs.
In: J.-M. Jacquet (ed), Constructing Logic Programs, pages 67-96.
John Wiley and Sons, 1993.
(Preprint)
Edited Refereed Collections
[FPB:1x]
P. Flener, J. Pearson, and M. Bourgois (editors).
Special Issue on Constraint Programming for Air Traffic Control & Management.
Knowledge Engineering Review, forthcoming.
(TOC)
[FP:10]
P. Flener and J. Pearson (editors).
Proceedings of SymCon'10, the Tenth International Workshop on Symmetry in Constraint Satisfaction Problems. 2010.
(TOC)
[FN:08]
P. Flener and Y. Naveh (editors).
Proceedings of LSCS'08, the Fifth International Workshop on Local Search Techniques in Constraint Satisfaction. 2008.
(TOC)
[FS:08]
P. Flener and H. Simonis (editors).
Proceedings of ModRef'08, the Seventh International Workshop on Constraint Modelling and Reformulation. 2008.
(TOC)
[AF:03]
P. Alexander and P. Flener (editors).
Special Issue on ASE'00.
Automated Software Engineering 10(2), April 2003.
(TOC)
[FP:02]
P. Flener and J. Pearson (editors).
Proceedings of SymCon'02, the Second International Workshop on Symmetry in Constraint Satisfaction Problems. 2002.
(TOC)
[FP:01c]
P. Flener and J. Pearson (editors).
Proceedings of SymCon'01, the First International Workshop on Symmetry in Constraint Satisfaction Problems. 2001.
(TOC)
[FP:01b]
P. Flener and D. Partridge (editors).
Special Issue on Inductive Programming.
Automated Software Engineering 8(2), April 2001.
(TOC)
[FMT:01]
P. Flener, A. Mili, and M.F. Tolba (editors).
Proceedings of AICCSA'01.
IEEE Computer Society Press, 2001. ISBN 0-7695-1165-1.
(TOC)
[AF:00]
P. Alexander and P. Flener (editors).
Proceedings of ASE'00.
IEEE Computer Society Press, 2000. ISBN 0-7695-0710-7.
(TOC)
[FLB:00]
P. Flener, K.-K. Lau, and W. Bibel (editors).
Special Issue on Schemas.
Journal of Symbolic Computation 30(1), July 2000.
(TOC)
[Fle:99]
P. Flener (editor),
Logic-Based Program Synthesis and Transformation: 8th International Workshop, LOPSTR'98. Selected Papers.
Lecture Notes in Computer Science,
Volume 1559.
Springer-Verlag, 1999. ISBN 3-540-65765-7.
[FL:98]
P. Flener and K.-K. Lau (editors),
Pre-Proceedings of LOPSTR'98.
Technical Report UMCS-98-6-1, University of Manchester, 1998.
(TOC)
Invited Conference Tutorials and Summer School Lectures
[F:10]
P. Flener.
Symmetry (Slides).
Case Study (Slides).
Invited lectures at the ACP Summer School 2010 on Constraint Programming.
[FLOR:99]
P. Flener, K.-K. Lau, M. Ornaghi, and J. Richardson.
Schema-guided generation of correctly reusable programs.
(Slides)
Invited tutorial at
ASE'99.
Refereed Conference Papers
[HBFNP:11]
F. Hassani Bijarbooneh, P. Flener, E. Ngai, and J. Pearson.
Energy-efficient task-mapping for data-driven sensor network macroprogramming using constraint programming.
In: R. Dell and K. Wood (editors),
Proceedings of ICS'11, the 12th INFORMS Computing Society Conference.
INFORMS Computing Society, 2011.
(PDF, forthcoming)
[SBFP:10b]
K. Sundequist Blomdahl, P. Flener, and J. Pearson.
Contingency plans for air traffic flow and capacity management.
In: D. Schaefer (ed),
Proceedings of INO'10, the 9th EuroControl Innovative Research
Workshop & Exhibition, 2010. (ISBN 978-2-87497-021-4)
(PDF)
(superseded by the Journal of Aerospace Operations paper in 201x)
[SBFP:10a]
K. Sundequist Blomdahl, P. Flener, and J. Pearson.
Contingency plans for air traffic management.
In: D. Cohen (ed),
Proceedings of CP'10, pages 643-657.
Lecture Notes in Computer Science, volume 6308. © Springer-Verlag, 2010.
(PDF)
(Preprint) (superseded by the Journal of Aerospace Operations paper in 201x)
[BCFP:10]
N. Beldiceanu, M. Carlsson, P. Flener, and J. Pearson.
On matrices, automata, and double counting.
In: A. Lodi, M. Milano, and P. Toth (eds),
Proceedings of CP-AI-OR'10, pages 10-24.
Lecture Notes in Computer Science, volume 6140. © Springer-Verlag, 2010.
(PDF)
[FP:08]
P. Flener and J. Pearson.
Solving necklace constraint problems.
In: M. Ghallab (ed),
Proceedings of ECAI'08, pages 520-524.
IOS Press, 2008.
(superseded by the Journal of Algorithms paper in 2009)
(Preprint)
[FPÅGCD:07b]
P. Flener, J. Pearson, M. Ågren, C. Garcia Avello, M. Celiktin, and S. Dissing.
Air-traffic complexity resolution in multi-sector planning using constraint programming.
In: Ch. Pusch and S. Saunders-Hodge (eds),
Proceedings of ATM'07, the 7th USA/Europe R&D Seminar on Air Traffic Management. Barcelona, Spain, July 2007.
(Preprint)
(slightly shorter version with permission in the JATM journal, November 2007)
(summarises Technical Report 2007-003)
[FPSVÅ:07]
P. Flener, J. Pearson, M. Sellmann, P. Van Hentenryck, and M. Ågren.
Efficient structural symmetry breaking for constraint satisfaction problems.
In: I.P. Gent and S. Linton (eds),
Proceedings of the International Symmetry Conference. Edinburgh, UK, 2007.
(Preprint)
[Fle:06]
P. Flener.
Realism in project-based software engineering courses: Rewards, risks, and recommendations.
In: A. Levi, E. Savas, H. Yenigün, S. Balcisoy, and Y. Saygin (eds),
Proceedings of ISCIS'06, pages 1031-1039.
Lecture Notes in Computer Science. volume 4263. © Springer-Verlag, 2006.
(PDF) (supersedes Technical Report 2003-060)
[FPSV:06]
P. Flener, J. Pearson, M. Sellmann, and P. Van Hentenryck.
Static and dynamic structural symmetry breaking.
In: F. Benhamou (ed),
Proceedings of CP'06, pages 695-699.
Lecture Notes in Computer Science, volume 4204. © Springer-Verlag, 2006.
(PDF)
(Preprint)
(superseded by the Annals of Mathematics and Artificial Intelligence paper in 2009)
[ÅFP:06]
M. Ågren, P. Flener, and J. Pearson.
Inferring variable conflicts for local search.
In: F. Benhamou (ed),
Proceedings of CP'06, pages 665-669.
Lecture Notes in Computer Science, volume 4204. © Springer-Verlag, 2006.
(PDF)
(Preprint)
(superseded by the Constraints paper in September 2007)
(summarises Technical Report 2006-005)
[BFL:06]
N. Beldiceanu, P. Flener, and X. Lorca.
Partitionnement de graphes par des arbres sous contraintes de degré.
In: L. Henocque (ed), Proceedings of JFPC'06, 2006.
(PDF)
(Preprint)
[ÅFP:05b]
M. Ågren, P. Flener, and J. Pearson.
Incremental algorithms for local search from second-order logic.
In: P. van Beek (ed),
Proceedings of CP'05, pages 47-61.
Lecture Notes in Computer Science, volume 3709. © Springer-Verlag, 2005.
(Preprint)
(superseded by the Constraints paper in September 2007)
[VFPÅ:05]
P. Van Hentenryck, P. Flener, J. Pearson, and M. Ågren.
Compositional derivation of symmetries for constraint satisfaction.
In: J.-D. Zucker and L. Saitta (eds),
Proceedings of SARA'05, pages 234-247.
Lecture Notes in Artificial Intelligence, volume 3607. © Springer-Verlag, 2005.
(Preprint)
(supersedes Technical Report 2004-022)
[ÅFP:05a]
M. Ågren, P. Flener, and J. Pearson.
Set variables and local search.
In: R. Bartak and M. Milano (eds),
Proceedings of CP-AI-OR'05, pages 19-33.
Lecture Notes in Computer Science, volume 3524. © Springer-Verlag, 2005.
(PDF)
(Preprint)
(superseded by the Constraints paper in September 2007)
(supersedes Technical Report 2004-015)
[BFL:05]
N. Beldiceanu, P. Flener, and X. Lorca.
The tree constraint.
In: R. Bartak and M. Milano (eds),
Proceedings of CP-AI-OR'05, pages 64-78.
Lecture Notes in Computer Science, volume 3524. © Springer-Verlag, 2005.
(PDF)
(Preprint)
[FPR:04]
P. Flener, J. Pearson, and L.G. Reyna.
Financial portfolio optimisation.
In: M.G. Wallace (ed),
Proceedings of CP'04, pages 227-241.
Lecture Notes in Computer Science, volume 3258. Springer-Verlag, 2004.
(Preprint)
(superseded by the Constraints paper in April 2007)
[FPÅ:04]
P. Flener, J. Pearson, and M. Ågren.
Introducing ESRA, a relational language for modelling combinatorial problems.
In: M. Bruynooghe (ed),
Logic Based Program Synthesis and Transformation: 13th International Symposium, LOPSTR'03, Revised Selected Papers, pages 214-232.
Lecture Notes in Computer Science, volume 3018. Springer-Verlag, 2004.
(Preprint).
Previous version with permission
in: A.M. Frisch (ed), Proceedings of the Second Int'l Workshop on Modelling and Reformulating CSPs, held at CP'03.
(Preprint)
Extended abstract with permission
in: M. Bruynooghe (ed), Pre-Proceedings of LOPSTR'03, pages 239-254.
Technical Report CW 365 at Dept of Computer Science, KU Leuven, Belgium, 2003.
[VFPÅ:03]
P. Van Hentenryck, P. Flener, J. Pearson, and M. Ågren.
Tractable symmetry breaking for CSPs with interchangeable values.
In Proceedings of IJCAI'03, pages 277-282.
Morgan Kaufmann Publishers, 2003.
(Preprint)
(superseded by the Constraints paper in 2009)
[FFHKMPW:02]
P. Flener, A.M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, J. Pearson,
and T. Walsh.
Breaking row and column symmetries in matrix models.
In: P. Van Hentenryck (ed), Proceedings of CP'02, pages 462-476.
Lecture Notes in Computer Science,
volume 2470. Springer-Verlag, 2002.
(Preprint)
Short version with permission
in: T. Vidal and P. Liberatore (eds), Proceedings of STAIRS'02.
IOS Press, 2002.
(Preprint)
[KFH:01]
Z. Kiziltan, P. Flener, and B. Hnich.
Towards inferring labelling heuristics for CSP application domains.
In: F. Baader, G. Brewka, and T. Eiter (eds),
Proceedings of KI'01, pages 275-289.
Lecture Notes in Artificial Intelligence,
volume 2174. Springer-Verlag, 2001.
(Preprint)
[HF:01]
B. Hnich and P. Flener.
High-level reformulation of constraint programs.
In: Ph. Codognet (ed), Proceedings of JFPLC'01, pages 75-89.
Éditions Hermès, 2001.
(Preprint)
[FHK:01a]
P. Flener, B. Hnich, and Z. Kiziltan.
Compiling high-level type constructors in constraint programming.
In: I.V. Ramakrishnan (ed), Proceedings of PADL'01, pages 229-244.
Lecture Notes in Computer Science,
volume 1990. Springer-Verlag, 2001.
(Preprint)
[FHK:01b]
P. Flener, B. Hnich, and Z. Kiziltan.
A meta-heuristic for subset problems.
In: I.V. Ramakrishnan (ed), Proceedings of PADL'01, pages 274-287.
Lecture Notes in Computer Science,
volume 1990. Springer-Verlag, 2001.
(Preprint)
Previous version in: K.R. Apt, E. Monfroy, and F. Rossi (eds),
Proceedings of the 5th ERCIM/CompuLog Workshop on Constraint Programming, 2000.
(Preprint)
[FZH:98]
P. Flener, H. Zidoum, and B. Hnich.
Schema-guided synthesis of constraint logic programs.
In: D.F. Redmiles and B. Nuseibeh (eds), Proceedings of ASE'98, pages 168-176.
IEEE Computer Society Press, 1998.
(Preprint)
Extended abstract with permission
in: P. Flener (ed), Logic-based Program Synthesis and Transformation: 8th International Workshop, LOPSTR'98, Selected Papers, pages 309-312.
Lecture Notes in Computer Science,
volume 1559. Springer-Verlag, 1999.
(Preprint)
and previous long version with permission
in: P. Flener and K.-K. Lau (editors), Pre-Proceedings of LOPSTR'98.
Technical Report UMCS-98-6-1, University of Manchester, 1998.
(TOC)
[BF:98]
H. Büyükyildiz and P. Flener.
Generalised logic program transformation schemas.
In: N.E. Fuchs (ed), Logic Program Synthesis and Transformation: 7th International Workshop, LOPSTR'97, Proceedings, pages 46-65.
Lecture Notes in Computer Science,
volume 1463. Springer-Verlag, 1998.
(PDF)
(Preprint)
Extended abstract in: N. Fuchs (ed), Pre-Proceedings of LOPSTR'97.
Technical Report CW 253 at Department of Computer Science, KU Leuven, Belgium, 1997.
[FLO:98]
P. Flener, K.-K. Lau, and M. Ornaghi.
On correct program schemas.
In: N.E. Fuchs (ed), Logic Program Synthesis and Transformation: 7th International Workshop, LOPSTR'97, Proceedings, pages 124-143.
Lecture Notes in Computer Science,
volume 1463. Springer-Verlag, 1998.
(PDF)
(Preprint)
Extended abstract in: N. Fuchs (ed), Pre-Proceedings of LOPSTR'97.
Technical Report CW 253 at Department of Computer Science, KU Leuven, Belgium, 1997.
[FLO:97]
P. Flener, K.-K. Lau, and M. Ornaghi.
Correct-schema-guided synthesis of steadfast programs.
In: M. Lowry and Y. Ledru (eds), Proceedings of ASE'97, pages 153-160.
IEEE Computer Society Press, 1997.
(Preprint)
[Fle:97]
P. Flener.
Inductive logic program synthesis with DIALOGS.
In: S. Muggleton (ed), Inductive Logic Programming, 6th International Workshop, ILP'96, Selected Papers, pages 175-198.
Lecture Notes in Artificial Intelligence,
volume 1314. Springer-Verlag, 1997.
(Preprint)
Previous version in: S. Muggleton (ed), Pre-Proceedings of ILP'96.
[FD:96]
P. Flener and Y. Deville.
Logic program transformation through generalization schemata.
In: M. Proietti (ed), Logic Programming Synthesis and Transformation, 5th International Workshop, LOPSTR'95, Proceedings, pages 171-173.
Lecture Notes in Computer Science,
volume 1048. Springer-Verlag, 1996.
(Preprint)
Longer version in: M. Proietti (ed), Pre-Proceedings of LOPSTR'95.
(Preprint)
[FP:94]
P. Flener and L. Popelinsky.
On the use of inductive reasoning in program synthesis:
Prejudice and prospects.
In: L. Fribourg and F. Turini (eds), Logic Programming Synthesis and Transformation -- Meta-Programming in Logic, 4th International Workshops, LOPSTR'94 and META'94, Proceedings, pages 69-87.
Lecture Notes in Computer Science,
volume 883. Springer-Verlag, 1994.
(Preprint)
Extended abstract in: L. Fribourg (ed), Pre-Proceedings of LOPSTR'94.
[Fle:93a]
P. Flener.
Logic program synthesis from incomplete specifications.
In: L. Gün, R. Onvural, and E. Gelenbe (eds), Proceedings of ISCIS'93, pages 363-370. 1993.
[FD:92b]
P. Flener and Y. Deville.
Towards stepwise, schema-guided synthesis of logic programs.
In: T. Clement and K.-K. Lau (eds), Logic Program Synthesis and Transformation, Proceedings of LOPSTR'91, International Workshop, pages 46-64.
Workshops in Computing, Springer-Verlag, 1992.
(Preprint)
Extended abstract in: T. Clement and K.-K. Lau (eds), Pre-Proceedings of LOPSTR'91.
Refereed Workshop Papers
[FFP:11]
M. A. Francisco Rodriguez, P. Flener, and J. Pearson.
Consistency of constraint networks induced by automaton-based constraint specifications.
In: A. Rendl and Ch. Beck (eds),
Proceedings of ModRef'11, the 10th International Workshop on Constraint Modelling and Reformulation, 2011.
(PDF)
[MFP:10]
T. Mancini, P. Flener, and J. Pearson.
Local search over relational databases.
In: Y. Deville and Ch. Solnon (eds),
Proceedings of LSCS'10, the 7th International Workshop on Local
Search Techniques in Constraint Satisfaction, 2010.
(PDF)
[HBFNP:10]
F. Hassani Bijarbooneh, P. Flener, E. Ngai, and J. Pearson.
Energy-efficient task-mapping for data-driven sensor network macroprogramming using constraint programming.
In: T. Mancini and J. Pearson (eds),
Proceedings of ModRef'10, the 9th International Workshop on Constraint Modelling and Reformulation, 2010.
(revised PDF) (superseded by the ICS'11 paper)
[MFHMP:09]
T. Mancini, P. Flener, A. Hossein Monshi, and J. Pearson.
Constrained optimisation over massive databases.
In: M. Gavanelli and T. Mancini (eds),
Proceedings of RCRA'09, the 16th RCRA International
Workshop on Experimental Evaluation of Algorithms for Solving Problems
with Combinatorial Explosion, 2009.
(PDF)
[HFP:09]
J. He, P. Flener, and J. Pearson.
Toward an automaton constraint for local search.
In: Y. Deville and Ch. Solnon (eds),
Proceedings of LSCS'09, the 6th International Workshop on Local Search Techniques in Constraint Satisfaction.
Electronic Proceedings in Theoretical Computer Science, Volume 5, pp. 13-25, 2009.
(PDF)
Also in: M. Gavanelli and T. Mancini (eds),
Proceedings of RCRA'09, the 16th RCRA International
Workshop on Experimental Evaluation of Algorithms for Solving Problems
with Combinatorial Explosion, 2009.
(superseded by the Fundamenta Informaticae paper in 2011)
[HBFP:09]
F. Hassani Bijarbooneh, P. Flener, and J. Pearson.
Dynamic demand-capacity balancing for air traffic management using constraint-based local search: First results.
In: Y. Deville and Ch. Solnon (eds),
Proceedings of LSCS'09, the 6th International Workshop on Local Search Techniques in Constraint Satisfaction.
Electronic Proceedings in Theoretical Computer Science, Volume 5, pp. 27-40, 2009.
(PDF)
Also in: D. Schaefer (ed), Proceedings of INO'09, the 8th
EuroControl Innovative Research Workshop & Exhibition, 2009.
(PDF)
(Slides)
[ÅFP:07]
M. Ågren, P. Flener, and J. Pearson.
Revisiting constraint-directed search.
In: Y. Naveh and A. Roli (eds),
Proceedings of LSCS'07, the 4th International Workshop on Local Search Techniques in Constraint Satisfaction, 2007.
(superseded by the Information and Computation paper in 2009)
[FFJHKMPW:03]
P. Flener, A.M. Frisch, Ch. Jefferson, B. Hnich, Z. Kiziltan, I. Miguel, J. Pearson,
and T. Walsh.
Breaking symmetries in matrix models: A brief overview.
In Proceedings of ARW'03, 2003.
(Postscript)
(Preprint)
[FP:02]
P. Flener and J. Pearson.
Breaking all the symmetries in matrix models: Results, conjectures, and directions.
In: P. Flener and J. Pearson (eds), Proceedings of SymCon'02,
the Second Int'l Workshop on Symmetry in CSPs, held at CP'02.
(PDF)
[FFHKMW:02]
P. Flener, A.M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, and T. Walsh.
Matrix modelling: Exploiting common patterns in constraint programming.
In: A.M. Frisch (ed), Proceedings of the Int'l Workshop on Reformulating CSPs, held at CP'02.
(Preprint)
[Fle:02b]
P. Flener.
Program synthesis for combinatorial optimisation problems: Position statement.
In: B. Fischer and D. Smith (eds),
Working Notes of the AAAI'02 Spring Symposium on the State of the Art and Future Trends of Logic-based Program Synthesis.
(Preprint)
[FFHKMW:01]
P. Flener, A. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, and T. Walsh.
Matrix modelling.
In: P. Prosser (ed), Proceedings of Formul'01, the CP'01 Workshop on Modelling and Problem Formulation, 2001.
(Preprint)
[FFHKMPW:01]
P. Flener, A. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, J. Pearson, and T. Walsh.
Symmetry in matrix models.
In: P. Flener and J. Pearson (eds), Proceedings of SymCon'01,
the First Int'l Workshop on Symmetry in CSPs, held at CP'01, pages 41-47.
(Preprint)
[Fle:01]
P. Flener.
Towards relational modelling of combinatorial optimisation problems.
In: Ch. Bessière (ed),
Proceedings of the IJCAI'01 Workshop on Modelling and Solving Problems with Constraints.
(Preprint)
[EF:00]
E. Erdem and P. Flener.
A new declarative bias for ILP: Construction modes.
In: J. Cussens and A.M. Frisch (eds), Work-in-Progress Reports of ILP'00.
CEUR Workshop Proceedings 35, 2000.
(Preprint)
[FHK:99]
P. Flener, B. Hnich, and Z. Kiziltan.
Towards schema-guided compilation of set constraint programs.
In: G. Rossi and B. Jayaraman (eds), Proceedings of DPS'99, pages 59-66.
Technical Report 200, Mathematics Dept, University of Parma, Italy, 1999.
(Preprint)
[FR:99]
P. Flener and J. Richardson.
A unified view of programming schemas and proof methods.
In: A. Bossi (ed), Pre-Proceedings of LOPSTR'99, pages 75-82.
Technical Report CS-99-16, University of Venice, Italy, 1999.
(Preprint)
[FPS:94]
P. Flener, L. Popelinsky, and O. Stepankova.
ILP and automatic programming: Towards three approaches.
In: S. Wrobel (ed), Proceedings of ILP'94, pages 351-364.
GMD-Studien Nr.237, Sankt Augustin, Germany, Sept.1994.
(Preprint)
[FD:92a]
P. Flener and Y. Deville.
SYNAPSE, a system for logic program synthesis from incomplete specifications.
In: M. Ducassé, Y.-J. Lin, and Ü. Yalcinalp (eds), Proceedings of WLPE'92, the Workshop on Logic Programming Environments, pages 9-15, held at ICLP'92. 1992.
(Yet) Unpublished / Unfinished Papers
Also see the reports of my ASTRA research group on constraint programming.
[HRF:03]
B. Hnich, J.D.C. Richardson, and P. Flener.
Towards automatic generation and evaluation of implied constraints.
Technical Report 2003-014 at Dept of Information Technology, Uppsala University, Sweden, 2003.
[RF:03]
J.D.C. Richardson and P. Flener.
Program schemas as proof methods.
Technical Report 2003-008 at Dept of Information Technology, Uppsala University, Sweden, 2003.
[LCF:XX]
B. Le Charlier and P. Flener.
Reasoning is necessarily informal, or: A critique of formalisation.
Technical report, forthcoming.
(Abstract)
(if interested, contact me for a draft.)
[BF:97]
H. Büyükyildiz and P. Flener.
Correctness proofs of transformation schemas.
Technical Report, Dept of CEIS, Bilkent University, Turkey, 1997.
(Postscript)
[Fle:95b]
P. Flener.
Predicate invention in inductive program synthesis.
Technical Report, Dept of CEIS, Bilkent University, Turkey, 1995.
(Postscript)
PhD Thesis
[Fle:93]
P. Flener.
Logic Algorithm Synthesis from Examples and Properties.
PhD Thesis, Department of Computer Science, Université Catholique de Louvain, Louvain-la-Neuve, Belgium, 1993.
Out of print. A revised version is [Fle95a] above.
(Abstract)
MSc Thesis
[FJ:88]
P. Flener and B. Jabas.
Contributions à l'étude des bases de données d'atelier logiciel.
MSc Thesis, Department of Computer Science, Université de Namur, Belgium, 1988.
Last modified: Sun Sep 4 22:03:37 CEST 2011







