The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Peter B. Andrews: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Peter B. Andrews
    Theorem Proving via General Mappings. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1981, v:28, n:2, pp:193-214 [Journal]
  2. Peter B. Andrews
    Proving Theorems of Type Theory Automatically with TPS. [Citation Graph (0, 0)][DBLP]
    AAAI, 2005, pp:1676-1677 [Conf]
  3. Peter B. Andrews
    Some Reflections on Proof Transformations. [Citation Graph (0, 0)][DBLP]
    Mechanizing Mathematical Reasoning, 2005, pp:14-29 [Conf]
  4. Matthew Bishop, Peter B. Andrews
    Selectively Instantiating Definitions. [Citation Graph (0, 0)][DBLP]
    CADE, 1998, pp:365-380 [Conf]
  5. Peter B. Andrews
    Transforming Matings into Natural Deduction Proofs. [Citation Graph (0, 0)][DBLP]
    CADE, 1980, pp:281-292 [Conf]
  6. Peter B. Andrews
    Connections and Higher-Order Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:1-4 [Conf]
  7. Peter B. Andrews, Chad E. Brown
    Tutorial: Using TPS for Higher-Order Theorem Proving and ETPS for Teaching Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 2000, pp:511-512 [Conf]
  8. Peter B. Andrews, Matthew Bishop, Chad E. Brown
    System Description: TPS: A Theorem Proving System for Type Theory. [Citation Graph (0, 0)][DBLP]
    CADE, 2000, pp:164-169 [Conf]
  9. Peter B. Andrews, Sunil Issar, Daniel Nesmith, Frank Pfenning
    The TPS Theorem Proving System. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:760-761 [Conf]
  10. Peter B. Andrews, Sunil Issar, Dan Nesmith, Frank Pfenning
    The TPS Theorem Proving System. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:641-642 [Conf]
  11. Peter B. Andrews, Frank Pfenning, Sunil Issar, C. P. Klapper
    The TPS Theorem Proving System. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:663-664 [Conf]
  12. Dale Miller, Eve Longini Cohen, Peter B. Andrews
    A Look at TPS. [Citation Graph (0, 0)][DBLP]
    CADE, 1982, pp:50-69 [Conf]
  13. Peter B. Andrews, Eve Longini Cohen
    Theorem Proving in Type Theory. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1977, pp:566-566 [Conf]
  14. Peter B. Andrews, Matthew Bishop
    On Sets, Types, Fixed Points, and Checkerboards. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1996, pp:1-15 [Conf]
  15. Peter B. Andrews, Matthew Bishop, Sunil Issar, Dan Nesmith, Frank Pfenning, Hongwei Xi
    TPS: An Interactive and Automatic Tool for Proving Theorems of Type Theory. [Citation Graph (0, 0)][DBLP]
    HUG, 1993, pp:366-370 [Conf]
  16. Peter B. Andrews
    Resolution With Merging. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1968, v:15, n:3, pp:367-381 [Journal]
  17. Peter B. Andrews
    A Correction Concerning Resolution. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1968, v:15, n:4, pp:720- [Journal]
  18. Peter B. Andrews, Chad E. Brown
    TPS: A hybrid automatic-interactive system for developing proofs. [Citation Graph (0, 0)][DBLP]
    J. Applied Logic, 2006, v:4, n:4, pp:367-395 [Journal]
  19. Peter B. Andrews
    Herbrand Award Acceptance Speech. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2003, v:31, n:2, pp:169-187 [Journal]
  20. Peter B. Andrews
    On Connections and Higher-Order Logic. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1989, v:5, n:3, pp:257-291 [Journal]
  21. Peter B. Andrews
    More on the Problem of Finding a Mapping between Clause Representation and Natural Deduction Representation. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1991, v:7, n:2, pp:285-286 [Journal]
  22. Peter B. Andrews, Matthew Bishop, Sunil Issar, Dan Nesmith, Frank Pfenning, Hongwei Xi
    TPS: A Theorem-Proving System for Classical Type Theory. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1996, v:16, n:3, pp:321-353 [Journal]
  23. Peter B. Andrews, Chad E. Brown, Frank Pfenning, Matthew Bishop, Sunil Issar, Hongwei Xi
    ETPS: A System to Help Students Write Formal Proofs. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2004, v:32, n:1, pp:75-92 [Journal]
  24. Peter B. Andrews
    On Simplifying the Matrix of a WFF. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1968, v:33, n:2, pp:180-192 [Journal]
  25. Peter B. Andrews
    Resolution in Type Theory. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1971, v:36, n:3, pp:414-432 [Journal]
  26. Peter B. Andrews
    General Models, Descriptions, and Choice in Type Theory. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1972, v:37, n:2, pp:385-394 [Journal]
  27. Peter B. Andrews
    General Models and Extensionality. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1972, v:37, n:2, pp:395-397 [Journal]
  28. Peter B. Andrews
    Refutations by Matings. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1976, v:25, n:8, pp:801-807 [Journal]

Search in 0.003secs, Finished in 0.004secs
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