hal-00684185, version 1
Unification modulo Synchronous Distributivity
IJCAR 2012 (The 6th International Joint Conference on Automated Reasoning) 7364 (2012) 14--29
Abstract: Unification modulo the theory defined by a single equation which specifies that a binary operator distributes synchronously over another binary operator is shown to be undecidable. It is the simplest known theory, to our knowledge, for which unification is undecidable: it has only one defining axiom and moreover, every congruence class is finite (so, the matching problem is decidable).
- a – Clarkson University, Potsdam, NY (USA)
- 1:
- Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges
- 2:
- State university of New York
- 3:
- Clarkson University, Potsdam NY (USA)
- 4:
- Université de Lorraine – Université de Franche-Comté – CNRS : FRE2661 – INRIA
- Domain : Computer Science/Computation and Language
- Keywords : Equational unification – Intercell Turing machine – Decidability
- hal-00684185, version 1
- http://hal.archives-ouvertes.fr/hal-00684185
- oai:hal.archives-ouvertes.fr:hal-00684185
- From:
- Submitted on: Friday, 30 March 2012 17:36:37
- Updated on: Monday, 8 April 2013 13:40:47



Export