Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism

ISSN： 1388-3690

Source： LISP and Symbolic Computation, Vol.18, Iss.1-2, 2005-06, pp. : 121-210

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

The List Introduction Strategy for the Derivation of Logic Programs

By Pettorossi Alberto Proietti Maurizio

Formal Aspects of Computing, Vol. 13, Iss. 3-5, 2002-07 ,pp. : 233-251

Springer Publishing Company

Access to resources Recommend Favorite

Using Nondeterminism to Design Efficient Deterministic Algorithms

By Chen Jianer Firesen Donald K. Jia Weijia Kanj Iyad A.

Algorithmica, Vol. 40, Iss. 2, 2004-07 ,pp. : 83-97

Springer Publishing Company

Access to resources Recommend Favorite

Verifying Termination and Reduction Properties about Higher-Order Logic Programs

By Pientka Brigitte

Journal of Automated Reasoning, Vol. 34, Iss. 2, 2005-12 ,pp. : 179-207

Springer Publishing Company

Access to resources Recommend Favorite

Efficient Specialization of Relational Concepts

By Vanlehn K.

Machine Learning, Vol. 04, Iss. 1, 1989-10 ,pp. : 99-106

Springer Publishing Company

Access to resources Recommend Favorite

On logic programs that do not fail

By Pedreschi D. Ruggieri S.

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

Elsevier

Access to resources Recommend Favorite