Ian P. Gent
According to our database^{1},
Ian P. Gent
authored at least 99 papers
between 1992 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:

at orcid.org
On csauthors.net:
Bibliography
2019
CSPLib: Twenty Years On.
CoRR, 2019
The Winnability of Klondike and Many Other SinglePlayer Card Games.
CoRR, 2019
2018
A review of literature on parallel constraint solving.
TPLP, 2018
Complexity of nQueens Completion (Extended Abstract).
Proceedings of the TwentySeventh International Joint Conference on Artificial Intelligence, 2018
A Framework for Constraint Based Local Search using Essence.
Proceedings of the TwentySeventh International Joint Conference on Artificial Intelligence, 2018
Automatic Discovery and Exploitation of Promising Subproblems for Tabulation.
Proceedings of the Principles and Practice of Constraint Programming, 2018
Metamorphic Testing of Constraint Solvers.
Proceedings of the Principles and Practice of Constraint Programming, 2018
2017
Complexity of nQueens Completion.
J. Artif. Intell. Res., 2017
Generalized support and formal development of constraint propagators.
AI Commun., 2017
Automatically improving constraint models in Savile Row.
Artif. Intell., 2017
2016
Exploiting Short Supports for Improved Encoding of Arbitrary Constraints into SAT.
Proceedings of the Principles and Practice of Constraint Programming, 2016
2015
Top Tips to Make Your Research Irreproducible.
CoRR, 2015
2014
An Open and Reproducible Paper on Openness and Reproducibility of Papers in Computational Science.
CoRR, 2014
Qualitative modelling via constraint programming.
Constraints, 2014
Generating custom propagators for arbitrary constraints.
Artif. Intell., 2014
Recomputation.org: Experiences of Its First Year and Lessons Learned.
Proceedings of the 7th IEEE/ACM International Conference on Utility and Cloud Computing, 2014
Breaking Conditional Symmetry in Automated Constraint Modelling with CONJURE.
Proceedings of the ECAI 2014  21st European Conference on Artificial Intelligence, 1822 August 2014, Prague, Czech Republic, 2014
Automatically Improving Constraint Models in Savile Row through AssociativeCommutative Common Subexpression Elimination.
Proceedings of the Principles and Practice of Constraint Programming, 2014
Discriminating Instance Generation for Automated Constraint Model Selection.
Proceedings of the Principles and Practice of Constraint Programming, 2014
2013
Short and Long Supports for Constraint Propagation.
J. Artif. Intell. Res., 2013
Optimal Implementation of Watched Literals and More General Techniques.
J. Artif. Intell. Res., 2013
The Recomputation Manifesto
CoRR, 2013
Automated Symmetry Breaking and Model Selection in Conjure.
Proceedings of the Principles and Practice of Constraint Programming, 2013
2012
Qualitative Modelling via Constraint Programming: Past, Present and Future
CoRR, 2012
An evaluation of machine learning in algorithm selection for search problems.
AI Commun., 2012
An empirical study of learning and forgetting constraints.
AI Commun., 2012
2011
Modelling Constraint Solver Architecture Design as a Constraint Problem
CoRR, 2011
A Preliminary Evaluation of Machine Learning in Algorithm Selection for Search Problems.
Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011
Exploiting Short Supports for Generalised Arc Consistency for Arbitrary Constraints.
Proceedings of the IJCAI 2011, 2011
Propagation in Constraints: How One Thing Leads to Another.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011
Reliability of Computational Experiments on Virtualised Hardware.
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
CoRR, 2010
Using machine learning to make constraint solver implementation decisions
CoRR, 2010
Lazy Explanations for Constraint Propagators.
Proceedings of the Practical Aspects of Declarative Languages, 2010
Learning When to Use Lazy Learning in Constraint Solving.
Proceedings of the ECAI 2010, 2010
Generating SpecialPurpose Stateless Propagators for Arbitrary Constraints.
Proceedings of the Principles and Practice of Constraint Programming  CP 2010, 2010
2009
Automatically Enhancing Constraint Model Instances during Tailoring.
Proceedings of the Eighth Symposium on Abstraction, Reformulation, and Approximation, 2009
Common Subexpressions in Constraint Models of Planning Problems.
Proceedings of the Eighth Symposium on Abstraction, Reformulation, and Approximation, 2009
Modelling Equidistant Frequency Permutation Arrays in Constraints.
Proceedings of the Eighth Symposium on Abstraction, Reformulation, and Approximation, 2009
2008
Solving quantified constraint satisfaction problems.
Artif. Intell., 2008
Generalised arc consistency for the AllDifferent constraint: An empirical survey.
Artif. Intell., 2008
2007
Search in the patience game 'Black Hole'.
AI Commun., 2007
Tailoring SolverIndependent Constraint Models: A Case Study with Essence' and Minion.
Proceedings of the Abstraction, 2007
Groupoids and Conditional Symmetry.
Proceedings of the Principles and Practice of Constraint Programming, 2007
Data Structures for Generalised Arc Consistency for Extensional Constraints.
Proceedings of the TwentySecond AAAI Conference on Artificial Intelligence, 2007
2006
Symmetry in Constraint Programming.
Proceedings of the Handbook of Constraint Programming, 2006
Minion: A Fast Scalable Constraint Solver.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006
Watched Literals for Constraint Propagation in Minion.
Proceedings of the Principles and Practice of Constraint Programming, 2006
2005
Local and Global Complete Solution Learning Methods for QBF.
Proceedings of the Theory and Applications of Satisfiability Testing, 2005
QCSPSolve: A Solver for Quantified Constraint Satisfaction Problems.
Proceedings of the IJCAI05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005
Symmetry and Consistency.
Proceedings of the Principles and Practice of Constraint Programming, 2005
Conditional Symmetry Breaking.
Proceedings of the Principles and Practice of Constraint Programming, 2005
2004
Tractable Symmetry Breaking Using Restricted Search Trees.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004
Encoding Quantified CSPs as Quantified Boolean Formulae.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004
Models and Symmetry Breaking for 'Peaceable Armies of Queens'.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2004
2003
Watched Data Structures for QBF Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing, 2003
Supertree Construction with Constraint Programming.
Proceedings of the Principles and Practice of Constraint Programming, 2003
Using Stochastic Local Search to Solve Quantified Boolean Formulae.
Proceedings of the Principles and Practice of Constraint Programming, 2003
Generic SBDD Using Computational Group Theory.
Proceedings of the Principles and Practice of Constraint Programming, 2003
2002
An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists.
Proceedings of the 15th Eureopean Conference on Artificial Intelligence, 2002
Arc Consistency in SAT.
Proceedings of the 15th Eureopean Conference on Artificial Intelligence, 2002
Groups and Constraints: Symmetry Breaking during Search.
Proceedings of the Principles and Practice of Constraint Programming, 2002
2001
Frozen development in graph coloring.
Theor. Comput. Sci., 2001
Random Constraint Satisfaction: Flaws and Structure.
Constraints, 2001
A Constraint Programming Approach to the Stable Marriage Problem.
Proceedings of the Principles and Practice of Constraint Programming, 2001
2000
Search algorithms in type theory.
Theor. Comput. Sci., 2000
Satisfiability in the Year 2000.
J. Autom. Reasoning, 2000
Backbone Fragility and the Local Search Cost Peak.
J. Artif. Intell. Res., 2000
Decomposable constraints.
Artif. Intell., 2000
Parallel heuristic search in Haskell.
Proceedings of the Selected papers from the 2nd Scottish Functional Programming Workshop (SFP00), 2000
Local Search on Random 2+pSAT.
Proceedings of the ECAI 2000, 2000
Symmetry Breaking in Constraint Programming.
Proceedings of the ECAI 2000, 2000
1999
A Response to "On method overfitting".
J. Heuristics, 1999
Paul R. Cohen's Empirical Methods for Artificial Intelligence.
Artif. Intell., 1999
CSP_{LIB}: A Benchmark Library for Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 1999
Beyond NP: the QSAT phase transition.
Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999
Morphing: Combining Structure and Randomness.
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.
Inf. Process. Lett., 1998
Heuristic Solution of Open Bin Packing Problems.
J. Heuristics, 1998
Analysis of Heuristics for Number Partitioning.
Computational Intelligence, 1998
1997
From Approximate to Optimal Solutions: Constructing Pruning and Propagation Rules.
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997
The Logic of Search Algorithms: Theory and Applications.
Proceedings of the Principles and Practice of Constraint Programming  CP97, Third International Conference, Linz, Austria, October 29, 1997
The Constrainedness of Arc Consistency.
Proceedings of the Principles and Practice of Constraint Programming  CP97, Third International Conference, Linz, Austria, October 29, 1997
The Scaling of Search Cost.
Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997
1996
The Satisfiability Constraint Gap.
Artif. Intell., 1996
The TSP Phase Transition.
Artif. Intell., 1996
Phase Transitions and Annealed Theories: Number Partitioning as a Case Study.
Proceedings of the 12th European Conference on Artificial Intelligence, 1996
An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem.
Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996
Local Search and the Number of Solutions.
Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996
The Constrainedness of Search.
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.
Proceedings of the Principles and Practice of Constraint Programming, 1995
1994
Easy Problems are Sometimes Hard.
Artif. Intell., 1994
The Hardest Random SAT Problems.
Proceedings of the KI94: Advances in Artificial Intelligence, 1994
The SAT Phase Transition.
Proceedings of the Eleventh European Conference on Artificial Intelligence, 1994
1993
Analytic proof systems for classical and modal logics of restricted quantification.
PhD thesis, 1993
Theory matrices (for modal logics) Using alphabetical monotonicity.
Studia Logica, 1993
An Empirical Analysis of Search in GSAT.
J. Artif. Intell. Res., 1993
Towards an Understanding of HillClimbing Procedures for SAT.
Proceedings of the 11th National Conference on Artificial Intelligence. Washington, 1993
1992
A Sequent or Tableaustyle System for Lewis's Counterfactual Logic VC.
Notre Dame Journal of Formal Logic, 1992