E-Unification based on Generalized Embedding
From MaRDI portal
Publication:5084482
DOI10.1017/S0960129522000019zbMath1489.68117OpenAlexW4220816461MaRDI QIDQ5084482
No author found.
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
orderinguniversal algebraequational theoryunification theory\(E\)-unification(homeomorphic) embedded \(E\)-unifiersessential unificationpure \(E\)-unifiers
Applications of universal algebra in computer science (08A70) Grammars and rewriting systems (68Q42)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Martin Davis on computability, computational logic, and mathematical foundations
- Orderings for term-rewriting systems
- A note on unification type zero
- Termination of rewriting
- Unification theory
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
- Partial evaluation of order-sorted equational programs modulo axioms
- Essential unifiers
- The theory of well-quasi-ordering: a frequently discovered concept
- Unification in modal and description logics
- Exact Unification and Admissibility
- What Is Essential Unification?
- Unification: a multidisciplinary survey
- Unification through projectivity
- Term Rewriting and All That
- Order-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms*
- E-Unification based on Generalized Embedding
- A Machine-Oriented Logic Based on the Resolution Principle
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Ordering by Divisibility in Abstract Algebras
