E-unification based on generalized embedding
DOI10.1017/S0960129522000019zbMATH Open1489.68117OpenAlexW4220816461MaRDI QIDQ5084482FDOQ5084482
Authors:
Publication date: 24 June 2022
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129522000019
Recommendations
orderinguniversal algebraequational theoryunification theory\(E\)-unification(homeomorphic) embedded \(E\)-unifiersessential unificationpure \(E\)-unifiers
Grammars and rewriting systems (68Q42) Applications of universal algebra in computer science (08A70)
Cites Work
- Unification theory
- Orderings for term-rewriting systems
- Unification through projectivity
- Term Rewriting and All That
- A Machine-Oriented Logic Based on the Resolution Principle
- Termination of rewriting
- Unification in modal and description logics
- Unification: a multidisciplinary survey
- The theory of well-quasi-ordering: a frequently discovered concept
- Ordering by Divisibility in Abstract Algebras
- Title not available (Why is that?)
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Title not available (Why is that?)
- Martin Davis on computability, computational logic, and mathematical foundations
- Unification theory
- A note on unification type zero
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
- Title not available (Why is that?)
- Order-sorted homeomorphic embedding modulo combinations of associativity and/or commutativity axioms
- Partial evaluation of order-sorted equational programs modulo axioms
- Essential unifiers
- E-unification based on generalized embedding
- Exact unification and admissibility
- What is essential unification?
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: E-unification based on generalized embedding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084482)