Skip to main content
Conference Proceedings

On the unification free prolog programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1993) 711 LNCS 1-19
DOI: 10.1007/3-540-57182-5_1
36Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We provide simple conditions which allow us to conclude that in case of several well-known Prolog programs the unification algorithm can be replaced by iterated matching. The main tools used here are types and generic expressions for types. As already noticed by other researchers, such a replacement offers a possibility of improving the efficiency of program’s execution.

Cite

CITATION STYLE

APA

Apt, K. R., & Etalle, S. (1993). On the unification free prolog programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 711 LNCS, pp. 1–19). Springer Verlag. https://doi.org/10.1007/3-540-57182-5_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free