Name
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). |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-31365-3_4 | IJCAR |
Keywords | Field | DocType |
unification modulo synchronous distributivity,single equation,congruence class,simplest known theory,binary operator,matching problem,defining axiom,unification modulo,decidability | Discrete mathematics,Algebra,Axiom,Modulo,Unification,Distributivity,Algorithm,Decidability,Congruence (geometry),Binary operation,Mathematics,Undecidable problem | Conference |
Citations | PageRank | References |
2 | 0.39 | 8 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Siva Anantharaman | 1 | 104 | 10.87 |
| Serdar Erbatur | 2 | 20 | 5.35 |
| Christopher Lynch | 3 | 27 | 3.62 |
| Paliath Narendran | 4 | 1100 | 114.99 |
| Michael Rusinowitch | 5 | 390 | 33.33 |