CLP(H): Constraint logic programming for hedges

• Type: Article in International Scientific Journal
• Date: 2016

Authors

Dundua, B (Author) Other; Florido, M (Author) FCUP; Kutsia, T (Author) Other

Journal

Title: Theory and Practice of Logic Programming

Vol. 16

Pages: 141-162

ISSN: 1471-0684

Publisher: Cambridge University Press

Indexing

ISI Web of Knowledge - 2 Citations

Scopus - 4 Citations

Other information

Authenticus ID: P-00S-6P2

DOI: 10.1017/s1471068415000071

Abstract (EN): 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.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 22