Abstract
AbstractWe show that the DA-uniflcation problem is undecidable. That is, given two binary function symbols ⊕ and ⊗, variables and constants, it is undecidable if two terms built from these symbols can be unified provided the following DA-axioms hold:Two terms are DA-unifiable (i.e. an equation is solvable in DA) if there exist terms to be substituted for their variables such that the resulting terms are equal in the equational theory DA.This is the smallest currently known axiomatic subset of Hilbert's tenth problem for which an undecidability result has been obtained.
Publisher
Cambridge University Press (CUP)
Reference26 articles.
1. Special issue on unification theory;Kirchner;Journal of Symbolic Computation
2. Matching with distributivity
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Characterizations of N(2,2,0) Algebras;Algebra;2016-01-10
2. Algebraic Intruder Deductions;Logic for Programming, Artificial Intelligence, and Reasoning;2005
3. Unification Modulo ACUI Plus Distributivity Axioms;Journal of Automated Reasoning;2004-07
4. Unification Modulo ACUI Plus Homomorphisms/Distributivity;Automated Deduction – CADE-19;2003
5. Solving Numerical Constraints;Handbook of Automated Reasoning;2001