From Logic to Logic Programming von Shepherdson, J.C.

Volltext

SLDNF-resolution with equality von Shepherdson, J.C.

Volltext

Algorithmic information theory von Shepherdson, J.C.

Volltext

The role of standardising apart in logic programming von Shepherdson, J.C.

Volltext

Calvin C. Elgot 1922–1980 von Shepherdson, J.C.

Volltext

A sound and complete semantics for a version of negation as failure von Shepherdson, J.C.

Volltext

In memoriam Calvin C. Elgot von Shepherdson, J.C.

Volltext

Mints type deductive calculi for logic programming von Shepherdson, J.C.

Volltext

Partial evaluation in logic programming von Lloyd, J.W., Shepherdson, J.C.

Volltext

Algorithmic information theory: By G.J. Chaitin. Cambridge University Press, Cambridge, 1987, Price £20.00, ISBN 0 521 34306 2 von Shepherdson, J.C.

Volltext

R70-20 Sequential Boolean Equations von Shepherdson, J.C.

Volltext

Partial deduction of updateable definite logic programs von Benkerimi, K., Shepherdson, J.C.

Volltext

Algorithmic Procedures, Generalized Turing Algorithms, and Elementary Recursion Theory von Shepherdson, J.C.

Volltext

Utility theory based on rational probabilities von Shepherdson, J.C.

Volltext

Computational Complexity of Real Functions von Shepherdson, J.C.

Volltext

Elimination of higher type levels in definitions of primitive recursive functionals by means of transfinite recursion von Schwichtenberg, Helmut, Rose, H.E, Shepherdson, J.C

Volltext bestellen

Correct answers to allowed programs and queries are ground von Shepherdson, J.C.

Volltext

Note on a system of myhill von Shepherdson, J.C.

Volltext

Theoretical considerations in continuous flow analysis von Walker, W.H.C., Shepherdson, J.C., McGowan, G.K.

Volltext

Sets recognized by n-tape automata von Eilenberg, S, Elgot, C.C, Shepherdson, J.C

Volltext