Unification modulo Synchronous Distributivity - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Unification modulo Synchronous Distributivity

Résumé

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).
Fichier non déposé

Dates et versions

hal-00684185 , version 1 (30-03-2012)

Identifiants

  • HAL Id : hal-00684185 , version 1

Citer

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⟩
214 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More