Skip to main content
Conference Proceedings

Why the occur-check is not a problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1992) 631 LNCS 69-86
DOI: 10.1007/3-540-55844-6_128
11Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In most Prolog implementations for the efficiency reasons so-called occur-check is omitted from the unification algorithm. We provide here natural syntactic conditions which allow the occur-check to be safely omitted. The established results apply to most well-known Prolog programs and seem to explain why this omission does not lead in practice to any complications.

Cite

CITATION STYLE

APA

Apt, K. R., & Pellegrini, A. (1992). Why the occur-check is not a problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 631 LNCS, pp. 69–86). Springer Verlag. https://doi.org/10.1007/3-540-55844-6_128

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