default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIan P. Gent
Ian Philip Gent
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
[c62]Ian P. Gent:
Solving Patience and Solitaire Games with Good Old Fashioned AI (Invited Talk). CP 2024: 1:1-1:1- [i21]Mustafa F. Abdelwahed, Joan Espasa, Alice Toniolo, Ian P. Gent:
Behaviour Planning: A Toolkit for Diverse Planning. CoRR abs/2405.04300 (2024) - 2023
- [c61]Ö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: 6833-6838 - [i20]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) - [i19]Mustafa F. Abdelwahed, Joan Espasa, Alice Toniolo, Ian P. Gent:
Bridging the Gap between Structural and Semantic Similarity in Diverse Planning. CoRR abs/2310.01520 (2023) - 2022
- [j34]Ö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: 103751 (2022) - [i18]Ö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 abs/2202.13250 (2022) - 2021
- [c60]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: 56-63 - [i17]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 abs/2104.15040 (2021) - [i16]Ö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 abs/2111.00821 (2021)
2010 – 2019
- 2019
- [j33]Ö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): 19.2.5 (2019) - [i15]Charlie Blake, Ian P. Gent:
The Winnability of Klondike and Many Other Single-Player Card Games. CoRR abs/1906.12314 (2019) - [i14]Ian P. Gent, Toby Walsh:
CSPLib: Twenty Years On. CoRR abs/1909.13430 (2019) - 2018
- [j32]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): 725-758 (2018) - [c59]Ö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: 3-12 - [c58]Özgür Akgün, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale:
Metamorphic Testing of Constraint Solvers. CP 2018: 727-736 - [c57]Ö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: 1242-1248 - [c56]Ian P. Gent, Christopher Jefferson, Peter Nightingale:
Complexity of n-Queens Completion (Extended Abstract). IJCAI 2018: 5608-5611 - [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) - 2017
- [j31]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: 35-61 (2017) - [j30]James L. Caldwell, Ian P. Gent, Peter Nightingale:
Generalized support and formal development of constraint propagators. AI Commun. 30(5): 325-346 (2017) - [j29]Ian P. Gent, Christopher Jefferson, Peter Nightingale:
Complexity of n-Queens Completion. J. Artif. Intell. Res. 59: 815-848 (2017) - 2016
- [c55]Ö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: 3-12 - 2015
- [j28]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): 15.6.5 (2015) - [i12]Neil P. Chue Hong, Tom Crick, Ian P. Gent, Lars Kotthoff, Kenji Takeda:
Top Tips to Make Your Research Irreproducible. CoRR abs/1504.00062 (2015) - [i11]James L. Caldwell, Ian P. Gent, Peter Nightingale:
Generalized Support and Formal Development of Constraint Propagators. CoRR abs/1504.05846 (2015) - 2014
- [j27]Ian P. Gent, Christopher Jefferson, Steve Linton, Ian Miguel, Peter Nightingale:
Generating custom propagators for arbitrary constraints. Artif. Intell. 211: 1-33 (2014) - [j26]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): 163-173 (2014) - [c54]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: 356-365 - [c53]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: 590-605 - [c52]Ozgur Akgun, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale:
Breaking Conditional Symmetry in Automated Constraint Modelling with CONJURE. ECAI 2014: 3-8 - [c51]Ian P. Gent, Lars Kotthoff:
Recomputation.org: Experiences of Its First Year and Lessons Learned. UCC 2014: 968-973 - [i10]Peter Nightingale, Ian Philip Gent, Christopher Jefferson, Ian Miguel:
Short and Long Supports for Constraint Propagation. CoRR abs/1402.0559 (2014) - [i9]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 abs/1408.2123 (2014) - 2013
- [j25]Peter Nightingale, Ian P. Gent, Christopher Jefferson, Ian Miguel:
Short and Long Supports for Constraint Propagation. J. Artif. Intell. Res. 46: 1-45 (2013) - [j24]Ian P. Gent:
Optimal Implementation of Watched Literals and More General Techniques. J. Artif. Intell. Res. 48: 231-251 (2013) - [c50]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: 107-116 - [i8]Ian P. Gent:
The Recomputation Manifesto. CoRR abs/1304.3674 (2013) - 2012
- [j23]Ian P. Gent, Ian Miguel, Neil C. A. Moore:
An empirical study of learning and forgetting constraints. AI Commun. 25(2): 191-208 (2012) - [j22]Lars Kotthoff, Ian P. Gent, Ian Miguel:
An evaluation of machine learning in algorithm selection for search problems. AI Commun. 25(3): 257-270 (2012) - [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
- [c49]Ian P. Gent, Lars Kotthoff:
Reliability of Computational Experiments on Virtualised Hardware. AI for Data Center Management and Cloud Computing 2011 - [c48]Ian P. Gent:
Propagation in Constraints: How One Thing Leads to Another. CPAIOR 2011: 2 - [c47]Peter Nightingale, Ian P. Gent, Christopher Jefferson, Ian Miguel:
Exploiting Short Supports for Generalised Arc Consistency for Arbitrary Constraints. IJCAI 2011: 623-628 - [c46]Lars Kotthoff, Ian P. Gent, Ian Miguel:
A Preliminary Evaluation of Machine Learning in Algorithm Selection for Search Problems. SOCS 2011: 84-91 - [i6]Ian P. Gent, Josh Singer, Alan Smaill:
Backbone Fragility and the Local Search Cost Peak. CoRR abs/1106.0240 (2011) - [i5]Ian P. Gent, Lars Kotthoff:
Reliability of Computational Experiments on Virtualised Hardware. CoRR abs/1110.6288 (2011) - [i4]Ian P. Gent, Christopher Jefferson, Lars Kotthoff, Ian Miguel:
Modelling Constraint Solver Architecture Design as a Constraint Problem. CoRR abs/1110.6290 (2011) - 2010
- [c45]Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale:
Generating Special-Purpose Stateless Propagators for Arbitrary Constraints. CP 2010: 206-220 - [c44]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: 873-878 - [c43]Ian P. Gent, Ian Miguel, Neil C. A. Moore:
Lazy Explanations for Constraint Propagators. PADL 2010: 217-233 - [i3]Lars Kotthoff, Ian P. Gent, Ian Miguel:
Using machine learning to make constraint solver implementation decisions. CoRR abs/1005.3502 (2010) - [i2]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
- [c42]Ian P. Gent, Paul McKay, Ian Miguel, Peter Nightingale, Sophie Huczynska:
Modelling Equidistant Frequency Permutation Arrays in Constraints. SARA 2009 - [c41]Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Gregory:
Common Subexpressions in Constraint Models of Planning Problems. SARA 2009 - [c40]Andrea Rendl, Ian Miguel, Ian P. Gent, Christopher Jefferson:
Automatically Enhancing Constraint Model Instances during Tailoring. SARA 2009 - [e1]Ian P. Gent:
Principles and Practice of Constraint Programming - CP 2009, 15th International Conference, CP 2009, Lisbon, Portugal, September 20-24, 2009, Proceedings. Lecture Notes in Computer Science 5732, Springer 2009, ISBN 978-3-642-04243-0 [contents] - 2008
- [j21]Ian P. Gent, Peter Nightingale, Andrew G. D. Rowley, Kostas Stergiou:
Solving quantified constraint satisfaction problems. Artif. Intell. 172(6-7): 738-771 (2008) - [j20]Ian P. Gent, Ian Miguel, Peter Nightingale:
Generalised arc consistency for the AllDifferent constraint: An empirical survey. Artif. Intell. 172(18): 1973-2000 (2008) - 2007
- [j19]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): 211-226 (2007) - [c39]Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale:
Data Structures for Generalised Arc Consistency for Extensional Constraints. AAAI 2007: 191-197 - [c38]Ian P. Gent, Tom Kelsey, Stephen A. Linton, J. Pearson, Colva M. Roney-Dougal:
Groupoids and Conditional Symmetry. CP 2007: 823-830 - [c37]Ian P. Gent, Ian Miguel, Andrea Rendl:
Tailoring Solver-Independent Constraint Models: A Case Study with Essence' and Minion. SARA 2007: 184-199 - 2006
- [c36]Ian P. Gent, Christopher Jefferson, Ian Miguel:
Watched Literals for Constraint Propagation in Minion. CP 2006: 182-197 - [c35]Ian P. Gent, Christopher Jefferson, Ian Miguel:
Minion: A Fast Scalable Constraint Solver. ECAI 2006: 98-102 - [r1]Ian P. Gent, Karen E. Petrie, Jean-François Puget:
Symmetry in Constraint Programming. Handbook of Constraint Programming 2006: 329-376 - 2005
- [c34]Ian P. Gent, Tom Kelsey, Steve Linton, Iain McDonald, Ian Miguel, Barbara M. Smith:
Conditional Symmetry Breaking. CP 2005: 256-270 - [c33]Ian P. Gent, Tom Kelsey, Steve Linton, Colva M. Roney-Dougal:
Symmetry and Consistency. CP 2005: 271-285 - [c32]Ian P. Gent, Peter Nightingale, Kostas Stergiou:
QCSP-Solve: A Solver for Quantified Constraint Satisfaction Problems. IJCAI 2005: 138-143 - [c31]Ian P. Gent, Andrew G. D. Rowley:
Local and Global Complete Solution Learning Methods for QBF. SAT 2005: 91-106 - 2004
- [c30]Barbara M. Smith, Karen E. Petrie, Ian P. Gent:
Models and Symmetry Breaking for 'Peaceable Armies of Queens'. CPAIOR 2004: 271-286 - [c29]Ian P. Gent, Peter Nightingale, Andrew G. D. Rowley:
Encoding Quantified CSPs as Quantified Boolean Formulae. ECAI 2004: 176-180 - [c28]Colva M. Roney-Dougal, Ian P. Gent, Tom Kelsey, Steve Linton:
Tractable Symmetry Breaking Using Restricted Search Trees. ECAI 2004: 211-215 - 2003
- [c27]Ian P. Gent, Warwick Harvey, Tom Kelsey, Steve Linton:
Generic SBDD Using Computational Group Theory. CP 2003: 333-347 - [c26]Ian P. Gent, Holger H. Hoos, Andrew G. D. Rowley, Kevin Smyth:
Using Stochastic Local Search to Solve Quantified Boolean Formulae. CP 2003: 348-362 - [c25]Ian P. Gent, Patrick Prosser, Barbara M. Smith, Wu Wei:
Supertree Construction with Constraint Programming. CP 2003: 837-841 - [c24]Ian P. Gent, Enrico Giunchiglia, Massimo Narizzano, Andrew G. D. Rowley, Armando Tacchella:
Watched Data Structures for QBF Solvers. SAT 2003: 25-36 - 2002
- [j18]Ian P. Gent, Toby Walsh:
Satisfiability in the Year 2000. J. Autom. Reason. 28(2): 99 (2002) - [c23]Ian P. Gent, Warwick Harvey, Tom Kelsey:
Groups and Constraints: Symmetry Breaking during Search. CP 2002: 415-430 - [c22]Ian P. Gent:
Arc Consistency in SAT. ECAI 2002: 121-125 - [c21]Ian P. Gent, Patrick Prosser:
An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists. ECAI 2002: 141-145 - 2001
- [j17]Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh:
Random Constraint Satisfaction: Flaws and Structure. Constraints An Int. J. 6(4): 345-372 (2001) - [j16]Joseph C. Culberson, Ian P. Gent:
Frozen development in graph coloring. Theor. Comput. Sci. 265(1-2): 227-264 (2001) - [c20]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: 225-239 - 2000
- [j15]Ian P. Gent, Kostas Stergiou, Toby Walsh:
Decomposable constraints. Artif. Intell. 123(1-2): 133-156 (2000) - [j14]Josh Singer, Ian P. Gent, Alan Smaill:
Backbone Fragility and the Local Search Cost Peak. J. Artif. Intell. Res. 12: 235-270 (2000) - [j13]Ian P. Gent, Toby Walsh:
Satisfiability in the Year 2000. J. Autom. Reason. 24(1/2): 1-3 (2000) - [j12]James L. Caldwell, Ian P. Gent, Judith L. Underwood:
Search algorithms in type theory. Theor. Comput. Sci. 232(1-2): 55-90 (2000) - [c19]Josh Singer, Ian P. Gent, Alan Smaill:
Local Search on Random 2+p-SAT. ECAI 2000: 113-117 - [c18]Ian P. Gent, Barbara M. Smith:
Symmetry Breaking in Constraint Programming. ECAI 2000: 599-603 - [c17]Michelle Cope, Ian P. Gent, Kevin Hammond:
Parallel heuristic search in Haskell. Scottish Functional Programming Workshop 2000: 65-76
1990 – 1999
- 1999
- [j11]Ian P. Gent, Toby Walsh:
Paul R. Cohen's Empirical Methods for Artificial Intelligence. Artif. Intell. 113(1-2): 285-290 (1999) - [j10]Ian P. Gent:
A Response to "On method overfitting". J. Heuristics 5(1): 109-111 (1999) - [c16]Ian P. Gent, Toby Walsh:
Beyond NP: the QSAT phase transition. AAAI/IAAI 1999: 648-653 - [c15]Ian P. Gent, Holger H. Hoos, Patrick Prosser, Toby Walsh:
Morphing: Combining Structure and Randomness. AAAI/IAAI 1999: 654-660 - [c14]Ian P. Gent, Kostas Stergiou, Toby Walsh:
Decomposable Constraints. New Trends in Constraints 1999: 134-149 - [c13]Ian P. Gent, Toby Walsh:
CSPLIB: A Benchmark Library for Constraints. CP 1999: 480-481 - 1998
- [j9]Ian P. Gent, Toby Walsh:
Analysis of Heuristics for Number Partitioning. Comput. Intell. 14(3): 430-451 (1998) - [j8]Ian P. Gent:
Heuristic Solution of Open Bin Packing Problems. J. Heuristics 3(4): 299-304 (1998) - [j7]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): 241-245 (1998) - 1997
- [c12]Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh:
The Scaling of Search Cost. AAAI/IAAI 1997: 315-320 - [c11]Ian P. Gent, Judith L. Underwood:
The Logic of Search Algorithms: Theory and Applications. CP 1997: 77-91 - [c10]Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh:
The Constrainedness of Arc Consistency. CP 1997: 327-340 - [c9]Ian P. Gent, Toby Walsh:
From Approximate to Optimal Solutions: Constructing Pruning and Propagation Rules. IJCAI 1997: 1396-1401 - 1996
- [j6]Ian P. Gent, Toby Walsh:
The Satisfiability Constraint Gap. Artif. Intell. 81(1-2): 59-80 (1996) - [j5]Ian P. Gent, Toby Walsh:
The TSP Phase Transition. Artif. Intell. 88(1-2): 349-358 (1996) - [c8]Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh:
The Constrainedness of Search. AAAI/IAAI, Vol. 1 1996: 246-252 - [c7]David A. Clark, Jeremy Frank, Ian P. Gent, Ewan MacIntyre, Neven Tomov, Toby Walsh:
Local Search and the Number of Solutions. CP 1996: 119-133 - [c6]Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh:
An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem. CP 1996: 179-193 - [c5]Ian P. Gent, Toby Walsh:
Phase Transitions and Annealed Theories: Number Partitioning as a Case Study. ECAI 1996: 170-174 - 1995
- [c4]Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh:
Scaling Effects in the CSP Phase Transition. CP 1995: 70-87 - 1994
- [j4]Ian P. Gent, Toby Walsh:
Easy Problems are Sometimes Hard. Artif. Intell. 70(1-2): 335-345 (1994) - [c3]Ian P. Gent, Toby Walsh:
The SAT Phase Transition. ECAI 1994: 105-109 - [c2]Ian P. Gent, Toby Walsh:
The Hardest Random SAT Problems. KI 1994: 355-366 - 1993
- [b1]Ian Philip Gent:
Analytic proof systems for classical and modal logics of restricted quantification. University of Warwick, Coventry, UK, 1993 - [j3]Ian P. Gent, Toby Walsh:
An Empirical Analysis of Search in GSAT. J. Artif. Intell. Res. 1: 47-59 (1993) - [j2]Ian P. Gent:
Theory matrices (for modal logics) Using alphabetical monotonicity. Stud Logica 52(2): 233-258 (1993) - [c1]Ian P. Gent, Toby Walsh:
Towards an Understanding of Hill-Climbing Procedures for SAT. AAAI 1993: 28-33 - [i1]Ian P. Gent, Toby Walsh:
An Empirical Analysis of Search in GSAT. CoRR cs.AI/9309101 (1993) - 1992
- [j1]