An Early Use of Continuations and Partial Evaluation for Compiling Rules Written in First-Order Predicate Calculus

ISSN： 1388-3690

Source： LISP and Symbolic Computation, Vol.12, Iss.1, 1999-04, pp. : 105-113

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Compiling dyadic first-order specifications into map algebra

By Cantone D. Formisano A. Omodeo E.G. Zarba C.G.

Theoretical Computer Science, Vol. 293, Iss. 2, 2003-02 ,pp. : 447-475

Elsevier

Access to resources Recommend Favorite

First-order spectra with one binary predicate

By Durand A. Ranaivoson S.

Theoretical Computer Science, Vol. 160, Iss. 1, 1996-06 ,pp. : 305-320

Elsevier

Access to resources Recommend Favorite

Confirmation-Guided Discovery of First-Order Rules with Tertius

By Flach P.A.

Machine Learning, Vol. 42, Iss. 1-2, 2001-01 ,pp. : 61-95

Springer Publishing Company

Access to resources Recommend Favorite

A First-Order Syntax for the -Calculus in Isabelle/HOL using Permutations

By Rockl C.

Electronic Notes in Theoretical Computer Science, Vol. 58, Iss. 1, 2004-01 ,pp. : 1-17

Elsevier

Access to resources Recommend Favorite

EFFICIENT INDUCTION AND EFFECTIVE USE OF FIRST-ORDER KNOWLEDGE

By Pompe Uros Kononenko Igor

Applied Artificial Intelligence, Vol. 12, Iss. 5, 1998-07 ,pp. : 421-453

Taylor & Francis Ltd

Access to resources Recommend Favorite