Ian P. Gent

ORCID

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 26

Top Venues

CoRR

Artif. Intell.

IJCAI

Publications

Ian P. Gent
Solving Patience and Solitaire Games with Good Old Fashioned AI (Invited Talk). CP (2024)
Mustafa F. Abdelwahed, Joan Espasa, Alice Toniolo, Ian P. Gent
Behaviour Planning: A Toolkit for Diverse Planning. CoRR (2024)
Joan Espasa, Ian P. Gent, Ian Miguel, Peter Nightingale, András Z. Salamon, Mateu Villaret
Towards a Model of Puzznic. CoRR (2023)
Özgür Akgün, Alan M. Frisch, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale
Conjure: Automatic Generation of Constraint Models from Problem Specifications (Extended Abstract). IJCAI (2023)
Mustafa F. Abdelwahed, Joan Espasa, Alice Toniolo, Ian P. Gent
Bridging the Gap between Structural and Semantic Similarity in Diverse Planning. CoRR (2023)
Özgür Akgün, Alan M. Frisch, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale
Conjure: Automatic Generation of Constraint Models from Problem Specifications. Artif. Intell. 310 (2022)
Özgür Akgün, Ian P. Gent, Christopher Jefferson, Zeynep Kiziltan, Ian Miguel, Peter Nightingale, András Z. Salamon, Felix Ulrich-Oltean
Automatic Tabulation in Constraint Models. CoRR (2022)
Joan Espasa, Ian P. Gent, Ruth Hoffmann, Christopher Jefferson, Alice M. Lynch
Using Small MUSes to Explain How to Solve Pen and Paper Puzzles. CoRR (2021)
Özgür Akgün, Alan M. Frisch, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale, András Z. Salamon
Towards Reformulating Essence Specifications for Robustness. CoRR (2021)
Joan Espasa, Ian P. Gent, Ruth Hoffmann, Christopher Jefferson, Matthew J. McIlree, Alice M. Lynch
Explaining Pen and Paper Puzzles with MUSes? SICSA XAI (2021)
Özgür Akgün, Ian P. Gent, Sergey Kitaev, Hans Zantema
Solving Computational Problems in the Theory of Word-Representable Graphs. J. Integer Seq. 22 (2) (2019)
Charlie Blake, Ian P. Gent
The Winnability of Klondike and Many Other Single-Player Card Games. CoRR (2019)
Ian P. Gent, Toby Walsh
CSPLib: Twenty Years On. CoRR (2019)
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 (2018)
Ian P. Gent, Christopher Jefferson, Peter Nightingale
Complexity of n-Queens Completion (Extended Abstract). IJCAI (2018)
Özgür Akgün, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale
Metamorphic Testing of Constraint Solvers. CP (2018)
Özgür Akgün, Saad Attieh, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale, András Z. Salamon, Patrick Spracklen, James Wetter
A Framework for Constraint Based Local Search using Essence. IJCAI (2018)
Özgür Akgün, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale, András Z. Salamon
Automatic Discovery and Exploitation of Promising Subproblems for Tabulation. CP (2018)
Ian P. Gent, Ian Miguel, Peter Nightingale, Ciaran McCreesh, Patrick Prosser, Neil C. A. Moore, Chris Unsworth
A review of literature on parallel constraint solving. Theory Pract. Log. Program. 18 (5-6) (2018)
Ian P. Gent, Christopher Jefferson, Peter Nightingale
Complexity of n-Queens Completion. J. Artif. Intell. Res. 59 (2017)
James L. Caldwell, Ian P. Gent, Peter Nightingale
Generalized support and formal development of constraint propagators. AI Commun. 30 (5) (2017)
Peter Nightingale, Özgür Akgün, Ian P. Gent, Christopher Jefferson, Ian Miguel, Patrick Spracklen
Automatically improving constraint models in Savile Row. Artif. Intell. 251 (2017)
Özgür Akgün, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale
Exploiting Short Supports for Improved Encoding of Arbitrary Constraints into SAT. CP (2016)
Ian P. Gent, Sergey Kitaev, Alexander Konovalov, Steve Linton, Peter Nightingale
S-Crucial and Bicrucial Permutations with Respect to Squares. J. Integer Seq. 18 (6) (2015)
Neil P. Chue Hong, Tom Crick, Ian P. Gent, Lars Kotthoff, Kenji Takeda
Top Tips to Make Your Research Irreproducible. CoRR (2015)
James L. Caldwell, Ian P. Gent, Peter Nightingale
Generalized Support and Formal Development of Constraint Propagators. CoRR (2015)
Thomas W. Kelsey, Lars Kotthoff, Christopher Jefferson, Stephen A. Linton, Ian Miguel, Peter Nightingale, Ian P. Gent
Qualitative modelling via constraint programming. Constraints An Int. J. 19 (2) (2014)
Ozgur Akgun, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale
Breaking Conditional Symmetry in Automated Constraint Modelling with CONJURE. ECAI (2014)
Peter Nightingale, Özgür Akgün, Ian P. Gent, Christopher Jefferson, Ian Miguel
Automatically Improving Constraint Models in Savile Row through Associative-Commutative Common Subexpression Elimination. CP (2014)
Ian P. Gent, Bilal Syed Hussain, Christopher Jefferson, Lars Kotthoff, Ian Miguel, Glenna F. Nightingale, Peter Nightingale
Discriminating Instance Generation for Automated Constraint Model Selection. CP (2014)
Ian P. Gent, Christopher Jefferson, Steve Linton, Ian Miguel, Peter Nightingale
Generating custom propagators for arbitrary constraints. Artif. Intell. 211 (2014)
Sylwester Arabas, Michael R. Bareford, Ian P. Gent, Benjamin M. Gorman, Masih Hajiarabderkani, Tristan Henderson, Luke Hutton, Alexander Konovalov, Lars Kotthoff, Ciaran McCreesh, Ruma R. Paul, Karen E. Petrie, Abdul Razaq, Daniël Reijsbergen
An Open and Reproducible Paper on Openness and Reproducibility of Papers in Computational Science. CoRR (2014)
Ian P. Gent, Lars Kotthoff
Recomputation.org: Experiences of Its First Year and Lessons Learned. UCC (2014)
Ian P. Gent
The Recomputation Manifesto CoRR (2013)
Peter Nightingale, Ian P. Gent, Christopher Jefferson, Ian Miguel
Short and Long Supports for Constraint Propagation. J. Artif. Intell. Res. 46 (2013)
Ozgur Akgun, Alan M. Frisch, Ian P. Gent, Bilal Syed Hussain, Christopher Jefferson, Lars Kotthoff, Ian Miguel, Peter Nightingale
Automated Symmetry Breaking and Model Selection in Conjure. CP (2013)
Ian P. Gent
Optimal Implementation of Watched Literals and More General Techniques. J. Artif. Intell. Res. 48 (2013)
Ian P. Gent, Ian Miguel, Neil C. A. Moore
An empirical study of learning and forgetting constraints. AI Commun. 25 (2) (2012)
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 (2012)
Lars Kotthoff, Ian P. Gent, Ian Miguel
An evaluation of machine learning in algorithm selection for search problems. AI Commun. 25 (3) (2012)
Ian P. Gent, Lars Kotthoff
Reliability of Computational Experiments on Virtualised Hardware CoRR (2011)
Lars Kotthoff, Ian P. Gent, Ian Miguel
A Preliminary Evaluation of Machine Learning in Algorithm Selection for Search Problems. SOCS (2011)
Peter Nightingale, Ian P. Gent, Christopher Jefferson, Ian Miguel
Exploiting Short Supports for Generalised Arc Consistency for Arbitrary Constraints. IJCAI (2011)
Ian P. Gent, Lars Kotthoff
Reliability of Computational Experiments on Virtualised Hardware. AI for Data Center Management and Cloud Computing (2011)
Ian P. Gent, Josh Singer, Alan Smaill
Backbone Fragility and the Local Search Cost Peak CoRR (2011)
Ian P. Gent, Christopher Jefferson, Lars Kotthoff, Ian Miguel
Modelling Constraint Solver Architecture Design as a Constraint Problem CoRR (2011)
Ian P. Gent
Propagation in Constraints: How One Thing Leads to Another. CPAIOR (2011)
Ian P. Gent, Ian Miguel, Neil C. A. Moore
Lazy Explanations for Constraint Propagators. PADL (2010)
Lars Kotthoff, Ian P. Gent, Ian Miguel
Using machine learning to make constraint solver implementation decisions CoRR (2010)
Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale
Generating Special-Purpose Stateless Propagators for Arbitrary Constraints. CP (2010)
Ian P. Gent, Christopher Jefferson, Lars Kotthoff, Ian Miguel, Neil C. A. Moore, Peter Nightingale, Karen E. Petrie
Learning When to Use Lazy Learning in Constraint Solving. ECAI (2010)
Ian P. Gent, Lars Kotthoff, Ian Miguel, Peter Nightingale
Machine learning for constraint solver design -- A case study for the alldifferent constraint CoRR (2010)
Andrea Rendl, Ian Miguel, Ian P. Gent, Christopher Jefferson
Automatically Enhancing Constraint Model Instances during Tailoring. SARA (2009)
Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Gregory
Common Subexpressions in Constraint Models of Planning Problems. SARA (2009)
Ian P. Gent, Paul McKay, Ian Miguel, Peter Nightingale, Sophie Huczynska
Modelling Equidistant Frequency Permutation Arrays in Constraints. SARA (2009)
Ian P. Gent, Ian Miguel, Peter Nightingale
Generalised arc consistency for the AllDifferent constraint: An empirical survey. Artif. Intell. 172 (18) (2008)
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowley, Kostas Stergiou
Solving quantified constraint satisfaction problems. Artif. Intell. 172 (6-7) (2008)
Ian P. Gent, Christopher Jefferson, Tom Kelsey, Inês Lynce, Ian Miguel, Peter Nightingale, Barbara M. Smith, Armagan Tarim
Search in the patience game 'Black Hole'. AI Commun. 20 (3) (2007)
Ian P. Gent, Ian Miguel, Andrea Rendl
Tailoring Solver-Independent Constraint Models: A Case Study with Essence' and Minion. SARA (2007)
Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale
Data Structures for Generalised Arc Consistency for Extensional Constraints. AAAI (2007)
Ian P. Gent, Tom Kelsey, Stephen A. Linton, J. Pearson, Colva M. Roney-Dougal
Groupoids and Conditional Symmetry. CP (2007)
Ian P. Gent, Christopher Jefferson, Ian Miguel
Minion: A Fast Scalable Constraint Solver. ECAI (2006)
Ian P. Gent, Christopher Jefferson, Ian Miguel
Watched Literals for Constraint Propagation in Minion. CP (2006)
Ian P. Gent, Tom Kelsey, Steve Linton, Colva M. Roney-Dougal
Symmetry and Consistency. CP (2005)
Ian P. Gent, Tom Kelsey, Steve Linton, Iain McDonald, Ian Miguel, Barbara M. Smith
Conditional Symmetry Breaking. CP (2005)
Ian P. Gent, Andrew G. D. Rowley
Local and Global Complete Solution Learning Methods for QBF. SAT (2005)
Ian P. Gent, Peter Nightingale, Kostas Stergiou
QCSP-Solve: A Solver for Quantified Constraint Satisfaction Problems. IJCAI (2005)
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowley
Encoding Quantified CSPs as Quantified Boolean Formulae. ECAI (2004)
Colva M. Roney-Dougal, Ian P. Gent, Tom Kelsey, Steve Linton
Tractable Symmetry Breaking Using Restricted Search Trees. ECAI (2004)
Barbara M. Smith, Karen E. Petrie, Ian P. Gent
Models and Symmetry Breaking for 'Peaceable Armies of Queens'. CPAIOR (2004)
Ian P. Gent, Holger H. Hoos, Andrew G. D. Rowley, Kevin Smyth
Using Stochastic Local Search to Solve Quantified Boolean Formulae. CP (2003)
Ian P. Gent, Warwick Harvey, Tom Kelsey, Steve Linton
Generic SBDD Using Computational Group Theory. CP (2003)
Ian P. Gent, Enrico Giunchiglia, Massimo Narizzano, Andrew G. D. Rowley, Armando Tacchella
Watched Data Structures for QBF Solvers. SAT (2003)
Ian P. Gent, Patrick Prosser, Barbara M. Smith, Wu Wei
Supertree Construction with Constraint Programming. CP (2003)
Ian P. Gent, Patrick Prosser
An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists. ECAI (2002)
Ian P. Gent, Toby Walsh
Satisfiability in the Year 2000. J. Autom. Reason. 28 (2) (2002)
Ian P. Gent, Warwick Harvey, Tom Kelsey
Groups and Constraints: Symmetry Breaking during Search. CP (2002)
Ian P. Gent
Arc Consistency in SAT. ECAI (2002)
Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh
Random Constraint Satisfaction: Flaws and Structure. Constraints An Int. J. 6 (4) (2001)
Ian P. Gent, Robert W. Irving, David F. Manlove, Patrick Prosser, Barbara M. Smith
A Constraint Programming Approach to the Stable Marriage Problem. CP (2001)
Joseph C. Culberson, Ian P. Gent
Frozen development in graph coloring. Theor. Comput. Sci. 265 (1-2) (2001)
Josh Singer, Ian P. Gent, Alan Smaill
Backbone Fragility and the Local Search Cost Peak. J. Artif. Intell. Res. 12 (2000)
Ian P. Gent, Barbara M. Smith
Symmetry Breaking in Constraint Programming. ECAI (2000)
Josh Singer, Ian P. Gent, Alan Smaill
Local Search on Random 2+p-SAT. ECAI (2000)
Michelle Cope, Ian P. Gent, Kevin Hammond
Parallel heuristic search in Haskell. Scottish Functional Programming Workshop (2000)
Ian P. Gent, Kostas Stergiou, Toby Walsh
Decomposable constraints. Artif. Intell. 123 (1-2) (2000)
James L. Caldwell, Ian P. Gent, Judith L. Underwood
Search algorithms in type theory. Theor. Comput. Sci. 232 (1-2) (2000)
Ian P. Gent, Toby Walsh
Satisfiability in the Year 2000. J. Autom. Reason. 24 (1/2) (2000)
Ian P. Gent, Holger H. Hoos, Patrick Prosser, Toby Walsh
Morphing: Combining Structure and Randomness. AAAI/IAAI (1999)
Ian P. Gent, Toby Walsh
Paul R. Cohen's Empirical Methods for Artificial Intelligence. Artif. Intell. 113 (1-2) (1999)
Ian P. Gent, Toby Walsh
: A Benchmark Library for Constraints. CP (1999)
Ian P. Gent
A Response to "On method overfitting". J. Heuristics 5 (1) (1999)
Ian P. Gent, Toby Walsh
Beyond NP: the QSAT phase transition. AAAI/IAAI (1999)
Ian P. Gent, Kostas Stergiou, Toby Walsh
Decomposable Constraints. New Trends in Constraints (1999)
Ian P. Gent
Heuristic Solution of Open Bin Packing Problems. J. Heuristics 3 (4) (1998)
Ian P. Gent, Toby Walsh
Analysis of Heuristics for Number Partitioning. Comput. Intell. 14 (3) (1998)
Jeremy Frank, Ian P. Gent, Toby Walsh
Asymptotic and Finite Size Parameters for Phase Transitions: Hamiltonian Circuit as a Case Study. Inf. Process. Lett. 65 (5) (1998)
Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh
The Scaling of Search Cost. AAAI/IAAI (1997)
Ian P. Gent, Toby Walsh
From Approximate to Optimal Solutions: Constructing Pruning and Propagation Rules. IJCAI (1997)
Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh
The Constrainedness of Arc Consistency. CP (1997)

Ian P. Gent.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ian P. Gent