The SCEAS System
| |||||||

## Search the dblp DataBase
Ian P. Gent:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Ian P. Gent, Holger H. Hoos, Patrick Prosser, Toby Walsh
**Morphing: Combining Structure and Randomness.**[Citation Graph (0, 0)][DBLP] AAAI/IAAI, 1999, pp:654-660 [Conf] - Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh
**The Constrainedness of Search.**[Citation Graph (0, 0)][DBLP] AAAI/IAAI, Vol. 1, 1996, pp:246-252 [Conf] - Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh
**The Scaling of Search Cost.**[Citation Graph (0, 0)][DBLP] AAAI/IAAI, 1997, pp:315-320 [Conf] - Ian P. Gent, Toby Walsh
**Towards an Understanding of Hill-Climbing Procedures for SAT.**[Citation Graph (0, 0)][DBLP] AAAI, 1993, pp:28-33 [Conf] - Ian P. Gent, Toby Walsh
**Beyond NP: the QSAT phase transition.**[Citation Graph (0, 0)][DBLP] AAAI/IAAI, 1999, pp:648-653 [Conf] - Ian P. Gent, Kostas Stergiou, Toby Walsh
**Decomposable Constraints.**[Citation Graph (0, 0)][DBLP] New Trends in Constraints, 1999, pp:134-149 [Conf] - David A. Clark, Jeremy Frank, Ian P. Gent, Ewan MacIntyre, Neven Tomov, Toby Walsh
**Local Search and the Number of Solutions.**[Citation Graph (0, 0)][DBLP] CP, 1996, pp:119-133 [Conf] - Ian P. Gent, Warwick Harvey, Tom Kelsey
**Groups and Constraints: Symmetry Breaking during Search.**[Citation Graph (0, 0)][DBLP] CP, 2002, pp:415-430 [Conf] - Ian P. Gent, Warwick Harvey, Tom Kelsey, Steve Linton
**Generic SBDD Using Computational Group Theory.**[Citation Graph (0, 0)][DBLP] CP, 2003, pp:333-347 [Conf] - Ian P. Gent, Holger H. Hoos, Andrew G. D. Rowley, Kevin Smyth
**Using Stochastic Local Search to Solve Quantified Boolean Formulae.**[Citation Graph (0, 0)][DBLP] CP, 2003, pp:348-362 [Conf] - Ian P. Gent, Robert W. Irving, David Manlove, Patrick Prosser, Barbara M. Smith
**A Constraint Programming Approach to the Stable Marriage Problem.**[Citation Graph (0, 0)][DBLP] CP, 2001, pp:225-239 [Conf] - Ian P. Gent, Christopher Jefferson, Ian Miguel
**Watched Literals for Constraint Propagation in Minion.**[Citation Graph (0, 0)][DBLP] CP, 2006, pp:182-197 [Conf] - Ian P. Gent, Tom Kelsey, Steve Linton, Iain McDonald, Ian Miguel, Barbara M. Smith
**Conditional Symmetry Breaking.**[Citation Graph (0, 0)][DBLP] CP, 2005, pp:256-270 [Conf] - Ian P. Gent, Tom Kelsey, Steve Linton, Colva M. Roney-Dougal
**Symmetry and Consistency.**[Citation Graph (0, 0)][DBLP] CP, 2005, pp:271-285 [Conf] - Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh
**Scaling Effects in the CSP Phase Transition.**[Citation Graph (0, 0)][DBLP] CP, 1995, pp:70-87 [Conf] - Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh
**The Constrainedness of Arc Consistency.**[Citation Graph (0, 0)][DBLP] CP, 1997, pp:327-340 [Conf] - Ian P. Gent, Patrick Prosser, Barbara M. Smith, Wu Wei
**Supertree Construction with Constraint Programming.**[Citation Graph (0, 0)][DBLP] CP, 2003, pp:837-841 [Conf] - Ian P. Gent, Judith L. Underwood
**The Logic of Search Algorithms: Theory and Applications.**[Citation Graph (0, 0)][DBLP] CP, 1997, pp:77-91 [Conf] - Ian P. Gent, Toby Walsh
**CSP**[Citation Graph (0, 0)][DBLP]_{LIB}: A Benchmark Library for Constraints. CP, 1999, pp:480-481 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] CP, 1996, pp:179-193 [Conf] - Barbara M. Smith, Karen E. Petrie, Ian P. Gent
**Models and Symmetry Breaking for 'Peaceable Armies of Queens'.**[Citation Graph (0, 0)][DBLP] CPAIOR, 2004, pp:271-286 [Conf] - Ian P. Gent
**Arc Consistency in SAT.**[Citation Graph (0, 0)][DBLP] ECAI, 2002, pp:121-125 [Conf] - Ian P. Gent, Christopher Jefferson, Ian Miguel
**Minion: A Fast Scalable Constraint Solver.**[Citation Graph (0, 0)][DBLP] ECAI, 2006, pp:98-102 [Conf] - Ian P. Gent, Peter Nightingale, Andrew Rowley
**Encoding Quantified CSPs as Quantified Boolean Formulae.**[Citation Graph (0, 0)][DBLP] ECAI, 2004, pp:176-180 [Conf] - Ian P. Gent, Patrick Prosser
**An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists.**[Citation Graph (0, 0)][DBLP] ECAI, 2002, pp:141-145 [Conf] - Ian P. Gent, Barbara M. Smith
**Symmetry Breaking in Constraint Programming.**[Citation Graph (0, 0)][DBLP] ECAI, 2000, pp:599-603 [Conf] - Ian P. Gent, Toby Walsh
**The SAT Phase Transition.**[Citation Graph (0, 0)][DBLP] ECAI, 1994, pp:105-109 [Conf] - Ian P. Gent, Toby Walsh
**Phase Transitions and Annealed Theories: Number Partitioning as a Case Study.**[Citation Graph (0, 0)][DBLP] ECAI, 1996, pp:170-174 [Conf] - Colva M. Roney-Dougal, Ian P. Gent, Tom Kelsey, Steve Linton
**Tractable Symmetry Breaking Using Restricted Search Trees.**[Citation Graph (0, 0)][DBLP] ECAI, 2004, pp:211-215 [Conf] - Josh Singer, Ian P. Gent, Alan Smaill
**Local Search on Random 2+p-SAT.**[Citation Graph (0, 0)][DBLP] ECAI, 2000, pp:113-117 [Conf] - Ian P. Gent, Peter Nightingale, Kostas Stergiou
**QCSP-Solve: A Solver for Quantified Constraint Satisfaction Problems.**[Citation Graph (0, 0)][DBLP] IJCAI, 2005, pp:138-143 [Conf] - Ian P. Gent, Toby Walsh
**From Approximate to Optimal Solutions: Constructing Pruning and Propagation Rules.**[Citation Graph (0, 0)][DBLP] IJCAI, 1997, pp:1396-1401 [Conf] - Ian P. Gent, Toby Walsh
**The Hardest Random SAT Problems.**[Citation Graph (0, 0)][DBLP] KI, 1994, pp:355-366 [Conf] - Ian P. Gent, Andrew G. D. Rowley
**Local and Global Complete Solution Learning Methods for QBF.**[Citation Graph (0, 0)][DBLP] SAT, 2005, pp:91-106 [Conf] - Ian P. Gent, Enrico Giunchiglia, Massimo Narizzano, Andrew G. D. Rowley, Armando Tacchella
**Watched Data Structures for QBF Solvers.**[Citation Graph (0, 0)][DBLP] SAT, 2003, pp:25-36 [Conf] - Michelle Cope, Ian P. Gent, Kevin Hammond
**Parallel heuristic search in Haskell.**[Citation Graph (0, 0)][DBLP] Scottish Functional Programming Workshop, 2000, pp:65-76 [Conf] - Ian P. Gent, Kostas Stergiou, Toby Walsh
**Decomposable constraints.**[Citation Graph (0, 0)][DBLP] Artif. Intell., 2000, v:123, n:1-2, pp:133-156 [Journal] - Ian P. Gent, Toby Walsh
**Easy Problems are Sometimes Hard.**[Citation Graph (0, 0)][DBLP] Artif. Intell., 1994, v:70, n:1-2, pp:335-345 [Journal] - Ian P. Gent, Toby Walsh
**The TSP Phase Transition.**[Citation Graph (0, 0)][DBLP] Artif. Intell., 1996, v:88, n:1-2, pp:349-358 [Journal] - Ian P. Gent, Toby Walsh
**The Satisfiability Constraint Gap.**[Citation Graph (0, 0)][DBLP] Artif. Intell., 1996, v:81, n:1-2, pp:59-80 [Journal] - Ian P. Gent, Toby Walsh
**Paul R. Cohen's Empirical Methods for Artificial Intelligence.**[Citation Graph (0, 0)][DBLP] Artif. Intell., 1999, v:113, n:1-2, pp:285-290 [Journal] - Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh
**Random Constraint Satisfaction: Flaws and Structure.**[Citation Graph (0, 0)][DBLP] Constraints, 2001, v:6, n:4, pp:345-372 [Journal] - Ian P. Gent, Toby Walsh
**An Empirical Analysis of Search in GSAT**[Citation Graph (0, 0)][DBLP] CoRR, 1993, v:0, n:, pp:- [Journal] - Ian P. Gent
**Heuristic Solution of Open Bin Packing Problems.**[Citation Graph (0, 0)][DBLP] J. Heuristics, 1998, v:3, n:4, pp:299-304 [Journal] - Ian P. Gent
**A Response to "On method overfitting".**[Citation Graph (0, 0)][DBLP] J. Heuristics, 1999, v:5, n:1, pp:109-111 [Journal] - Jeremy Frank, Ian P. Gent, Toby Walsh
**Asymptotic and Finite Size Parameters for Phase Transitions: Hamiltonian Circuit as a Case Study.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:65, n:5, pp:241-245 [Journal] - Ian P. Gent, Toby Walsh
**An Empirical Analysis of Search in GSAT.**[Citation Graph (0, 0)][DBLP] J. Artif. Intell. Res. (JAIR), 1993, v:1, n:, pp:47-59 [Journal] - Josh Singer, Ian P. Gent, Alan Smaill
**Backbone Fragility and the Local Search Cost Peak.**[Citation Graph (0, 0)][DBLP] J. Artif. Intell. Res. (JAIR), 2000, v:12, n:, pp:235-270 [Journal] - Ian P. Gent, Toby Walsh
**Satisfiability in the Year 2000.**[Citation Graph (0, 0)][DBLP] J. Autom. Reasoning, 2000, v:24, n:1/2, pp:1-3 [Journal] - Ian P. Gent, Toby Walsh
**Satisfiability in the Year 2000.**[Citation Graph (0, 0)][DBLP] J. Autom. Reasoning, 2002, v:28, n:2, pp:99- [Journal] - Ian P. Gent
**A Sequent- or Tableau-style System for Lewis's Counterfactual Logic VC.**[Citation Graph (0, 0)][DBLP] Notre Dame Journal of Formal Logic, 1992, v:33, n:3, pp:369-382 [Journal] - Ian P. Gent
**Theory matrices (for modal logics) Using alphabetical monotonicity.**[Citation Graph (0, 0)][DBLP] Studia Logica, 1993, v:52, n:2, pp:233-258 [Journal] - James L. Caldwell, Ian P. Gent, Judith L. Underwood
**Search algorithms in type theory.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:232, n:1-2, pp:55-90 [Journal] - Joseph C. Culberson, Ian P. Gent
**Frozen development in graph coloring.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:265, n:1-2, pp:227-264 [Journal] - Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale
**Data Structures for Generalised Arc Consistency for Extensional Constraints.**[Citation Graph (0, 0)][DBLP] AAAI, 2007, pp:191-197 [Conf] - Ian P. Gent, Tom Kelsey, S. A. Linton, J. Pearson, Colva M. Roney-Dougal
**Groupoids and Conditional Symmetry.**[Citation Graph (0, 0)][DBLP] CP, 2007, pp:823-830 [Conf] - Ian P. Gent, Ian Miguel, Andrea Rendl
**Tailoring Solver-Independent Constraint Models: A Case Study with Essence' and Minion.**[Citation Graph (0, 0)][DBLP] SARA, 2007, pp:184-199 [Conf] - 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'.**[Citation Graph (0, 0)][DBLP] AI Commun., 2007, v:20, n:3, pp:211-226 [Journal] **Learning When to Use Lazy Learning in Constraint Solving.**[Citation Graph (, )][DBLP]**Lazy Explanations for Constraint Propagators.**[Citation Graph (, )][DBLP]**Modelling Equidistant Frequency Permutation Arrays in Constraints.**[Citation Graph (, )][DBLP]**Common Subexpressions in Constraint Models of Planning Problems.**[Citation Graph (, )][DBLP]**Automatically Enhancing Constraint Model Instances during Tailoring.**[Citation Graph (, )][DBLP]**Solving quantified constraint satisfaction problems.**[Citation Graph (, )][DBLP]**Generalised arc consistency for the AllDifferent constraint: An empirical survey.**[Citation Graph (, )][DBLP]**Analysis of Heuristics for Number Partitioning.**[Citation Graph (, )][DBLP]**Using machine learning to make constraint solver implementation decisions**[Citation Graph (, )][DBLP]**Machine learning for constraint solver design -- A case study for the alldifferent constraint**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |