| 2008 |
|---|
| 39 | EE | Alasdair Urquhart:
Regular and General Resolution: An Improved Separation.
SAT 2008: 277-290 |
| 2007 |
|---|
| 38 | EE | Alexander Hertel,
Alasdair Urquhart:
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space.
CSL 2007: 527-541 |
| 37 | EE | Alexander Hertel,
Philipp Hertel,
Alasdair Urquhart:
Formalizing Dangerous SAT Encodings.
SAT 2007: 159-172 |
| 36 | EE | Alasdair Urquhart:
Width versus size in resolution proofs.
Theor. Comput. Sci. 384(1): 104-110 (2007) |
| 35 | EE | Michael Alekhnovich,
Jan Johannsen,
Toniann Pitassi,
Alasdair Urquhart:
An Exponential Separation between Regular and General Resolution.
Theory of Computing 3(1): 81-102 (2007) |
| 2006 |
|---|
| 34 | EE | Ivo Düntsch,
Alasdair Urquhart:
Betweenness and Comparability Obtained from Binary Relations.
RelMiCS 2006: 148-161 |
| 33 | EE | Alasdair Urquhart:
Width Versus Size in Resolution Proofs.
TAMC 2006: 79-88 |
| 32 | EE | Alexander Hertel,
Alasdair Urquhart:
The Resolution Width Problem is EXPTIME-Complete.
Electronic Colloquium on Computational Complexity (ECCC) 13(133): (2006) |
| 2005 |
|---|
| 31 | EE | Alasdair Urquhart:
Duality Theory for Projective Algebras.
RelMiCS 2005: 33-47 |
| 30 | EE | Alasdair Urquhart:
The Complexity of Propositional Proofs with the Substitution Rule.
Logic Journal of the IGPL 13(3): 287-291 (2005) |
| 2004 |
|---|
| 29 | EE | Michael Soltys,
Alasdair Urquhart:
Matrix identities and the pigeonhole principle.
Arch. Math. Log. 43(3): 351-358 (2004) |
| 2003 |
|---|
| 28 | | Alasdair Urquhart:
Resolution Proofs of Matching Principles.
Ann. Math. Artif. Intell. 37(3): 241-250 (2003) |
| 2002 |
|---|
| 27 | EE | Michael Alekhnovich,
Jan Johannsen,
Toniann Pitassi,
Alasdair Urquhart:
An exponential separation between regular and general resolution.
STOC 2002: 448-456 |
| 2001 |
|---|
| 26 | EE | Noriko H. Arai,
Toniann Pitassi,
Alasdair Urquhart:
The complexity of analytic tableaux.
STOC 2001: 356-363 |
| 25 | | Alasdair Urquhart:
The Complexity of Propositional Proofs.
Current Trends in Theoretical Computer Science 2001: 332-342 |
| 24 | EE | Michael Alekhnovich,
Jan Johannsen,
Toniann Pitassi,
Alasdair Urquhart:
An Exponential Separation between Regular and General Resolution
Electronic Colloquium on Computational Complexity (ECCC) 8(056): (2001) |
| 2000 |
|---|
| 23 | | Noriko H. Arai,
Alasdair Urquhart:
Local Symmetries in Propositional Logic.
TABLEAUX 2000: 40-51 |
| 1999 |
|---|
| 22 | EE | Alasdair Urquhart:
The Symmetry Rule in Propositional Logic.
Discrete Applied Mathematics 96-97: 177-193 (1999) |
| 21 | | Alasdair Urquhart:
The Complexity of Decision Procedures In Relevance Logic II.
J. Symb. Log. 64(4): 1774-1802 (1999) |
| 1998 |
|---|
| 20 | | Alasdair Urquhart:
The Complexity of Propositional Proofs.
Bulletin of the EATCS 64: (1998) |
| 1997 |
|---|
| 19 | EE | Alasdair Urquhart:
The number of lines in Frege proofs with substitution.
Arch. Math. Log. 37(1): 15-19 (1997) |
| 18 | EE | Alasdair Urquhart:
Review of Feasible Mathematics II.
Logic Journal of the IGPL 5(2): (1997) |
| 1996 |
|---|
| 17 | | Alasdair Urquhart,
Xudong Fu:
Simplified Lower Bounds for Propositional Proofs.
Notre Dame Journal of Formal Logic 37(4): 523-544 (1996) |
| 16 | | Alasdair Urquhart:
Duality for algebras of relevant logics.
Studia Logica 56(1/2): 263-276 (1996) |
| 1995 |
|---|
| 15 | EE | Alasdair Urquhart:
The complexity of propositional proofs.
Bulletin of Symbolic Logic 1(4): 425-467 (1995) |
| 14 | EE | Toniann Pitassi,
Alasdair Urquhart:
The Complexity of the Hajos Calculus.
SIAM J. Discrete Math. 8(3): 464-483 (1995) |
| 1994 |
|---|
| 13 | | Russell Impagliazzo,
Toniann Pitassi,
Alasdair Urquhart:
Upper and Lower Bounds for Tree-Like Cutting Planes Proofs
LICS 1994: 220-228 |
| 1993 |
|---|
| 12 | | Stephen A. Cook,
Alasdair Urquhart:
Functional Interpretations of Feasibly Constructive Arithmetic.
Ann. Pure Appl. Logic 63(2): 103-200 (1993) |
| 1992 |
|---|
| 11 | | Toniann Pitassi,
Alasdair Urquhart:
The Complexity of the Hajós Calculus
FOCS 1992: 187-196 |
| 10 | | Alasdair Urquhart:
The Relative Complexity of Resolution and Cut-Free Gentzen Systems.
Ann. Math. Artif. Intell. 6(1-3): 157-168 (1992) |
| 9 | | Stephen Bellantoni,
Toniann Pitassi,
Alasdair Urquhart:
Approximation and Small-Depth Frege Proofs.
SIAM J. Comput. 21(6): 1161-1179 (1992) |
| 1991 |
|---|
| 8 | | Stephen Bellantoni,
Toniann Pitassi,
Alasdair Urquhart:
Approximation and Small Depth Frege Proofs.
Structure in Complexity Theory Conference 1991: 367-390 |
| 1989 |
|---|
| 7 | | Stephen A. Cook,
Alasdair Urquhart:
Functional Interpretations of Feasibly Constructive Arithmetic (Extended Abstract)
STOC 1989: 107-112 |
| 6 | | Alasdair Urquhart:
The Complexity of Gentzen Systems for Propositional Logic.
Theor. Comput. Sci. 66(1): 87-97 (1989) |
| 1987 |
|---|
| 5 | EE | Alasdair Urquhart:
Hard examples for resolution.
J. ACM 34(1): 209-219 (1987) |
| 4 | | Steve Giambrone,
Robert K. Meyer,
Alasdair Urquhart:
A Contractionless Semilattice Semantics.
J. Symb. Log. 52(2): 526-529 (1987) |
| 1984 |
|---|
| 3 | | Alasdair Urquhart:
The Undecidability of Entailment and Relevant Implication.
J. Symb. Log. 49(4): 1059-1073 (1984) |
| 1974 |
|---|
| 2 | | Alasdair Urquhart:
Implicational Formulas in Intuitionistic Logic.
J. Symb. Log. 39(4): 661-664 (1974) |
| 1972 |
|---|
| 1 | | Alasdair Urquhart:
Semantics for Relevant Logics.
J. Symb. Log. 37(1): 159-169 (1972) |
