Meta-variables in Logic Programming, or in Praise of Ambivalent Syntax
Krzysztof Rafal Apt, Rachel Ben-Eliyahu · Fundamenta Informaticae · 1996
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