CLP(H):Constraint logic programming for hedges

DOI10.1017/S1471068415000071zbMath1379.68057arXiv1503.00336OpenAlexW2963372585MaRDI QIDQ4593022

Mircea Marin, Mário Florido, Temur Kutsia, Besik Dundua

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

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

Related Items

Variadic equational matching in associative and commutative theories

Uses Software

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

Cites Work

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

This page was built for publication: CLP(H):Constraint logic programming for hedges