The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alasdair Urquhart: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  35. Regular and General Resolution: An Improved Separation. [Citation Graph (, )][DBLP]


  36. The number of lines in Frege proofs with substitution. [Citation Graph (, )][DBLP]


  37. The Resolution Width Problem is EXPTIME-Complete. [Citation Graph (, )][DBLP]


Search in 0.064secs, Finished in 0.065secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002