Undecidability of the unification and admissibility problems for modal and description logics
From MaRDI portal
Publication:5277814
DOI10.1145/1380572.1380574zbMath1367.03026arXivcs/0609052OpenAlexW2021587896WikidataQ56474455 ScholiaQ56474455MaRDI QIDQ5277814
Frank Wolter, Michael Zakharyashchev
Publication date: 12 July 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0609052
Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)
Related Items
On rules, A syntactic approach to unification in transitive reflexive modal logics, Deciding unifiability and computing local unifiers in the description logic \(\mathcal{EL}\) without top constructor, Tutorial on Admissible Rules in Gudauri, Admissibility and Unifiability in Contact Logics, A Tableau Method for Checking Rule Admissibility in S4, Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition, Unification in epistemic logics, KD is nullary, Willem Blok and modal logic, Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$, Unification in the Description Logic $\mathcal{EL}$ without the Top Concept, Unification in the Description Logic $\mathcal{EL}$, Admissibility of \(\Pi_2\)-inference rules: interpolation, model completion, and contact algebras, Unification in Linear Modal Logic on Non-transitive Time with the Universal Modality
