Metraipolis › archive › dc_d24bed383799

Anti-unification — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Anti-unification
License (as archived)
CC-BY-SA-4.0
Archived
2026-11-09T14:20:07.403Z
SHA-256 of the archived text
61687255f7de18cdeedded4aa0dd34a552d3df729316a9afc2ba457d101dda49
Stable URL of this page
https://metraipolis.com/documento/dc_d24bed383799

How to cite

Anti-unification — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Anti-unification (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_d24bed383799 (Metraipolis archive dc_d24bed383799, sha256 61687255f7de18cdeedded4aa0dd34a552d3df729316a9afc2ba457d101dda49)
BibTeX
@misc{dcd24bed383799,
  title = {Anti-unification — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Anti-unification},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_d24bed383799; sha256 61687255f7de18cdeedded4aa0dd34a552d3df729316a9afc2ba457d101dda49},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Anti-unification. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Anti-unification is the process of constructing a generalization common to two given symbolic expressions. As in unification, several frameworks are distinguished depending on which expressions (also called terms) are allowed, and which expressions are considered equal. If variables representing functions are allowed in an expression, the process is called "higher-order anti-unification", otherwise "first-order anti-unification". If the generalization is required to have an instance literally equal to each input expression, the process is called "syntactical anti-unification", otherwise "E-anti-unification", or "anti-unification modulo theory". An anti-unification algorithm should compute for given expressions a complete and minimal generalization set, that is, a set covering all generalizations and containing no redundant members, respectively. Depending on the framework, a complete and minimal generalization set may have one, finitely many, or possibly infinitely many members, or may not exist at all; it cannot be empty, since a trivial generalization exists in any case. For first-order syntactical anti-unification, Gordon Plotkin gave an algorithm that computes a complete and minimal singleton generalization set containing the so-called "least general generalization" (lgg). Anti-unification should not be confused with dis-unification. The latter means the process of solving systems of inequations, that is of finding values for the variables such that all given inequations are satisfied. This task is quite different from finding generalizations.

Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico).
Fonte: Wikipedia in inglese, voce «Anti-unification» — https://en.wikipedia.org/wiki/Anti-unification
Wikidata Q17003866: «Logical generalization for symbolic expressions» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q17003866
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Anti-unification?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1381227626, consultata il 2026-11-09T14:16:36.429Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 5e249f39c231d02d5efa3d640aad43b23ad26e4b61f0a6e9632431b69bb8d261