Matching with Regular Constraints

DOI10.1007/11591191_16MaRDI QIDQ5387841zbMATH OpenOpenAlexFDO

Authors Temur Kutsia, Mircea Marin

Publication date 27 May 2008

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11591191_16

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05)

Recommendations

• Constrained pattern matching
• Matching with floor constraints
• A constrained matching problem
• An optimal matching problem with constraints
• Restricted matchings
• Constrained random matching
• scientific article; zbMATH DE number 4078846
• Matching Dynamics with Constraints
• Tight bound for matching

Cited in

(9)

• On the relation between context and sequence unification
• Anti-unification for unranked terms and hedges
• Regular matching and inclusion on compressed tree patterns with constrained context variables
• Matching Dynamics with Constraints
• Programming with sequence and context variables
• Constrained pattern matching
• Matching with membership constraints for hedge and context variables
• CLP(\(\mathsf{H}\)): constraint logic programming for hedges
• Regular expression order-sorted unification and matching

This page was built for publication: Matching with Regular Constraints

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