CLP(H): Constraint logic programming for hedges

CLP(H) is an instantiation of the general constraint logic programming scheme with the constraint domain of hedges. Hedges are finite sequences of unranked terms, built over variadic function symbols and three kinds of variables: for terms, for hedges, and for function symbols. Constraints involve e...

Full description

Saved in:
Bibliographic Details
Published in:Theory and practice of logic programming Vol. 16; no. 2; pp. 141 - 162
Main Authors: DUNDUA, BESIK, FLORIDO, MÁRIO, KUTSIA, TEMUR, MARIN, MIRCEA
Format: Journal Article
Language:English
Published: Cambridge, UK Cambridge University Press 01.03.2016
Subjects:
Algebra
Logic programming
Mathematical analysis
Regular Papers
Semantics
Solvers
Sound
Stopping
Symbols
hedges
constraint solving
constraint logic programming
ISSN:1471-0684, 1475-3081
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:CLP(H) is an instantiation of the general constraint logic programming scheme with the constraint domain of hedges. Hedges are finite sequences of unranked terms, built over variadic function symbols and three kinds of variables: for terms, for hedges, and for function symbols. Constraints involve equations between unranked terms and atoms for regular hedge language membership. We study algebraic semantics of CLP(H) programs, define a sound, terminating, and incomplete constraint solver, investigate two fragments of constraints for which the solver returns a complete set of solutions, and describe classes of programs that generate such constraints.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1471-0684
1475-3081
DOI:10.1017/S1471068415000071