default search action
Ian Miguel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j26]Joan Espasa, Ian Miguel, Peter Nightingale, András Z. Salamon, Mateu Villaret:
Plotting: a case study in lifted planning with constraints. Constraints An Int. J. 29(1): 40-79 (2024) - [c65]Erdem Kus, Özgür Akgün, Nguyen Dang, Ian Miguel:
Frugal Algorithm Selection (Short Paper). CP 2024: 38:1-38:16 - [c64]Christopher Stone
, András Z. Salamon
A Graph Transformation-Based Engine for the Automated Exploration of Constraint Models. ICGT 2024: 223-238 - [i28]Erdem Kus, Özgür Akgün, Nguyen Dang, Ian Miguel:
Frugal Algorithm Selection. CoRR abs/2405.11059 (2024) - [i27]Alessio Pellegrino, Özgür Akgün, Nguyen Dang, Zeynep Kiziltan, Ian Miguel:
Automatic Feature Learning for Essence: a Case Study on Car Sequencing. CoRR abs/2409.15158 (2024) - [i26]Saad Attieh, Nguyen Dang, Christopher Jefferson, Ian Miguel, Peter Nightingale:
Athanor: Local Search over Abstract Constraint Specifications. CoRR abs/2410.05937 (2024) - 2023
- [j25]Patrick Spracklen, Nguyen Dang
Automated streamliner portfolios for constraint satisfaction problems. Artif. Intell. 319: 103915 (2023) - [c63]Emma Hart
Towards optimisers that 'Keep Learning'. GECCO Companion 2023: 1636-1638 - [c62]Carlo Cena
Learning When to Use Automatic Tabulation in Constraint Model Reformulation. IJCAI 2023: 1902-1910 - [c61]Özgür Akgün
Conjure: Automatic Generation of Constraint Models from Problem Specifications (Extended Abstract). IJCAI 2023: 6833-6838 - [i25]Joan Espasa, Ian Miguel, Peter Nightingale, András Z. Salamon, Mateu Villaret:
Challenges in Modelling and Solving Plotting with PDDL. CoRR abs/2310.01470 (2023) - [i24]Joan Espasa, Ian P. Gent, Ian Miguel, Peter Nightingale, András Z. Salamon, Mateu Villaret:
Towards a Model of Puzznic. CoRR abs/2310.01503 (2023) - [i23]Ian Miguel, András Z. Salamon, Christopher Stone:
Towards Exploratory Reformulation of Constraint Models. CoRR abs/2311.11868 (2023) - 2022
- [j24]Özgür Akgün
Conjure: Automatic Generation of Constraint Models from Problem Specifications. Artif. Intell. 310: 103751 (2022) - [c60]Nguyen Dang
A Framework for Generating Informative Benchmark Instances. CP 2022: 18:1-18:18 - [c59]Joan Espasa
Plotting: A Planning Problem with Complex Transitions. CP 2022: 22:1-22:17 - [i22]Özgür Akgün
Automatic Tabulation in Constraint Models. CoRR abs/2202.13250 (2022) - [i21]Nguyen Dang, Özgür Akgün, Joan Espasa
A Framework for Generating Informative Benchmark Instances. CoRR abs/2205.14753 (2022) - 2021
- [c58]Joan Espasa
Exploring Lifted Planning Encodings in Essence Prime. CCIA 2021: 66-75 - [i20]Jordi Coll, Joan Espasa, Ian Miguel, Mateu Villaret:
A Preliminary Case Study of Planning With Complex Transitions: Plotting. CoRR abs/2110.14397 (2021) - [i19]Özgür Akgün
Towards Reformulating Essence Specifications for Robustness. CoRR abs/2111.00821 (2021) - 2020
- [c57]Özgür Akgün
Discriminating Instance Generation from Abstract Specifications: A Case Study with CP and MIP. CPAIOR 2020: 41-51 - [c56]Gökberk Koçak
Exploiting Incomparability in Solution Dominance: Improving General Purpose Constraint-Based Mining. ECAI 2020: 331-338 - [i18]Patrick Spracklen, Nguyen Dang
Towards Portfolios of Streamlined Constraint Models: A Case Study with the Balanced Academic Curriculum Problem. CoRR abs/2009.10152 (2020) - [i17]Özgür Akgün
Exploring Instance Generation for Automated Planning. CoRR abs/2009.10156 (2020) - [i16]Gökberk Koçak, Özgür Akgün
Efficient Incremental Modelling and Solving. CoRR abs/2009.11111 (2020)
2010 – 2019
- 2019
- [j23]Blesson Varghese
Cloud Benchmarking for Maximising Performance of Scientific Applications. IEEE Trans. Cloud Comput. 7(1): 170-182 (2019) - [c55]Özgür Akgün
Instance Generation via Generator Instances. CP 2019: 3-19 - [c54]Carlos Ansótegui, Miquel Bofill
Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints. CP 2019: 20-36 - [c53]Patrick Spracklen, Nguyen Dang
Automatic Streamlining for Constrained Optimisation. CP 2019: 366-383 - [c52]Saad Attieh, Nguyen Dang
Athanor: High-Level Local Search Over Abstract Constraint Specifications in Essence. IJCAI 2019: 1056-1063 - [i15]Gökberk Koçak, Özgür Akgün, Tias Guns, Ian Miguel:
Towards Improving Solution Dominance with Incomparability Conditions: A case-study using Generator Itemset Mining. CoRR abs/1910.00505 (2019) - [i14]Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Toby Walsh:
A Commentary on "Breaking Row and Column Symmetries in Matrix Models". CoRR abs/1910.01423 (2019) - 2018
- [j22]Ian P. Gent, Ian Miguel
A review of literature on parallel constraint solving. Theory Pract. Log. Program. 18(5-6): 725-758 (2018) - [c51]Özgür Akgün
Automatic Discovery and Exploitation of Promising Subproblems for Tabulation. CP 2018: 3-12 - [c50]Patrick Spracklen, Özgür Akgün
Automatic Generation and Selection of Streamlined Constraint Models via Monte Carlo Search on a Model Lattice. CP 2018: 362-372 - [c49]Özgür Akgün
Metamorphic Testing of Constraint Solvers. CP 2018: 727-736 - [c48]Gokberk Kocak
Closed Frequent Itemset Mining with Arbitrary Side Constraints. ICDM Workshops 2018: 1224-1232 - [c47]Özgür Akgün
A Framework for Constraint Based Local Search using Essence. IJCAI 2018: 1242-1248 - [i13]Ian P. Gent, Ciaran McCreesh, Ian Miguel, Neil C. A. Moore, Peter Nightingale, Patrick Prosser, Chris Unsworth:
A Review of Literature on Parallel Constraint Solving. CoRR abs/1803.10981 (2018) - [i12]Özgür Akgün
Modelling Langford's Problem: A Viewpoint for Search. CoRR abs/1808.09847 (2018) - 2017
- [j21]Peter Nightingale
Automatically improving constraint models in Savile Row. Artif. Intell. 251: 35-61 (2017) - 2016
- [c46]Özgür Akgün
Exploiting Short Supports for Improved Encoding of Arbitrary Constraints into SAT. CP 2016: 3-12 - [i11]Blesson Varghese, Ozgur Akgun, Ian Miguel, Long Thai, Adam Barker:
Cloud Benchmarking For Maximising Performance of Scientific Applications. CoRR abs/1608.00406 (2016) - 2015
- [c45]Peter Nightingale
Automatically Improving SAT Encoding of Constraint Problems Through Common Subexpression Elimination in Savile Row. CP 2015: 330-340 - [c44]James Wetter, Özgür Akgün
Automatically Generating Streamlined Constraint Models with Essence and Conjure. CP 2015: 480-496 - [c43]James Wetter, Ozgur Akgun
Cloud-based E-Infrastructure for Scheduling Astronomical Observations. e-Science 2015: 362-370 - 2014
- [j20]Ian P. Gent
Generating custom propagators for arbitrary constraints. Artif. Intell. 211: 1-33 (2014) - [j19]Thomas W. Kelsey
Qualitative modelling via constraint programming. Constraints An Int. J. 19(2): 163-173 (2014) - [c42]Blesson Varghese, Ozgur Akgun
Cloud Benchmarking for Performance. CloudCom 2014: 535-540 - [c41]Long Thai, Adam Barker, Blesson Varghese, Ozgur Akgun
Optimal Deployment of Geographically Distributed Workflow Engines on the Cloud. CloudCom 2014: 811-816 - [c40]Ian P. Gent
Discriminating Instance Generation for Automated Constraint Model Selection. CP 2014: 356-365 - [c39]Peter Nightingale
Automatically Improving Constraint Models in Savile Row through Associative-Commutative Common Subexpression Elimination. CP 2014: 590-605 - [c38]Ozgur Akgun
Breaking Conditional Symmetry in Automated Constraint Modelling with CONJURE. ECAI 2014: 3-8 - [i10]Peter Nightingale, Ian Philip Gent, Christopher Jefferson, Ian Miguel:
Short and Long Supports for Constraint Propagation. CoRR abs/1402.0559 (2014) - [i9]Long Thai, Adam Barker, Blesson Varghese, Ozgur Akgun
Optimal Deployment of Geographically Distributed Workflow Engines on the Cloud. CoRR abs/1410.8359 (2014) - [i8]Blesson Varghese, Ozgur Akgun
Cloud Benchmarking for Performance. CoRR abs/1411.0912 (2014) - 2013
- [j18]Peter Nightingale
Short and Long Supports for Constraint Propagation. J. Artif. Intell. Res. 46: 1-45 (2013) - [c37]Ozgur Akgun
Automated Symmetry Breaking and Model Selection in Conjure. CP 2013: 107-116 - 2012
- [j17]Ian P. Gent
An empirical study of learning and forgetting constraints. AI Commun. 25(2): 191-208 (2012) - [j16]Lars Kotthoff
An evaluation of machine learning in algorithm selection for search problems. AI Commun. 25(3): 257-270 (2012) - [c36]Dharini Balasubramaniam
An automated approach to generating efficient constraint solvers. ICSE 2012: 661-671 - [i7]Thomas W. Kelsey, Lars Kotthoff, Christopher Jefferson, Stephen A. Linton, Ian Miguel, Peter Nightingale, Ian P. Gent:
Qualitative Modelling via Constraint Programming: Past, Present and Future. CoRR abs/1209.3916 (2012) - 2011
- [c35]Ozgur Akgun, Ian Miguel, Christopher Jefferson, Alan M. Frisch, Brahim Hnich:
Extensible Automated Constraint Modelling. AAAI 2011: 4-11 - [c34]Peter Nightingale
Exploiting Short Supports for Generalised Arc Consistency for Arbitrary Constraints. IJCAI 2011: 623-628 - [c33]Lars Kotthoff, Ian P. Gent, Ian Miguel:
A Preliminary Evaluation of Machine Learning in Algorithm Selection for Search Problems. SOCS 2011: 84-91 - [c32]Dharini Balasubramaniam
Dominion: An Architecture-Driven Approach to Generating Efficient Constraint Solvers. WICSA 2011: 228-231 - [i6]Ozgur Akgun, Alan M. Frisch, Brahim Hnich, Christopher Jefferson, Ian Miguel:
Conjure Revisited: Towards Automated Constraint Modelling. CoRR abs/1109.1774 (2011) - [i5]Ian P. Gent, Christopher Jefferson, Lars Kotthoff, Ian Miguel:
Modelling Constraint Solver Architecture Design as a Constraint Problem. CoRR abs/1110.6290 (2011) - 2010
- [c31]Ian P. Gent
Generating Special-Purpose Stateless Propagators for Arbitrary Constraints. CP 2010: 206-220 - [c30]Lars Kotthoff
Ensemble Classification for Constraint Solver Configuration. CP 2010: 321-329 - [c29]Ian P. Gent
Learning When to Use Lazy Learning in Constraint Solving. ECAI 2010: 873-878 - [c28]Ian P. Gent
Lazy Explanations for Constraint Propagators. PADL 2010: 217-233 - [i4]Lars Kotthoff, Ian P. Gent, Ian Miguel:
Using machine learning to make constraint solver implementation decisions. CoRR abs/1005.3502 (2010) - [i3]Ian P. Gent, Lars Kotthoff, Ian Miguel, Peter Nightingale:
Machine learning for constraint solver design -- A case study for the alldifferent constraint. CoRR abs/1008.4326 (2010)
2000 – 2009
- 2009
- [j15]Alan M. Frisch
Filtering algorithms for the multiset ordering constraint. Artif. Intell. 173(2): 299-328 (2009) - [j14]Andrew Grayland, Christopher Jefferson
Minimal ordering constraints for some families of variable symmetries. Ann. Math. Artif. Intell. 57(1): 75-102 (2009) - [c27]Sophie Huczynska, Paul McKay, Ian Miguel
Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics. CP 2009: 50-64 - [c26]Andrew Grayland, Ian Miguel
Snake Lex: An Alternative to Double Lex. CP 2009: 391-399 - [c25]Ian P. Gent, Paul McKay, Ian Miguel, Peter Nightingale, Sophie Huczynska:
Modelling Equidistant Frequency Permutation Arrays in Constraints. SARA 2009 - [c24]Andrew Grayland, Ian Miguel, Colva M. Roney-Dougal:
Confluence of Reduction Rules for Lexicographic Ordering Constraints. SARA 2009 - [c23]Andrew Grayland, Ian Miguel, Colva M. Roney-Dougal:
In Search of a Better Method to Break Row and Column Symmetries. SARA 2009 - [c22]Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Gregory:
Common Subexpressions in Constraint Models of Planning Problems. SARA 2009 - [c21]Andrea Rendl, Ian Miguel, Ian P. Gent, Christopher Jefferson:
Automatically Enhancing Constraint Model Instances during Tailoring. SARA 2009 - [i2]Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Toby Walsh:
Filtering Algorithms for the Multiset Ordering Constraint. CoRR abs/0903.0460 (2009) - [i1]Alan M. Frisch, Ian Miguel, Zeynep Kiziltan, Brahim Hnich, Toby Walsh:
Multiset Ordering Constraints. CoRR abs/0905.3769 (2009) - 2008
- [j13]Ian P. Gent
Generalised arc consistency for the AllDifferent constraint: An empirical survey. Artif. Intell. 172(18): 1973-2000 (2008) - [j12]Alan M. Frisch
Introduction to the Special Issue on Abstraction and Automation in Constraint Modelling. Constraints An Int. J. 13(3): 227-228 (2008) - [j11]Alan M. Frisch
Essence : A constraint language for specifying combinatorial problems. Constraints An Int. J. 13(3): 268-306 (2008) - 2007
- [j10]Ian P. Gent, Christopher Jefferson, Tom W. Kelsey, Inês Lynce, Ian Miguel, Peter Nightingale, Barbara M. Smith, Armagan Tarim:
Search in the patience game 'Black Hole'. AI Commun. 20(3): 211-226 (2007) - [c20]Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale:
Data Structures for Generalised Arc Consistency for Extensional Constraints. AAAI 2007: 191-197 - [c19]Alan M. Frisch, Matthew Grum, Christopher Jefferson, Bernadette Martínez Hernández, Ian Miguel:
The Design of ESSENCE: A Constraint Language for Specifying Combinatorial Problems. IJCAI 2007: 80-87 - [c18]Ian P. Gent, Ian Miguel
Tailoring Solver-Independent Constraint Models: A Case Study with Essence' and Minion. SARA 2007: 184-199 - [e1]Ian Miguel
Abstraction, Reformulation, and Approximation, 7th International Symposium, SARA 2007, Whistler, Canada, July 18-21, 2007, Proceedings. Lecture Notes in Computer Science 4612, Springer 2007, ISBN 978-3-540-73579-3 [contents] - 2006
- [j9]Alan M. Frisch
Propagation algorithms for lexicographic ordering constraints. Artif. Intell. 170(10): 803-834 (2006) - [j8]Christopher Jefferson
Modelling and solving English Peg Solitaire. Comput. Oper. Res. 33(10): 2935-2959 (2006) - [c17]Ian P. Gent, Christopher Jefferson
Watched Literals for Constraint Propagation in Minion. CP 2006: 182-197 - [c16]John William Charnley, Simon Colton, Ian Miguel:
Automatic Generation of Implied Constraints. ECAI 2006: 73-77 - [c15]Ian P. Gent, Christopher Jefferson, Ian Miguel:
Minion: A Fast Scalable Constraint Solver. ECAI 2006: 98-102 - [r1]Kenneth N. Brown, Ian Miguel
Uncertainty and Change. Handbook of Constraint Programming 2006: 731-760 - 2005
- [j7]Ian Miguel
Exhibiting the behavior of time-delayed systems via an extension to qualitative simulation. IEEE Trans. Syst. Man Cybern. Part A 35(2): 298-305 (2005) - [c14]Ian P. Gent
Conditional Symmetry Breaking. CP 2005: 256-270 - [c13]Mark Bartlett, Alan M. Frisch
The Temporal Knapsack Problem and Its Solution. CPAIOR 2005: 34-48 - [c12]Armagan Tarim, Ian Miguel
A Hybrid Benders' Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse. CSCLP 2005: 133-148 - [c11]Alan M. Frisch, Christopher Jefferson, Bernadette Martínez Hernández, Ian Miguel:
The Rules of Constraint Modelling. IJCAI 2005: 109-116 - [c10]Alan M. Frisch
Transforming and Refining Abstract Constraint Specifications. SARA 2005: 76-91 - 2004
- [b2]Ian Miguel:
Dynamic flexible constraint satisfaction and its application to AI planning. Edinburgh, Univ., Springer 2004, ISBN 1-85233-764-8, pp. 1-318 - [j6]Brahim Hnich
Hybrid Modelling for Robust Solving. Ann. Oper. Res. 130(1-4): 19-39 (2004) - [c9]Armagan Tarim, Ian Miguel
Echelon Stock Formulation of Arborescent Distribution Systems: An Application to the Wagner-Whitin Problem. CPAIOR 2004: 302-318 - [c8]Alan M. Frisch, Christopher Jefferson, Ian Miguel:
Symmetry Breaking as a Prelude to Implied Constraints: A Constraint Modelling Pattern. ECAI 2004: 171-175 - 2003
- [j5]Ian Miguel
Fuzzy rrDFCSP and planning. Artif. Intell. 148(1-2): 11-52 (2003) - [c7]Alan M. Frisch
Constraints for Breaking More Row and Column Symmetries. CP 2003: 318-332 - [c6]Alan M. Frisch, Ian Miguel, Zeynep Kiziltan, Brahim Hnich, Toby Walsh:
Multiset Ordering Constraints. IJCAI 2003: 221-226 - 2002
- [c5]Alan M. Frisch
CGRASS: A System for Transforming Constraint Satisfaction Problems. International Workshop on Constraint Solving and Constraint Logic Programming 2002: 15-30 - [c4]Alan M. Frisch
Global Constraints for Lexicographic Orderings. CP 2002: 93-108 - [c3]Pierre Flener, Alan M. Frisch
Breaking Row and Column Symmetries in Matrix Models. CP 2002: 462-476 - 2001
- [b1]Ian Miguel:
Dynamic flexible constraint satisfaction and its application to AI planning. University of Edinburgh, UK, 2001 - [j4]Ian Miguel
Solution Techniques for Constraint Satisfaction Problems: Foundations. Artif. Intell. Rev. 15(4): 243-267 (2001) - [j3]Ian Miguel
Solution Techniques for Constraint Satisfaction Problems: Advanced Approaches. Artif. Intell. Rev. 15(4): 269-293 (2001) - [c2]Simon Colton, Ian Miguel
Constraint Generation via Automated Theory Formation. CP 2001: 575-579 - 2000
- [j2]Ian Miguel
Dynamic Flexible Constraint Satisfaction. Appl. Intell. 13(3): 231-245 (2000) - [c1]Ian Miguel, Peter Jarvis, Qiang Shen:
Flexible Graphplan. ECAI 2000: 506-510
1990 – 1999
- 1999
- [j1]Ian Miguel
Hard, flexible and dynamic constraint satisfaction. Knowl. Eng. Rev. 14(3): 199-220 (1999)
Coauthor Index
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-11-22 19:44 CET 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: