Unification, weak unification, upper bound, lower bound, and generalization problems
From MaRDI portal
Publication:5055751
DOI10.1007/3-540-53904-2_88zbMATH Open1503.68086OpenAlexW1555227499MaRDI QIDQ5055751FDOQ5055751
Authors: Franz Baader 
Publication date: 9 December 2022
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-53904-2_88
Recommendations
Cites Work
- Title not available (Why is that?)
- A Machine-Oriented Logic Based on the Resolution Principle
- Properties of substitutions and unifications
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Title not available (Why is that?)
- Unification in commutative idempotent monoids
- Unification in commutative theories
- Unification in monoidal theories
- Characterizations of unification type zero
- Title not available (Why is that?)
- Unification, weak unification, upper bound, lower bound, and generalization problems
- Unification properties of commutative theories: a categorical treatment
Cited In (11)
- Anti-unification and the theory of semirings
- Anti-unification for unranked terms and hedges
- E-generalization using grammars
- A library of anti-unification algorithms
- Title not available (Why is that?)
- Unification, weak unification, upper bound, lower bound, and generalization problems
- Title not available (Why is that?)
- Unranked second-order anti-unification
- A note on unification, subsumption and unification type
- Finite limits and anti-unification in substitution categories
- A modular order-sorted equational generalization algorithm
This page was built for publication: Unification, weak unification, upper bound, lower bound, and generalization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055751)
