A theory of first-order built-in’s of prolog

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We provide here a framework for studying Prolog programs with various built-in’s that include arithmetic operations, and such metalogical relations like vat and ground. To this end we propose a new, declarative semantics and prove completeness of the Prolog computation mechanism w.r.t, this semantics. Finally, we provide a method for proving termination of Prolog programs with built-in’s which uses this semantics. The method is shown to be modular.

Original languageEnglish
Title of host publicationAlgebraic and Logic Programming - 3rd International Conference, Proceedings
EditorsHelene Kirchner, Giorgio Levi
PublisherSpringer Verlag
Pages69-83
Number of pages15
ISBN (Print)9783540558736
DOIs
Publication statusPublished - 1 Jan 1992
Externally publishedYes
Event3rd International Conference on Algebraic and Logic Programming, 1992 - Volterra, Italy
Duration: 2 Sept 19924 Sept 1992

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume632 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Conference on Algebraic and Logic Programming, 1992
Country/TerritoryItaly
CityVolterra
Period2/09/924/09/92

Fingerprint

Dive into the research topics of 'A theory of first-order built-in’s of prolog'. Together they form a unique fingerprint.

Cite this