A declarative approach for first-order built-in's of Prolog
type: Item
instance of: scholarly article
title: A declarative approach for first-order built-in's of Prolog
zbMATH Open document ID: 0815.68035
DOI: 10.1007/BF01190828
author: Krzysztof R. Apt
author: Elena Marchiori
author: Catuscia Palamidessi
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 1994-07-04T00:00:00Z
review text: The aim of the paper is to provide a new non-standard declarative semantic for Prolog programs with built-in's that include arithmetic operations and metalogical relations like var and ground. Completeness of the Prolog computation mechanism w.r.t. this semantics is proved. The authors provide a method for proving termination of Prolog programs with built-in's which uses this semantics.
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 599668
zbMATH Keywords: non-standard declarative semantic
zbMATH Keywords: Prolog programs
reviewed by: Nail Zamov
MaRDI profile type: Publication
cites work: Q4385536
cites work: Q3983042
cites work: A new definition of SLDNF-resolution
cites work: Reasoning about termination of pure Prolog programs
cites work: Q4010351
cites work: Q2736363
cites work: Declarative modeling of the operational behavior of logic languages
cites work: Q3992908
cites work: Q3742689
cites work: The Semantics of Predicate Logic as a Programming Language
description: scientific article; zbMATH DE number 599668