| 2001 | ||
|---|---|---|
| j27 | Petr Hájek, John C. Shepherdson: A note on the notion of truth in fuzzy logic. Ann. Pure Appl. Logic 109(1-2): 65-69 (2001) | |
| 2000 | ||
| j26 | Petr Hájek, Jeff B. Paris, John C. Shepherdson: The Liar Paradox and Fuzzy Logic. J. Symb. Log. 65(1): 339-346 (2000) | |
| j25 | Petr Hájek, Jeff B. Paris, John C. Shepherdson: Rational Pavelka Predicate Logic Is A Conservative Extension of Lukasiewicz Predicate Logic. J. Symb. Log. 65(2): 669-682 (2000) | |
| 1995 | ||
| c2 | John C. Shepherdson: W. S. Jevons: his Logical Machine and Work Induction and Boolean Algebra. Machine Intelligence 15 1995: 489-505 | |
| 1994 | ||
| j24 | Kerima Benkerimi, John C. Shepherdson: Partial Deduction of Updateable Definite Logic Programs. J. Log. Program. 18(1): 1-26 (1994) | |
| j23 | John C. Shepherdson: The Role of Standardising Apart in Logic Programming. Theor. Comput. Sci. 129(1): 143-142 (1994) | |
| 1992 | ||
| j22 | John C. Shepherdson: Mints Type Deductive Calculi for Logic Programming. Ann. Pure Appl. Logic 56(1-3): 7-17 (1992) | |
| j21 | ||
| j20 | John C. Shepherdson: Unfold/Fold Transformations of Logic Programs. Mathematical Structures in Computer Science 2(2): 143-157 (1992) | |
| 1991 | ||
| j19 | ||
| j18 | John W. Lloyd, John C. Shepherdson: Partial Evaluation in Logic Programming. J. Log. Program. 11(3&4): 217-242 (1991) | |
| j17 | John C. Shepherdson: Correct Answers to Allowed Programs and Queries are Ground. J. Log. Program. 11(3&4): 359-362 (1991) | |
| c1 | P. A. Gardner, John C. Shepherdson: Unfold/Fold Transformations of Logic Programs. Computational Logic - Essays in Honor of Alan Robinson 1991: 565-583 | |
| 1990 | ||
| j16 | Patricia M. Hill, John W. Lloyd, John C. Shepherdson: Properties of a Pruning Operator. J. Log. Comput. 1(1): 99-143 (1990) | |
| 1989 | ||
| j15 | John C. Shepherdson: A Sound and Complete Semantics for a Version of Negation as Failure. Theor. Comput. Sci. 65(3): 343-371 (1989) | |
| 1988 | ||
| p1 | John C. Shepherdson: Negation in Logic Programming. Foundations of Deductive Databases and Logic Programming. 1988: 19-88 | |
| 1985 | ||
| j14 | ||
| 1984 | ||
| j13 | John C. Shepherdson: Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption. J. Log. Program. 1(1): 51-79 (1984) | |
| 1982 | ||
| j12 | John C. Shepherdson: Graph Theoretic Characterization of G-Schemes and TL-Schemes. Theor. Comput. Sci. 17: 217-228 (1982) | |
| 1981 | ||
| j11 | ||
| 1979 | ||
| j10 | Calvin C. Elgot, John C. Shepherdson: A Semantically Meaningful Characterization of Reducible Flowchart Schemes. Theor. Comput. Sci. 8: 325-357 (1979) | |
| 1976 | ||
| j9 | A. Bezboruah, John C. Shepherdson: Godel's Second Incompleteness Theorem for Q. J. Symb. Log. 41(2): 503-512 (1976) | |
| 1974 | ||
| j8 | H. E. Rose, John C. Shepherdson: European Meeting of the Association for Symbolic Logic: Bristol, England, 1973. J. Symb. Log. 39(2): 406-432 (1974) | |
| 1964 | ||
| j7 | John C. Shepherdson, S. Korner, M. D. Gladstone: Meeting of the Association for Symbolic Logic. J. Symb. Log. 29(4): 218-228 (1964) | |
| 1963 | ||
| j6 | John C. Shepherdson, Howard E. Sturgis: Computability of Recursive Functions. J. ACM 10(2): 217-255 (1963) | |
| 1956 | ||
| j5 | John C. Shepherdson: On the Interpretation of Aristotelian Syllogistic. J. Symb. Log. 21(2): 137-147 (1956) | |
| j4 | ||
| 1953 | ||
| j3 | ||
| 1952 | ||
| j2 | ||
| 1951 | ||
| j1 | ||
| 1 | Kerima Benkerimi | |
| 2 | A. Bezboruah | |
| 3 | Calvin C. Elgot | |
| 4 | P. A. Gardner | |
| 5 | M. D. Gladstone | |
| 6 | Patricia M. Hill | |
| 7 | Petr Hájek | |
| 8 | S. Korner | |
| 9 | John W. Lloyd | |
| 10 | Jeff B. Paris | |
| 11 | H. E. Rose | |
| 12 | Howard E. Sturgis |
Colors in the list of coauthors
Last update Mon May 20 05:44:47 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page