You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

Meta-variables in Logic Programming, or in Praise of Ambivalent Syntax

Article type: Research Article

Authors: Apt, Krzysztof R. | Ben-Eliyahu, Rachel

Affiliations: CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands and Dept. of Mathematics, Computer Science, Physics & Astronomy, University of Amsterdam, Plantage Muidergracht 24, 1018 TV Amsterdam, The Netherlands | Mathematics and Computer Science Department, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel

Keywords: meta-variables, ambivalent syntax, Prolog programs, soundness and completeness, absence of errors

DOI: 10.3233/FI-1996-281202

Journal: Fundamenta Informaticae, vol. 28, no. 1-2, pp. 23-36, 1996

Published: 1996
Get PDF

Abstract

We show here that meta-variables of Prolog admit a simple declarative interpretation. This allows us to extend the usual theory of SLD-resolution to the case of logic programs with meta-variables, and to establish soundness and strong completeness of the corresponding extension of the SLD-resolution. The key idea is the use of ambivalent syntax which allows us to use the same symbols as function and relation symbols. We also study the problem of absence of run-time errors in presence of meta-variables. We prove that this problem is undecidable. However, we also provide some sufficient and polynomial-time-decidable conditions which imply absence of run-time errors.

Show more