The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

John C. Shepherdson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. John W. Lloyd, John C. Shepherdson
    Partial Evaluation in Logic Programming. [Citation Graph (6, 0)][DBLP]
    J. Log. Program., 1991, v:11, n:3&4, pp:217-242 [Journal]
  2. John C. Shepherdson
    Negation as Failure II. [Citation Graph (6, 0)][DBLP]
    J. Log. Program., 1985, v:2, n:3, pp:185-202 [Journal]
  3. John C. Shepherdson
    Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption. [Citation Graph (5, 0)][DBLP]
    J. Log. Program., 1984, v:1, n:1, pp:51-79 [Journal]
  4. P. A. Gardner, John C. Shepherdson
    Unfold/Fold Transformations of Logic Programs. [Citation Graph (0, 0)][DBLP]
    Computational Logic - Essays in Honor of Alan Robinson, 1991, pp:565-583 [Conf]
  5. John C. Shepherdson
    W. S. Jevons: his Logical Machine and Work Induction and Boolean Algebra. [Citation Graph (0, 0)][DBLP]
    Machine Intelligence 15, 1995, pp:489-505 [Conf]
  6. Petr Hájek, John C. Shepherdson
    A note on the notion of truth in fuzzy logic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:109, n:1-2, pp:65-69 [Journal]
  7. John C. Shepherdson
    Mints Type Deductive Calculi for Logic Programming. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1992, v:56, n:1-3, pp:7-17 [Journal]
  8. John C. Shepherdson, Howard E. Sturgis
    Computability of Recursive Functions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1963, v:10, n:2, pp:217-255 [Journal]
  9. John C. Shepherdson
    SLDNF-Resolution with Equality. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1992, v:8, n:2, pp:297-306 [Journal]
  10. Kerima Benkerimi, John C. Shepherdson
    Partial Deduction of Updateable Definite Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1994, v:18, n:1, pp:1-26 [Journal]
  11. John C. Shepherdson
    Unsolvable Problems for SLDNF Resolution. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1991, v:10, n:1/2/3&4, pp:19-22 [Journal]
  12. John C. Shepherdson
    Correct Answers to Allowed Programs and Queries are Ground. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1991, v:11, n:3&4, pp:359-362 [Journal]
  13. A. Bezboruah, John C. Shepherdson
    Godel's Second Incompleteness Theorem for Q. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:2, pp:503-512 [Journal]
  14. Petr Hájek, Jeff B. Paris, John C. Shepherdson
    The Liar Paradox and Fuzzy Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:1, pp:339-346 [Journal]
  15. Petr Hájek, Jeff B. Paris, John C. Shepherdson
    Rational Pavelka Predicate Logic Is A Conservative Extension of Lukasiewicz Predicate Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:2, pp:669-682 [Journal]
  16. H. E. Rose, John C. Shepherdson
    European Meeting of the Association for Symbolic Logic: Bristol, England, 1973. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1974, v:39, n:2, pp:406-432 [Journal]
  17. John C. Shepherdson
    Note on a System of Myhill. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1956, v:21, n:3, pp:261-264 [Journal]
  18. John C. Shepherdson
    Inner Models for Set Theory - Part I. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1951, v:16, n:3, pp:161-190 [Journal]
  19. John C. Shepherdson
    Inner Models for Set Theory--Part II. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1952, v:17, n:4, pp:225-237 [Journal]
  20. John C. Shepherdson
    Inner Models for Set Theory - Part III. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1953, v:18, n:2, pp:145-167 [Journal]
  21. John C. Shepherdson
    On the Interpretation of Aristotelian Syllogistic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1956, v:21, n:2, pp:137-147 [Journal]
  22. John C. Shepherdson, S. Korner, M. D. Gladstone
    Meeting of the Association for Symbolic Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1964, v:29, n:4, pp:218-228 [Journal]
  23. Patricia M. Hill, John W. Lloyd, John C. Shepherdson
    Properties of a Pruning Operator. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1990, v:1, n:1, pp:99-143 [Journal]
  24. John C. Shepherdson
    Unfold/Fold Transformations of Logic Programs. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1992, v:2, n:2, pp:143-157 [Journal]
  25. Calvin C. Elgot, John C. Shepherdson
    A Semantically Meaningful Characterization of Reducible Flowchart Schemes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:325-357 [Journal]
  26. John C. Shepherdson
    In Memoriam Calvin C. Elgot. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:1-4 [Journal]
  27. John C. Shepherdson
    Graph Theoretic Characterization of G-Schemes and TL-Schemes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:217-228 [Journal]
  28. John C. Shepherdson
    A Sound and Complete Semantics for a Version of Negation as Failure. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:65, n:3, pp:343-371 [Journal]
  29. John C. Shepherdson
    The Role of Standardising Apart in Logic Programming. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:129, n:1, pp:143-142 [Journal]

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