CLP(H): constraint logic programming for hedges

DOI10.1017/S1471068415000071zbMATH Open1379.68057arXiv1503.00336OpenAlexW2963372585MaRDI QIDQ4593022FDOQ4593022

Authors: B. Dundua, Mário Florido, Temur Kutsia, Mircea Marin 

Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

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

Full work available at URL: https://arxiv.org/abs/1503.00336

Recommendations

• Constraint logic programming for hedges: a semantic reconstruction
• Hierarchical constraint logic programming
• The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
• scientific article; zbMATH DE number 1926617
• scientific article; zbMATH DE number 826301

zbMATH Keywords

constraint logic programmingconstraint solvinghedges

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17) Semantics in the theory of computing (68Q55)

Cites Work

• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Title not available (Why is that?)
• Partial derivatives of regular expressions and finite automaton constructions
• Orderings for term-rewriting systems
• The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
• Completion of rewrite systems with membership constraints. II: Constraint solving
• Termination proofs of well-moded logic programs via conditional rewrite systems
• A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
• Solving equations with sequence variables and sequence functions
• Regular expression pattern matching for XML
• Matching with Regular Constraints
• Title not available (Why is that?)
• Artificial Intelligence and Symbolic Computation
• Foundations of the rule-based system \(\rho\,\text{Log}\)
• A uniform approach to constraint-solving for lists, multisets, compact lists, and sets
• Constraint logic programming for hedges: a semantic reconstruction

Cited In (3)

• Extending HCLP with partially ordered hierarchies and composite constraints
• Variadic equational matching in associative and commutative theories
• Constraint logic programming for hedges: a semantic reconstruction

Uses Software

• Mathematica
• Maude
• Veriflog
• Tom
• XCentric
• ASF+SDF
• CLP(Flex)

This page was built for publication: CLP(\(\mathsf{H}\)): constraint logic programming for hedges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593022)