Modelling Prolog Control

The goal of this paper is to construct a semantic basis for the abstract interpretation of Prolog programs. Prolog is a well-known logic programming language which applies a depth-first search strategy in order to provide a practical approximation of Horn clause logic. While pure logic programming h...

Full description

Saved in:
Bibliographic Details
Published in:Journal of logic and computation 1993-12, Vol.3 (6), p.579-603
Main Authors: BARBUTI, ROBERTO, CODISH, MICHAEL, GIACOBAZZI, ROBERTO, LEVI, GIORGIO
Format: Article
Language:English
Subjects:
Logic programming
program analysis
Prolog
semantics
termination
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The goal of this paper is to construct a semantic basis for the abstract interpretation of Prolog programs. Prolog is a well-known logic programming language which applies a depth-first search strategy in order to provide a practical approximation of Horn clause logic. While pure logic programming has clean fixpoint, model-theoretic and operational semantics the situation for Prolog is different. Difficulties in capturing the declarative meaning of Prolog programs have led to various semantic definitions which attempt to encode the search strategy in different mathematical frameworks. However, semantic based analyses of Prolog are typically achieved by abstracting the more simple but less precise declarative semantics of pure logic programs. We propose instead to model Prolog control in a simple constraint logic language which is presented together with its declarative and operational semantics. This enables us to maintain the usual approach to declarative semantics of logic programs while capturing control aspects such as search strategy and selection rule.
ISSN:0955-792X
1465-363X
DOI:10.1093/logcom/3.6.579