Matching, unification and complexity

DOI10.1145/36330.36332MaRDI QIDQ3030252zbMATH OpenOpenAlexFDO

Authors Deepak Kapur, Paliath Narendran

Publication date 1987

Published in ACM SIGSAM Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/36330.36332

zbMATH Keywords

pattern matchingunification

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract data types; algebraic specification (68Q65)

Cited in

(11)

• Complexity of matching problems
• Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description)
• A formalisation of nominal C-matching through unification with protected variables
• Automated mutual induction proof in separation logic
• scientific article; zbMATH DE number 7453112 (Why is no real title available?)
• scientific article; zbMATH DE number 7455704 (Why is no real title available?)
• Formalising nominal C-unification generalised with protected variables
• Variant narrowing and equational unification
• Complexity of unification problems with associative-commutative operators
• Nominal equational narrowing: rewriting for unification in languages with binders
• A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties

This page was built for publication: Matching, unification and complexity

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