Computing most general unifiers in Euclidean modal logics
Résumé
We prove that all extensions of K5 have unary unification. Our result applies to the parametric and relative variants of unification. In addition, our proof is constructive in the sense that we can effectively compute, in 4-exponential space, a most general unifier for any unifiable formula. We also investigate special unification types: we show that K5 and KD5 are transparent, and characterize the projective extensions of K5.
Domaines
Informatique [cs]Origine | Fichiers produits par l'(les) auteur(s) |
---|