Ian P. Gent

According to our database, Ian P. Gent authored at least 111 papers between 1992 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Behaviour Planning: A Toolkit for Diverse Planning.

Mustafa F. Abdelwahed, Joan Espasa, Alice Toniolo, Ian P. Gent

CoRR, 2024

Solving Patience and Solitaire Games with Good Old Fashioned AI (Invited Talk).

Ian P. Gent

Proceedings of the 30th International Conference on Principles and Practice of Constraint Programming, 2024

2023

Bridging the Gap between Structural and Semantic Similarity in Diverse Planning.

Mustafa F. Abdelwahed, Joan Espasa, Alice Toniolo, Ian P. Gent

CoRR, 2023

Towards a Model of Puzznic.

Joan Espasa, Ian P. Gent, Ian Miguel, Peter Nightingale, András Z. Salamon, Mateu Villaret

CoRR, 2023

Conjure: Automatic Generation of Constraint Models from Problem Specifications (Extended Abstract).

Özgür Akgün, Alan M. Frisch, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022

Automatic Tabulation in Constraint Models.

Özgür Akgün, Ian P. Gent, Christopher Jefferson, Zeynep Kiziltan, Ian Miguel, Peter Nightingale, András Z. Salamon, Felix Ulrich-Oltean

CoRR, 2022

Conjure: Automatic Generation of Constraint Models from Problem Specifications.

Özgür Akgün, Alan M. Frisch, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale

Artif. Intell., 2022

2021

Towards Reformulating Essence Specifications for Robustness.

Özgür Akgün, Alan M. Frisch, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale, András Z. Salamon

CoRR, 2021

Using Small MUSes to Explain How to Solve Pen and Paper Puzzles.

Joan Espasa, Ian P. Gent, Ruth Hoffmann, Christopher Jefferson, Alice M. Lynch

CoRR, 2021

Explaining Pen and Paper Puzzles with MUSes?

Joan Espasa, Ian P. Gent, Ruth Hoffmann, Christopher Jefferson, Matthew J. McIlree, Alice M. Lynch

Proceedings of the SICSA eXplainable Artifical Intelligence Workshop 2021, 2021

2019

Solving Computational Problems in the Theory of Word-Representable Graphs.

Özgür Akgün, Ian P. Gent, Sergey Kitaev, Hans Zantema

J. Integer Seq., 2019

CSPLib: Twenty Years On.

Ian P. Gent, Toby Walsh

CoRR, 2019

The Winnability of Klondike and Many Other Single-Player Card Games.

Charlie Blake, Ian P. Gent

CoRR, 2019

2018

A review of literature on parallel constraint solving.

Ian P. Gent, Ian Miguel, Peter Nightingale, Ciaran McCreesh, Patrick Prosser, Neil C. A. Moore, Chris Unsworth

Theory Pract. Log. Program., 2018

Complexity of n-Queens Completion (Extended Abstract).

Ian P. Gent, Christopher Jefferson, Peter Nightingale

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

A Framework for Constraint Based Local Search using Essence.

Özgür Akgün, Saad Attieh, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale, András Z. Salamon, Patrick Spracklen, James Wetter

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Automatic Discovery and Exploitation of Promising Subproblems for Tabulation.

Özgür Akgün, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale, András Z. Salamon

Proceedings of the Principles and Practice of Constraint Programming, 2018

Metamorphic Testing of Constraint Solvers.

Özgür Akgün, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale

Proceedings of the Principles and Practice of Constraint Programming, 2018

2017

Complexity of n-Queens Completion.

Ian P. Gent, Christopher Jefferson, Peter Nightingale

J. Artif. Intell. Res., 2017

Generalized support and formal development of constraint propagators.

James L. Caldwell, Ian P. Gent, Peter Nightingale

AI Commun., 2017

Automatically improving constraint models in Savile Row.

Peter Nightingale, Özgür Akgün, Ian P. Gent, Christopher Jefferson, Ian Miguel, Patrick Spracklen

Artif. Intell., 2017

2016

Exploiting Short Supports for Improved Encoding of Arbitrary Constraints into SAT.

Özgür Akgün, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale

Proceedings of the Principles and Practice of Constraint Programming, 2016

2015

S-Crucial and Bicrucial Permutations with Respect to Squares.

Ian P. Gent, Sergey Kitaev, Alexander Konovalov, Steve Linton, Peter Nightingale

J. Integer Seq., 2015

Top Tips to Make Your Research Irreproducible.

Neil P. Chue Hong, Tom Crick, Ian P. Gent, Lars Kotthoff, Kenji Takeda

CoRR, 2015

2014

An Open and Reproducible Paper on Openness and Reproducibility of Papers in Computational Science.

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

CoRR, 2014

Qualitative modelling via constraint programming.

Thomas W. Kelsey, Lars Kotthoff, Christopher Jefferson, Stephen A. Linton, Ian Miguel, Peter Nightingale, Ian P. Gent

Constraints An Int. J., 2014

Generating custom propagators for arbitrary constraints.

Ian P. Gent, Christopher Jefferson, Steve Linton, Ian Miguel, Peter Nightingale

Artif. Intell., 2014

Recomputation.org: Experiences of Its First Year and Lessons Learned.

Ian P. Gent, Lars Kotthoff

Proceedings of the 7th IEEE/ACM International Conference on Utility and Cloud Computing, 2014

Breaking Conditional Symmetry in Automated Constraint Modelling with CONJURE.

Ozgur Akgun, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Automatically Improving Constraint Models in Savile Row through Associative-Commutative Common Subexpression Elimination.

Peter Nightingale, Özgür Akgün, Ian P. Gent, Christopher Jefferson, Ian Miguel

Proceedings of the Principles and Practice of Constraint Programming, 2014

Discriminating Instance Generation for Automated Constraint Model Selection.

Ian P. Gent, Bilal Syed Hussain, Christopher Jefferson, Lars Kotthoff, Ian Miguel, Glenna F. Nightingale, Peter Nightingale

Proceedings of the Principles and Practice of Constraint Programming, 2014

2013

Short and Long Supports for Constraint Propagation.

Peter Nightingale, Ian P. Gent, Christopher Jefferson, Ian Miguel

J. Artif. Intell. Res., 2013

Optimal Implementation of Watched Literals and More General Techniques.

Ian P. Gent

J. Artif. Intell. Res., 2013

The Recomputation Manifesto

Ian P. Gent

CoRR, 2013

Automated Symmetry Breaking and Model Selection in Conjure.

Ozgur Akgun, Alan M. Frisch, Ian P. Gent, Bilal Syed Hussain, Christopher Jefferson, Lars Kotthoff, Ian Miguel, Peter Nightingale

Proceedings of the Principles and Practice of Constraint Programming, 2013

2012

Qualitative Modelling via Constraint Programming: Past, Present and Future

Thomas W. Kelsey, Lars Kotthoff, Christopher Jefferson, Stephen A. Linton, Ian Miguel, Peter Nightingale, Ian P. Gent

CoRR, 2012

An evaluation of machine learning in algorithm selection for search problems.

Lars Kotthoff, Ian P. Gent, Ian Miguel

AI Commun., 2012

An empirical study of learning and forgetting constraints.

Ian P. Gent, Ian Miguel, Neil C. A. Moore

AI Commun., 2012

2011

Modelling Constraint Solver Architecture Design as a Constraint Problem

Ian P. Gent, Christopher Jefferson, Lars Kotthoff, Ian Miguel

CoRR, 2011

A Preliminary Evaluation of Machine Learning in Algorithm Selection for Search Problems.

Lars Kotthoff, Ian P. Gent, Ian Miguel

Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

Exploiting Short Supports for Generalised Arc Consistency for Arbitrary Constraints.

Peter Nightingale, Ian P. Gent, Christopher Jefferson, Ian Miguel

Proceedings of the IJCAI 2011, 2011

Propagation in Constraints: How One Thing Leads to Another.

Ian P. Gent

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011

Reliability of Computational Experiments on Virtualised Hardware.

Ian P. Gent, Lars Kotthoff

Proceedings of the AI for Data Center Management and Cloud Computing, 2011

2010

Machine learning for constraint solver design -- A case study for the alldifferent constraint

Ian P. Gent, Lars Kotthoff, Ian Miguel, Peter Nightingale

CoRR, 2010

Using machine learning to make constraint solver implementation decisions

Lars Kotthoff, Ian P. Gent, Ian Miguel

CoRR, 2010

Lazy Explanations for Constraint Propagators.

Ian P. Gent, Ian Miguel, Neil C. A. Moore

Proceedings of the Practical Aspects of Declarative Languages, 2010

Learning When to Use Lazy Learning in Constraint Solving.

Ian P. Gent, Christopher Jefferson, Lars Kotthoff, Ian Miguel, Neil C. A. Moore, Peter Nightingale, Karen E. Petrie

Proceedings of the ECAI 2010, 2010

Generating Special-Purpose Stateless Propagators for Arbitrary Constraints.

Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale

Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

2009

Automatically Enhancing Constraint Model Instances during Tailoring.

Andrea Rendl, Ian Miguel, Ian P. Gent, Christopher Jefferson

Proceedings of the Eighth Symposium on Abstraction, Reformulation, and Approximation, 2009

Common Subexpressions in Constraint Models of Planning Problems.

Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Gregory

Proceedings of the Eighth Symposium on Abstraction, Reformulation, and Approximation, 2009

Modelling Equidistant Frequency Permutation Arrays in Constraints.

Ian P. Gent, Paul McKay, Ian Miguel, Peter Nightingale, Sophie Huczynska

Proceedings of the Eighth Symposium on Abstraction, Reformulation, and Approximation, 2009

2008

Solving quantified constraint satisfaction problems.

Ian P. Gent, Peter Nightingale, Andrew G. D. Rowley, Kostas Stergiou

Artif. Intell., 2008

Generalised arc consistency for the AllDifferent constraint: An empirical survey.

Ian P. Gent, Ian Miguel, Peter Nightingale

Artif. Intell., 2008

2007

Search in the patience game 'Black Hole'.

Ian P. Gent, Christopher Jefferson, Tom W. Kelsey, Inês Lynce, Ian Miguel, Peter Nightingale, Barbara M. Smith, Armagan Tarim

AI Commun., 2007

Tailoring Solver-Independent Constraint Models: A Case Study with Essence' and Minion.

Ian P. Gent, Ian Miguel, Andrea Rendl

Proceedings of the Abstraction, 2007

Groupoids and Conditional Symmetry.

Ian P. Gent, Tom W. Kelsey, Stephen A. Linton, J. Pearson, Colva M. Roney-Dougal

Proceedings of the Principles and Practice of Constraint Programming, 2007

Data Structures for Generalised Arc Consistency for Extensional Constraints.

Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

Symmetry in Constraint Programming.

Ian P. Gent, Karen E. Petrie, Jean-François Puget

Proceedings of the Handbook of Constraint Programming, 2006

Minion: A Fast Scalable Constraint Solver.

Ian P. Gent, Christopher Jefferson, Ian Miguel

Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

Watched Literals for Constraint Propagation in Minion.

Ian P. Gent, Christopher Jefferson, Ian Miguel

Proceedings of the Principles and Practice of Constraint Programming, 2006

2005

Local and Global Complete Solution Learning Methods for QBF.

Ian P. Gent, Andrew G. D. Rowley

Proceedings of the Theory and Applications of Satisfiability Testing, 2005

QCSP-Solve: A Solver for Quantified Constraint Satisfaction Problems.

Ian P. Gent, Peter Nightingale, Kostas Stergiou

Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Symmetry and Consistency.

Ian P. Gent, Tom W. Kelsey, Steve Linton, Colva M. Roney-Dougal

Proceedings of the Principles and Practice of Constraint Programming, 2005

Conditional Symmetry Breaking.

Ian P. Gent, Tom W. Kelsey, Steve Linton, Iain McDonald, Ian Miguel, Barbara M. Smith

Proceedings of the Principles and Practice of Constraint Programming, 2005

2004

Tractable Symmetry Breaking Using Restricted Search Trees.

Colva M. Roney-Dougal, Ian P. Gent, Tom W. Kelsey, Steve Linton

Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

Encoding Quantified CSPs as Quantified Boolean Formulae.

Ian P. Gent, Peter Nightingale, Andrew G. D. Rowley

Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

Models and Symmetry Breaking for 'Peaceable Armies of Queens'.

Barbara M. Smith, Karen E. Petrie, Ian P. Gent

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2004

2003

Watched Data Structures for QBF Solvers.

Ian P. Gent, Enrico Giunchiglia, Massimo Narizzano, Andrew G. D. Rowley, Armando Tacchella

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

Supertree Construction with Constraint Programming.

Ian P. Gent, Patrick Prosser, Barbara M. Smith, Wu Wei

Proceedings of the Principles and Practice of Constraint Programming, 2003

Using Stochastic Local Search to Solve Quantified Boolean Formulae.

Ian P. Gent, Holger H. Hoos, Andrew G. D. Rowley, Kevin Smyth

Proceedings of the Principles and Practice of Constraint Programming, 2003

Generic SBDD Using Computational Group Theory.

Ian P. Gent, Warwick Harvey, Tom W. Kelsey, Steve Linton

Proceedings of the Principles and Practice of Constraint Programming, 2003

2002

An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists.

Ian P. Gent, Patrick Prosser

Proceedings of the 15th European Conference on Artificial Intelligence, 2002

Arc Consistency in SAT.

Ian P. Gent

Proceedings of the 15th European Conference on Artificial Intelligence, 2002

Groups and Constraints: Symmetry Breaking during Search.

Ian P. Gent, Warwick Harvey, Tom W. Kelsey

Proceedings of the Principles and Practice of Constraint Programming, 2002

2001

Frozen development in graph coloring.

Joseph C. Culberson, Ian P. Gent

Theor. Comput. Sci., 2001

Random Constraint Satisfaction: Flaws and Structure.

Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh

Constraints An Int. J., 2001

A Constraint Programming Approach to the Stable Marriage Problem.

Ian P. Gent, Robert W. Irving, David F. Manlove, Patrick Prosser, Barbara M. Smith

Proceedings of the Principles and Practice of Constraint Programming, 2001

2000

Search algorithms in type theory.

James L. Caldwell, Ian P. Gent, Judith L. Underwood

Theor. Comput. Sci., 2000

Satisfiability in the Year 2000.

Ian P. Gent, Toby Walsh

J. Autom. Reason., 2000

Backbone Fragility and the Local Search Cost Peak.

Josh Singer, Ian P. Gent, Alan Smaill

J. Artif. Intell. Res., 2000

Decomposable constraints.

Ian P. Gent, Kostas Stergiou, Toby Walsh

Artif. Intell., 2000

Parallel heuristic search in Haskell.

Michelle Cope, Ian P. Gent, Kevin Hammond

Proceedings of the Selected papers from the 2nd Scottish Functional Programming Workshop (SFP00), 2000

Local Search on Random 2+p-SAT.

Josh Singer, Ian P. Gent, Alan Smaill

Proceedings of the ECAI 2000, 2000

Symmetry Breaking in Constraint Programming.

Ian P. Gent, Barbara M. Smith

Proceedings of the ECAI 2000, 2000

1999

A Response to "On method overfitting".

Ian P. Gent

J. Heuristics, 1999

Paul R. Cohen's Empirical Methods for Artificial Intelligence.

Ian P. Gent, Toby Walsh

Artif. Intell., 1999

CSP_LIB: A Benchmark Library for Constraints.

Ian P. Gent, Toby Walsh

Proceedings of the Principles and Practice of Constraint Programming, 1999

Beyond NP: the QSAT phase transition.

Ian P. Gent, Toby Walsh

Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999

Morphing: Combining Structure and Randomness.

Ian P. Gent, Holger H. Hoos, Patrick Prosser, Toby Walsh

Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999

1998

Asymptotic and Finite Size Parameters for Phase Transitions: Hamiltonian Circuit as a Case Study.

Jeremy Frank, Ian P. Gent, Toby Walsh

Inf. Process. Lett., 1998

Heuristic Solution of Open Bin Packing Problems.

Ian P. Gent

J. Heuristics, 1998

Analysis of Heuristics for Number Partitioning.

Ian P. Gent, Toby Walsh

Comput. Intell., 1998

1997

From Approximate to Optimal Solutions: Constructing Pruning and Propagation Rules.

Ian P. Gent, Toby Walsh

Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997

The Logic of Search Algorithms: Theory and Applications.

Ian P. Gent, Judith L. Underwood

Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997

The Constrainedness of Arc Consistency.

Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh

Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997

The Scaling of Search Cost.

Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh

Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997

1996

The Satisfiability Constraint Gap.

Ian P. Gent, Toby Walsh

Artif. Intell., 1996

The TSP Phase Transition.

Ian P. Gent, Toby Walsh

Artif. Intell., 1996

Phase Transitions and Annealed Theories: Number Partitioning as a Case Study.

Ian P. Gent, Toby Walsh

Proceedings of the 12th European Conference on Artificial Intelligence, 1996

An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem.

Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh

Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

Local Search and the Number of Solutions.

David A. Clark, Jeremy Frank, Ian P. Gent, Ewan MacIntyre, Neven Tomov, Toby Walsh

Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

The Constrainedness of Search.

Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh

Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995

Scaling Effects in the CSP Phase Transition.

Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh

Proceedings of the Principles and Practice of Constraint Programming, 1995

1994

Easy Problems are Sometimes Hard.

Ian P. Gent, Toby Walsh

Artif. Intell., 1994

The Hardest Random SAT Problems.

Ian P. Gent, Toby Walsh

Proceedings of the KI-94: Advances in Artificial Intelligence, 1994

The SAT Phase Transition.

Ian P. Gent, Toby Walsh

Proceedings of the Eleventh European Conference on Artificial Intelligence, 1994

1993

Analytic proof systems for classical and modal logics of restricted quantification.

Ian Philip Gent

PhD thesis, 1993

Theory matrices (for modal logics) Using alphabetical monotonicity.

Ian P. Gent

Stud Logica, 1993

An Empirical Analysis of Search in GSAT.

Ian P. Gent, Toby Walsh

J. Artif. Intell. Res., 1993

Towards an Understanding of Hill-Climbing Procedures for SAT.

Ian P. Gent, Toby Walsh

Proceedings of the 11th National Conference on Artificial Intelligence. Washington, 1993

1992

A Sequent- or Tableau-style System for Lewis's Counterfactual Logic VC.

Ian P. Gent

Notre Dame J. Formal Log., 1992