CLP(H): Constraint logic programming for hedges

• Tipo: Artigo em Revista Científica Internacional
• Data: 2016

Autores

Dundua, B (Autor) Outra; Florido, M (Autor) FCUP; Kutsia, T (Autor) Outra

Revista

Título: Theory and Practice of Logic Programming

Vol. 16

Páginas: 141-162

ISSN: 1471-0684

Editora: Cambridge University Press

Indexação

ISI Web of Knowledge - 2 Citações

Scopus - 4 Citações

Outras Informações

ID Authenticus: 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.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 22