2008 | ||
---|---|---|
60 | EE | Ian P. Gent, Ian Miguel, Peter Nightingale: Generalised arc consistency for the AllDifferent constraint: An empirical survey. Artif. Intell. 172(18): 1973-2000 (2008) |
59 | EE | Ian P. Gent, Peter Nightingale, Andrew G. D. Rowley, Kostas Stergiou: Solving quantified constraint satisfaction problems. Artif. Intell. 172(6-7): 738-771 (2008) |
2007 | ||
58 | Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale: Data Structures for Generalised Arc Consistency for Extensional Constraints. AAAI 2007: 191-197 | |
57 | EE | Ian P. Gent, Tom Kelsey, S. A. Linton, J. Pearson, Colva M. Roney-Dougal: Groupoids and Conditional Symmetry. CP 2007: 823-830 |
56 | EE | Ian P. Gent, Ian Miguel, Andrea Rendl: Tailoring Solver-Independent Constraint Models: A Case Study with Essence' and Minion. SARA 2007: 184-199 |
55 | EE | 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) |
2006 | ||
54 | EE | Ian P. Gent, Christopher Jefferson, Ian Miguel: Watched Literals for Constraint Propagation in Minion. CP 2006: 182-197 |
53 | Ian P. Gent, Christopher Jefferson, Ian Miguel: Minion: A Fast Scalable Constraint Solver. ECAI 2006: 98-102 | |
2005 | ||
52 | EE | Ian P. Gent, Tom Kelsey, Steve Linton, Iain McDonald, Ian Miguel, Barbara M. Smith: Conditional Symmetry Breaking. CP 2005: 256-270 |
51 | EE | Ian P. Gent, Tom Kelsey, Steve Linton, Colva M. Roney-Dougal: Symmetry and Consistency. CP 2005: 271-285 |
50 | EE | Ian P. Gent, Peter Nightingale, Kostas Stergiou: QCSP-Solve: A Solver for Quantified Constraint Satisfaction Problems. IJCAI 2005: 138-143 |
49 | EE | Ian P. Gent, Andrew G. D. Rowley: Local and Global Complete Solution Learning Methods for QBF. SAT 2005: 91-106 |
2004 | ||
48 | EE | Barbara M. Smith, Karen E. Petrie, Ian P. Gent: Models and Symmetry Breaking for 'Peaceable Armies of Queens'. CPAIOR 2004: 271-286 |
47 | Ian P. Gent, Peter Nightingale, Andrew G. D. Rowley: Encoding Quantified CSPs as Quantified Boolean Formulae. ECAI 2004: 176-180 | |
46 | Colva M. Roney-Dougal, Ian P. Gent, Tom Kelsey, Steve Linton: Tractable Symmetry Breaking Using Restricted Search Trees. ECAI 2004: 211-215 | |
2003 | ||
45 | EE | Ian P. Gent, Warwick Harvey, Tom Kelsey, Steve Linton: Generic SBDD Using Computational Group Theory. CP 2003: 333-347 |
44 | EE | 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 |
43 | EE | Ian P. Gent, Patrick Prosser, Barbara M. Smith, Wu Wei: Supertree Construction with Constraint Programming. CP 2003: 837-841 |
42 | EE | Ian P. Gent, Enrico Giunchiglia, Massimo Narizzano, Andrew G. D. Rowley, Armando Tacchella: Watched Data Structures for QBF Solvers. SAT 2003: 25-36 |
2002 | ||
41 | EE | Ian P. Gent, Warwick Harvey, Tom Kelsey: Groups and Constraints: Symmetry Breaking during Search. CP 2002: 415-430 |
40 | Ian P. Gent: Arc Consistency in SAT. ECAI 2002: 121-125 | |
39 | Ian P. Gent, Patrick Prosser: An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists. ECAI 2002: 141-145 | |
38 | Ian P. Gent, Toby Walsh: Satisfiability in the Year 2000. J. Autom. Reasoning 28(2): 99 (2002) | |
2001 | ||
37 | EE | Ian P. Gent, Robert W. Irving, David Manlove, Patrick Prosser, Barbara M. Smith: A Constraint Programming Approach to the Stable Marriage Problem. CP 2001: 225-239 |
36 | Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh: Random Constraint Satisfaction: Flaws and Structure. Constraints 6(4): 345-372 (2001) | |
35 | EE | Joseph C. Culberson, Ian P. Gent: Frozen development in graph coloring. Theor. Comput. Sci. 265(1-2): 227-264 (2001) |
2000 | ||
34 | Josh Singer, Ian P. Gent, Alan Smaill: Local Search on Random 2+p-SAT. ECAI 2000: 113-117 | |
33 | Ian P. Gent, Barbara M. Smith: Symmetry Breaking in Constraint Programming. ECAI 2000: 599-603 | |
32 | Michelle Cope, Ian P. Gent, Kevin Hammond: Parallel heuristic search in Haskell. Scottish Functional Programming Workshop 2000: 65-76 | |
31 | EE | Ian P. Gent, Kostas Stergiou, Toby Walsh: Decomposable constraints. Artif. Intell. 123(1-2): 133-156 (2000) |
30 | EE | Josh Singer, Ian P. Gent, Alan Smaill: Backbone Fragility and the Local Search Cost Peak. J. Artif. Intell. Res. (JAIR) 12: 235-270 (2000) |
29 | Ian P. Gent, Toby Walsh: Satisfiability in the Year 2000. J. Autom. Reasoning 24(1/2): 1-3 (2000) | |
28 | EE | James L. Caldwell, Ian P. Gent, Judith L. Underwood: Search algorithms in type theory. Theor. Comput. Sci. 232(1-2): 55-90 (2000) |
1999 | ||
27 | Ian P. Gent, Toby Walsh: Beyond NP: the QSAT phase transition. AAAI/IAAI 1999: 648-653 | |
26 | Ian P. Gent, Holger H. Hoos, Patrick Prosser, Toby Walsh: Morphing: Combining Structure and Randomness. AAAI/IAAI 1999: 654-660 | |
25 | Ian P. Gent, Toby Walsh: CSPLIB: A Benchmark Library for Constraints. CP 1999: 480-481 | |
24 | EE | Ian P. Gent, Kostas Stergiou, Toby Walsh: Decomposable Constraints. New Trends in Constraints 1999: 134-149 |
23 | EE | Ian P. Gent, Toby Walsh: Paul R. Cohen's Empirical Methods for Artificial Intelligence. Artif. Intell. 113(1-2): 285-290 (1999) |
22 | Ian P. Gent: A Response to "On method overfitting". J. Heuristics 5(1): 109-111 (1999) | |
1998 | ||
21 | EE | 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) |
20 | Ian P. Gent: Heuristic Solution of Open Bin Packing Problems. J. Heuristics 3(4): 299-304 (1998) | |
1997 | ||
19 | Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh: The Scaling of Search Cost. AAAI/IAAI 1997: 315-320 | |
18 | Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh: The Constrainedness of Arc Consistency. CP 1997: 327-340 | |
17 | Ian P. Gent, Judith L. Underwood: The Logic of Search Algorithms: Theory and Applications. CP 1997: 77-91 | |
16 | Ian P. Gent, Toby Walsh: From Approximate to Optimal Solutions: Constructing Pruning and Propagation Rules. IJCAI 1997: 1396-1401 | |
1996 | ||
15 | Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh: The Constrainedness of Search. AAAI/IAAI, Vol. 1 1996: 246-252 | |
14 | 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 | |
13 | 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 | |
12 | Ian P. Gent, Toby Walsh: Phase Transitions and Annealed Theories: Number Partitioning as a Case Study. ECAI 1996: 170-174 | |
11 | EE | Ian P. Gent, Toby Walsh: The Satisfiability Constraint Gap. Artif. Intell. 81(1-2): 59-80 (1996) |
10 | EE | Ian P. Gent, Toby Walsh: The TSP Phase Transition. Artif. Intell. 88(1-2): 349-358 (1996) |
1995 | ||
9 | Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh: Scaling Effects in the CSP Phase Transition. CP 1995: 70-87 | |
1994 | ||
8 | Ian P. Gent, Toby Walsh: The SAT Phase Transition. ECAI 1994: 105-109 | |
7 | Ian P. Gent, Toby Walsh: The Hardest Random SAT Problems. KI 1994: 355-366 | |
6 | Ian P. Gent, Toby Walsh: Easy Problems are Sometimes Hard. Artif. Intell. 70(1-2): 335-345 (1994) | |
1993 | ||
5 | Ian P. Gent, Toby Walsh: Towards an Understanding of Hill-Climbing Procedures for SAT. AAAI 1993: 28-33 | |
4 | EE | Ian P. Gent, Toby Walsh: An Empirical Analysis of Search in GSAT CoRR cs.AI/9309101: (1993) |
3 | Ian P. Gent, Toby Walsh: An Empirical Analysis of Search in GSAT. J. Artif. Intell. Res. (JAIR) 1: 47-59 (1993) | |
2 | Ian P. Gent: Theory matrices (for modal logics) Using alphabetical monotonicity. Studia Logica 52(2): 233-258 (1993) | |
1992 | ||
1 | Ian P. Gent: A Sequent- or Tableau-style System for Lewis's Counterfactual Logic VC. Notre Dame Journal of Formal Logic 33(3): 369-382 (1992) |