Unification in modal and description logics
Unification, i.e. the problem of making given terms syntactically equal by replacing their variables by terms, was originally introduced in automated deduction and term rewriting. In addition to the ``classical applications of unification, unification has also turned out to be of interest in other areas.NEWLINENEWLINE In this article the authors consider two closely related, yet different application areas for unification: modal logics and description logics. These areas are closely related since many description logics are just syntactic variants of certain modal logics. Consequently, technical results obtained in one area can be translated to the other. In most cases unification problems in modal logics and in description logics can actually be viewed as unification problems modulo the equational theory that axiomatizes equivalence in the respective logic. The authors explain the connection between description and modal logics. Then they show how unification problems can be viewed as equational unification problems. Some open problem for unification in modal logic is discussed.
- Admissibility of \(\Pi_2\)-inference rules: interpolation, model completion, and contact algebras
- About the unification type of \(\mathbf{K}+\square \square \bot\)
- Unification in pretabular extensions of S4
- Rules with parameters in modal logic. I.
- Deciding unifiability and computing local unifiers in the description logic \(\mathcal{EL}\) without top constructor
- Finitary unification in locally tabular modal logics characterized
- Projectivity and unification in substructural logics of generalized rotations
- Unifying F-logic molecules: a rectification to the original unification algorithm
- Approximate unification in the description logic \(\mathcal {FL}_0\)
- A syntactic approach to unification in transitive reflexive modal logics
- Projective unification in modal logic
- UEL: Unification Solver for the Description Logic $\mathcal{EL}$ – System Description
- Unification in a description logic with transitive closure of roles
- Contact logic is finitary for unification with constants
- What is essential unification?
- Admissibility and Unifiability in Contact Logics
- Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)
- On unification and admissible rules in Gabbay-de Jongh logics
- scientific article; zbMATH DE number 2015273 (Why is no real title available?)
- Unification and Passive Inference Rules for Modal Logics
- scientific article; zbMATH DE number 1471983 (Why is no real title available?)
- Unification in epistemic logics
- KD is nullary
- Direct product of -algebras and unification: an application to residuated lattices
- scientific article; zbMATH DE number 7599937 (Why is no real title available?)
- E-unification based on generalized embedding
- Unifying Theories of Logic and Specification
- Unification in first-order transitive modal logic
- Undecidability of the unification and admissibility problems for modal and description logics
- Filtering unification and most general unifiers in modal logic
- UNIFICATION IN SUPERINTUITIONISTIC PREDICATE LOGICS AND ITS APPLICATIONS
- Unification and Inference Rules in the Multi-modal Logic of Knowledge and Linear Time LTK
- Unification in Linear Modal Logic on Non-transitive Time with the Universal Modality
- Unification of concept terms in description logics
- Admissibility and unification in the modal logics related to S4.2
- About the unification types of modal logics
- Unification types and union splittings in intermediate logics
- Logics for contact and measure
- Logics for contact and measure
- Computing most general unifiers in Euclidean modal logics
- Projective relative unification through duality
- Undecidability of admissibility in the product of two \textbf{Alt} logics
- About the unification type of modal logics between \(\mathbf{KB}\) and \(\mathbf{KTB} \)
This page was built for publication: Unification in modal and description logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889571)
