Unification modulo synchronous distributivity

Authors:
Siva Anantharaman;Serdar Erbatur;Christopher Lynch;Paliath Narendran;Michael Rusinowitch
Affiliations:
LIFO, Université d'Orléans, France;University at Albany---SUNY;Clarkson University;University at Albany---SUNY;Loria-INRIA Lorraine, Nancy, France
Venue:
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Year:
2012

Citing 8
Cited 1

Security without identification: transaction systems to make big brother obsolete

Communications of the ACM
Unification problems with one-sided distributivity

Journal of Symbolic Computation
A proof theory for general unification

A proof theory for general unification
The undecidability of the semi-unification problem

Information and Computation
Term rewriting and all that

Term rewriting and all that
A decision algorithm for distributive unification

Theoretical Computer Science - Special issue on rewriting techniques and applications
A General Theory of Semi-Unification

A General Theory of Semi-Unification
On locality and the exchange law for concurrent processes

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory

Hierarchical combination

CADE'13 Proceedings of the 24th international conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

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).