CLP(H): constraint logic programming for hedges

DOI10.1017/S1471068415000071MaRDI QIDQ4593022zbMATH OpenOpenAlexFDO

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)

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

zbMATH Keywords

constraint logic programmingconstraint solvinghedges

Mathematics Subject Classification ID

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

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.

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

Cites work

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

Cited in

(4)

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

Describes a project that uses

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)