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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Science of computer programming Jg. 25; H. 2; S. 117 - 147
1. Verfasser:	Andrews, James H.
Format:	Journal Article Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.12.1995 New York, NY Elsevier
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!