Foundational issues in implementing constraint logic programming systems

Implementations of Constraint Logic Programming (CLP) systems are often incomplete with respect to the theories they are intended to implement. This paper studies two issues that arise in dealing with these incomplete implementations. First, the notion of “satisfiability function” (the analogue of u...

Full description

Saved in:
Bibliographic Details
Published in:Science of computer programming Vol. 25; no. 2; pp. 117 - 147
Main Author: Andrews, James H.
Format: Journal Article Conference Proceeding
Language:English
Published: Amsterdam Elsevier B.V 01.12.1995
New York, NY Elsevier
Subjects:
Applied sciences
Artificial intelligence
Computer science; control theory; systems
Exact sciences and technology
Learning and adaptive systems
Programming theory
Software
Software engineering
Theoretical computing
Constraint
Theorem proving
Satisfaction
Unification
Constraint logic programming
Automatic proving
Logical programming
Implementation
Satisfiability
ISSN:0167-6423, 1872-7964
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Implementations of Constraint Logic Programming (CLP) systems are often incomplete with respect to the theories they are intended to implement. This paper studies two issues that arise in dealing with these incomplete implementations. First, the notion of “satisfiability function” (the analogue of unification) is formally defined, and the question of which such functions are reasonable is studied. Second, techniques are given, based on the notion of satisfiability function, for formally (proof-theoretically) specifying an intended CLP theory or characterizing an existing CLP system. Such proof-theoretic characterizations have applications in proving soundness and completeness results, and proving properties of programs. Notions from substructural logic and the notion of Henkinness of the theory are shown to be important here.
ISSN:0167-6423
1872-7964
DOI:10.1016/0167-6423(95)00011-9