What Is Essential Unification?
From MaRDI portal
Publication:3305325
DOI10.1007/978-3-319-41842-1_11zbMath1439.68022OpenAlexW2584691322MaRDI QIDQ3305325
No author found.
Publication date: 6 August 2020
Published in: Outstanding Contributions to Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-41842-1_11
unification theory\(E\)-unificationmost general unifiersessential unifiersorder relations for unification
Logic in artificial intelligence (68T27) Mechanization of proofs and logical operations (03B35) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items (1)
Cites Work
- On word equations in one variable
- Unification under associativity and idempotence is of type nullary
- The theory of idempotent semigroups is of unification type zero
- Eliminating dublication with the hyper-linking strategy
- Complexity of unification problems with associative-commutative operators
- Comparing instance generation methods for automated reasoning
- A note on unification type zero
- Unification theory
- The decision problem for exponential diophantine equations
- A Noetherian and confluent rewrite system for idempotent semigroups
- A technical note on AC-unification. The number of minimal unifiers of the equation \(\alpha x_ 1+ \cdots + \alpha x_ p \doteq _{AC} \beta y_ 1+ \cdots + \beta y_ q\)
- On equations in free semigroups and groups
- Word unification and transformation of generalized equations
- Complete sets of unifiers and matchers in equational theories
- Nominal unification
- Deciding unifiability and computing local unifiers in the description logic \(\mathcal{EL}\) without top constructor
- Essential unifiers
- Beweisalgorithmen für die Prädikatenlogik
- Hybrid Unification in the Description Logic $\mathcal{EL}$
- Unification in modal and description logics
- WORD EQUATIONS WITH ONE UNKNOWN
- A Proof Method for Quantification Theory: Its Justification and Realization
- Toward Mechanical Mathematics
- An improved proof procedure1
- Minimal and complete word unification
- Satisfiability of word equations with constants is in PSPACE
- Unification: a multidisciplinary survey
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
- Hilbert's Tenth Problem is Unsolvable
- Term Rewriting and All That
- One-Variable Word Equations in Linear Time
- A Machine-Oriented Logic Based on the Resolution Principle
- A Computing Procedure for Quantification Theory
- Makanin's algorithm for word equations-two improvements and a generalization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: What Is Essential Unification?
