Unification modulo Synchronous Distributivity

Siva Anantharaman 1 Serdar Erbatur 2 Christopher Lynch 3 Paliath Narendran 2 Michael Rusinowitch 4
4 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
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).
Document type :
Conference papers
Complete list of metadatas

Contributor : Siva Anantharaman <>
Submitted on : Friday, March 30, 2012 - 5:36:37 PM
Last modification on : Tuesday, August 13, 2019 - 11:32:01 AM


  • HAL Id : hal-00684185, version 1


Siva Anantharaman, Serdar Erbatur, Christopher Lynch, Paliath Narendran, Michael Rusinowitch. Unification modulo Synchronous Distributivity. IJCAR 2012 (The 6th International Joint Conference on Automated Reasoning), Jun 2012, Manchester, United Kingdom. pp.14--29. ⟨hal-00684185⟩



Record views