Craig interpolants for hybrid modal logics are computable in 4-EXPTIME when they exist, while uniform interpolant existence is undecidable.
Living without beth and craig: Definitions and interpolants in description and modal logics with nominals and role inclusions
2 Pith papers cite this work, alongside 4 external citations. Polarity classification is still indexing.
2
Pith papers citing it
4
external citations · OpenAlex
fields
cs.LO 2representative citing papers
Tabular modal logics admit propositionally sized interpolants and strongest implicates iff NP ⊆ P/poly, while non-tabular ones require exponential size unconditionally.
citing papers explorer
-
Computation and Size of Interpolants for Hybrid Modal Logics
Craig interpolants for hybrid modal logics are computable in 4-EXPTIME when they exist, while uniform interpolant existence is undecidable.
-
The Size of Interpolants in Modal Logics
Tabular modal logics admit propositionally sized interpolants and strongest implicates iff NP ⊆ P/poly, while non-tabular ones require exponential size unconditionally.