Abstract
We study a semantics for untyped, vanilla meta-programs, using the non-ground representation for object level variables. We introduce the notion of language independence for definite programs, which generalises range restriction. For language independent, definite object programs, we prove that there is a natural one-to-one correspondence between atoms p(t 1,..., t r) in the least Herbrand model of the object program and atoms of the form solve (p(t 1,t r ) in the least Herbrand model of the associated vanilla met a-program. Thus, for this class of programs, the least Herbrand model provides a sensible semantics for the meta-program. The main attraction of our approach is that the results can be further extended — in a straightforward way — to provide a sensible semantics for a limited form of amalgamation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. A. Bowen. Meta-level programming and knowledge representation. New Generation Computing, 3(3):359–383, 1985.
K. A. Bowen and R. A. Kowalski. Amalgamating language and metalanguage in logic programming. In K. L. Clark and S.-A. Tärnlund, editors, Logic Programming, pages 153–172. Academic Press, 1982.
F. Bry. Query evaluation in recursive databases: Bottom-up and top-down reconciled. Data & Knowledge Engineering, 5(4):289–312, 1990.
F. Bry, H. Decker, and R. Manthey. A uniform approach to constraint satisfaction and constraint satisfiability in deductive databases. In Proceedings EDBT'88, March 1988.
F. Bry, B. Martens, and R. Manthey. Integrity verification in knowledge bases. In Proceedings 2nd Russian Conference on Logic Programming, pages 114–139, St-Petersburg, September 1991. Springer, LNAI 592.
M. Denecker, D. De Schreye, and Y. D. Willems. Terms in logic programs: a problem with their semantics and its effect on the programming methodology. CCAI, Journal for the Integrated Study of Artificial Intelligence, Cognitive Science and Applied Epistemology, 7(3 & 4):363–383, 1990.
H. B. Ender ton. A Mathematical Introduction to Logic. Academic Press, 1972.
M. Fitting. First-Order Logic and Automated Theorem Proving. Springer-Verlag, 1990.
J. Gallagher. Transforming logic programs by specialising interpreters. In Proceedings ECAI'86, pages 109–122, 1986.
H. Gallaire and C. Lasserre. Metalevel control for logic programs. In K. L. Clark and S.-A. Tärnlund, editors, Logic Programming, pages 173–185. Academic Press, 1982.
P. M. Hill and J. W. Lloyd. Meta-programming for dynamic knowledge bases. Technical Report CS-88-18, Computer Science Department, University of Bristol, Great-Britain, 1988.
P. M. Hill and J. W. Lloyd. Analysis of meta-programs. In H. D. Abramson and M. H. Rogers, editors, Proceedings Meta'88, pages 23–51. MIT Press, 1989.
P. M. Hill and J. W. Lloyd. The Gödel report. Technical Report TR-91-02, Computer Science Department, University of Bristol, Great-Britain, March 1991. (Revised September 1991).
R. A. Kowalski. Problems and promises of computational logic. In J. W. Lloyd, editor, Proceedings of the Esprit Symposium on Computational Logic, pages 1–36. Springer-Verlag, November 1990.
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.
J. W. Lloyd. Directions for meta-programming. In Proceedings FGCS'88, pages 609–617. ICOT, 1988.
B. Martens and D. De Schreye. A perfect Herbrand semantics for untyped vanilla meta-programming. In Proceedings JICSLP'92, Washington, November 1992. MIT Press.
J.-M. Nicolas. Logic for improving integrity checking in relational databases. Acta Informatica, 18(3):227–253, 1982.
A. Ramsay. Formal Methods in Artificial Intelligence. Cambridge University Press, 1988.
B. Richards. A point of reference. Synthesis, 28:431–445, 1974.
L. Sterling and R. D. Beer. Metainterpreters for expert system construction. Journal of Logic Programming, pages 163–178, 1989.
L. Sterling and E. Shapiro. The Art of Prolog. MIT Press, 1986.
V. S. Subrahmanian. A simple formulation of the theory of metalogic programming. In H. D. Abramson and M. H. Rogers, editors, Proceedings Meta'88, pages 65–101. MIT Press, 1989.
A. Takeuchi and K. Furukawa. Partial evaluation of Prolog programs and its application to metaprogramming. In H.-J. Kugler, editor, Information Processing 86, pages 415–420, 1986.
J. L. Triff and S. D. Prestwich. Meta-programming for reordering literals in deductive databases. In Proceedings Meta'92, Uppsala, June 1992. Springer-Verlag.
J. D. Ullman. Database and Knowledge-Base Systems, Volume 1. Computer Science Press, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Schreye, D., Martens, B. (1992). A sensible least Herbrand semantics for untyped vanilla meta-programming and its extension to a limited form of amalgamation. In: Pettorossi, A. (eds) Meta-Programming in Logic. META 1992. Lecture Notes in Computer Science, vol 649. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56282-6_13
Download citation
DOI: https://doi.org/10.1007/3-540-56282-6_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56282-5
Online ISBN: 978-3-540-47505-7
eBook Packages: Springer Book Archive