Computing most general unifiers in Euclidean modal logics - Intelligence Artificielle Access content directly
Preprints, Working Papers, ... (Preprint) Year : 2023

Computing most general unifiers in Euclidean modal logics

Abstract

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.
Fichier principal
Vignette du fichier
main.pdf (519.68 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04244893 , version 1 (16-10-2023)

Identifiers

  • HAL Id : hal-04244893 , version 1

Cite

Quentin Gougeon. Computing most general unifiers in Euclidean modal logics. 2023. ⟨hal-04244893⟩
116 View
18 Download

Share

Gmail Facebook X LinkedIn More