E-unification based on generalized embedding
From MaRDI portal
Publication:5084482
Recommendations
Cites work
- scientific article; zbMATH DE number 8327 (Why is no real title available?)
- scientific article; zbMATH DE number 475429 (Why is no real title available?)
- scientific article; zbMATH DE number 1953286 (Why is no real title available?)
- scientific article; zbMATH DE number 3198033 (Why is no real title available?)
- A Machine-Oriented Logic Based on the Resolution Principle
- A note on unification type zero
- E-unification based on generalized embedding
- Essential unifiers
- Exact unification and admissibility
- Martin Davis on computability, computational logic, and mathematical foundations
- Ordering by Divisibility in Abstract Algebras
- Orderings for term-rewriting systems
- Partial evaluation of order-sorted equational programs modulo axioms
- Term Rewriting and All That
- Termination of rewriting
- The theory of well-quasi-ordering: a frequently discovered concept
- Unification in modal and description logics
- Unification theory
- Unification theory
- Unification through projectivity
- Unification: a multidisciplinary survey
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- What is essential unification?
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
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)