Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Alasdair Urquhart
2010 – today
- 2012
[j35]Alasdair Urquhart: Width and size of regular resolution proofs. Logical Methods in Computer Science 8(2) (2012)- 2011
- [j34]
- [j33]Alasdair Urquhart: A Near-Optimal Separation of Regular and General Resolution. SIAM J. Comput. 40(1): 107-121 (2011)
- 2010
- [j32]Alasdair Urquhart: Von Neumann, Gödel and complexity theory. Bulletin of Symbolic Logic 16(4): 516-530 (2010)
- [j31]Alasdair Urquhart: Anderson and Belnap's Invitation to Sin. J. Philosophical Logic 39(4): 453-472 (2010)
2000 – 2009
- 2009
- [j30]Alasdair Urquhart: Enumerating types of Boolean functions. Bulletin of Symbolic Logic 15(3): 273-299 (2009)
- [j29]Alexander Hertel, Alasdair Urquhart: Algorithms and Complexity Results for Input and Unit Resolution. JSAT 6(1-3): 141-164 (2009)
- [i3]Alexander Hertel, Alasdair Urquhart: Comments on ECCC Report TR06-133: The Resolution Width Problem is EXPTIME-Complete. Electronic Colloquium on Computational Complexity (ECCC) 16: 3 (2009)
- 2008
- [j28]Francis Jeffry Pelletier, Alasdair Urquhart: Synonymous Logics: A Correction. J. Philosophical Logic 37(1): 95-100 (2008)
- [j27]Philip Kremer, Alasdair Urquhart: Supervaluation Fixed-Point Logics of Truth. J. Philosophical Logic 37(5): 407-440 (2008)
- [c13]
- 2007
- [j26]Alasdair Urquhart: Width versus size in resolution proofs. Theor. Comput. Sci. 384(1): 104-110 (2007)
- [j25]Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart: An Exponential Separation between Regular and General Resolution. Theory of Computing 3(1): 81-102 (2007)
- [c12]Alexander Hertel, Alasdair Urquhart: Game Characterizations and the PSPACE-Completeness of Tree Resolution Space. CSL 2007: 527-541
- [c11]Alexander Hertel, Philipp Hertel, Alasdair Urquhart: Formalizing Dangerous SAT Encodings. SAT 2007: 159-172
- 2006
- [j24]Noriko H. Arai, Toniann Pitassi, Alasdair Urquhart: The complexity of analytic tableaux. J. Symb. Log. 71(3): 777-790 (2006)
- [c10]Ivo Düntsch, Alasdair Urquhart: Betweenness and Comparability Obtained from Binary Relations. RelMiCS 2006: 148-161
- [c9]
- [i2]Alexander Hertel, Alasdair Urquhart: The Resolution Width Problem is EXPTIME-Complete. Electronic Colloquium on Computational Complexity (ECCC) 13(133) (2006)
- 2005
- [j23]Alasdair Urquhart: The Complexity of Propositional Proofs with the Substitution Rule. Logic Journal of the IGPL 13(3): 287-291 (2005)
- [c8]
- 2004
- [j22]Michael Soltys, Alasdair Urquhart: Matrix identities and the pigeonhole principle. Arch. Math. Log. 43(3): 351-358 (2004)
- 2003
- [j21]Alasdair Urquhart: Resolution Proofs of Matching Principles. Ann. Math. Artif. Intell. 37(3): 241-250 (2003)
- [j20]Francis Jeffry Pelletier, Alasdair Urquhart: Synonymous Logics. J. Philosophical Logic 32(3): 259-285 (2003)
- 2002
- [c7]Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart: An exponential separation between regular and general resolution. STOC 2002: 448-456
- 2001
- [p1]Alasdair Urquhart: The Complexity of Propositional Proofs. Current Trends in Theoretical Computer Science 2001: 332-342
- [c6]Noriko H. Arai, Toniann Pitassi, Alasdair Urquhart: The complexity of analytic tableaux. STOC 2001: 356-363
- [i1]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
- [c5]
1990 – 1999
- 1999
- [j19]Alasdair Urquhart: The Symmetry Rule in Propositional Logic. Discrete Applied Mathematics 96-97: 177-193 (1999)
- [j18]Alasdair Urquhart: The Complexity of Decision Procedures In Relevance Logic II. J. Symb. Log. 64(4): 1774-1802 (1999)
- 1998
- [j17]
- 1997
- [j16]Alasdair Urquhart: The number of lines in Frege proofs with substitution. Arch. Math. Log. 37(1): 15-19 (1997)
- [j15]
- [j14]Alasdair Urquhart: The graph constructions of Hajós and Ore. Journal of Graph Theory 26(4): 211-215 (1997)
- 1996
- [j13]Alasdair Urquhart, Xudong Fu: Simplified Lower Bounds for Propositional Proofs. Notre Dame Journal of Formal Logic 37(4): 523-544 (1996)
- [j12]
- 1995
- [j11]Alasdair Urquhart: The complexity of propositional proofs. Bulletin of Symbolic Logic 1(4): 425-467 (1995)
- [j10]Toniann Pitassi, Alasdair Urquhart: The Complexity of the Hajos Calculus. SIAM J. Discrete Math. 8(3): 464-483 (1995)
- 1994
- [c4]Russell Impagliazzo, Toniann Pitassi, Alasdair Urquhart: Upper and Lower Bounds for Tree-Like Cutting Planes Proofs. LICS 1994: 220-228
- 1993
- [j9]Stephen A. Cook, Alasdair Urquhart: Functional Interpretations of Feasibly Constructive Arithmetic. Ann. Pure Appl. Logic 63(2): 103-200 (1993)
- 1992
- [j8]Alasdair Urquhart: The Relative Complexity of Resolution and Cut-Free Gentzen Systems. Ann. Math. Artif. Intell. 6(1-3): 157-168 (1992)
- [j7]Stephen Bellantoni, Toniann Pitassi, Alasdair Urquhart: Approximation and Small-Depth Frege Proofs. SIAM J. Comput. 21(6): 1161-1179 (1992)
- [c3]
- 1991
- [c2]Stephen Bellantoni, Toniann Pitassi, Alasdair Urquhart: Approximation and Small Depth Frege Proofs. Structure in Complexity Theory Conference 1991: 367-390
1980 – 1989
- 1989
- [j6]Alasdair Urquhart: The Complexity of Gentzen Systems for Propositional Logic. Theor. Comput. Sci. 66(1): 87-97 (1989)
- [c1]Stephen A. Cook, Alasdair Urquhart: Functional Interpretations of Feasibly Constructive Arithmetic (Extended Abstract). STOC 1989: 107-112
- 1987
- [j5]
- [j4]Steve Giambrone, Robert K. Meyer, Alasdair Urquhart: A Contractionless Semilattice Semantics. J. Symb. Log. 52(2): 526-529 (1987)
- 1984
- [j3]Alasdair Urquhart: The Undecidability of Entailment and Relevant Implication. J. Symb. Log. 49(4): 1059-1073 (1984)
1970 – 1979
- 1974
- [j2]Alasdair Urquhart: Implicational Formulas in Intuitionistic Logic. J. Symb. Log. 39(4): 661-664 (1974)
- 1972
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-01 22:58 CEST by the dblp team