Unification of concept terms in description logics
From MaRDI portal
Recommendations
- Unification in the description logic EL
- Unification in the Description Logic $\mathcal{EL}$
- Unification in modal and description logics
- scientific article; zbMATH DE number 1149440
- Hybrid unification in the description logic \(\mathcal{EL}\)
- Unification in the description logic \(\mathcal{EL}\) without the top concept
- Unification in a description logic with transitive closure of roles
- Set-term unification in a logic database language
- scientific article; zbMATH DE number 1223549
- scientific article; zbMATH DE number 2015273
Cites work
- Attributive concept descriptions with complements
- Cardinality restrictions on concepts
- Combination problems for commutative/monoidal theories or how algebra can help in equational unification
- Computational complexity of terminological reasoning in BACK
- Deduction in Concept Languages: from Subsumption to Instance Checking
- Haskell overloading is DEXPTIME-complete
- scientific article; zbMATH DE number 3854429 (Why is no real title available?)
- scientific article; zbMATH DE number 67500 (Why is no real title available?)
- scientific article; zbMATH DE number 67501 (Why is no real title available?)
- scientific article; zbMATH DE number 67502 (Why is no real title available?)
- scientific article; zbMATH DE number 140381 (Why is no real title available?)
- scientific article; zbMATH DE number 140398 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 592368 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 1149405 (Why is no real title available?)
- scientific article; zbMATH DE number 1149436 (Why is no real title available?)
- scientific article; zbMATH DE number 1555173 (Why is no real title available?)
- Incoherence and subsumption for recursive views and queries in object-oriented data models
- Matching - a special case of unification?
- Matching in description logics
- Reasoning and revision in hybrid representation systems
- Some new decidability results on positive and negative set constraints
- Terminological reasoning is inherently intractable
- The complexity of existential quantification in concept languages.
- The KL-ONE family
- Unification in commutative theories
- Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
- Unification in monoidal theories
Cited in
(37)- Closure properties and decision problems of dag automata
- Unification modulo ACUI plus distributivity axioms
- Language equations
- About the unification type of \(\mathbf{K}+\square \square \bot\)
- Multi-agent logics with dynamic accessibly relations, projective unifiers
- Computational completeness of equations over sets of natural numbers
- Deciding unifiability and computing local unifiers in the description logic \(\mathcal{EL}\) without top constructor
- Decidability of trajectory-based equations
- Approximate unification in the description logic \(\mathcal {FL}_0\)
- Unification in modal and description logics
- Extending unification in \(\mathcal{EL}\) to disunification: the case of dismatching and local disunification
- Unification in a description logic with transitive closure of roles
- A unified framework for non-standard reasoning services in description logics
- Contact logic is finitary for unification with constants
- Unification in the Description Logic $\mathcal{EL}$
- Description Logics
- Canonical rules
- Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)
- KD is nullary
- Multi-Agents’ Temporal Logic using Operations of Static Agents’ Knowledge
- Extensions of unification modulo ACUI
- Unification in the description logic \(\mathcal{EL}\) without the top concept
- Filtering unification and most general unifiers in modal logic
- EQUATIONS IN FREE INVERSE MONOIDS
- Approximation in description logics: how weighted tree automata can help to define the required concept comparison measures in \(\mathcal {FL}_0\)
- Unification and Inference Rules in the Multi-modal Logic of Knowledge and Linear Time LTK
- Admissibility and unification in the modal logics related to S4.2
- Best unifiers in transitive modal logics
- Decision problems for systems of language equations and inequations
- Unification in the description logic \(\mathcal{ELH}_{\mathcal{R}^+}\) without the top concept modulo cycle-restricted ontologies
- Unification in linear temporal logic LTL
- Language equations with complementation: expressive power
- Temporal logic with accessibility temporal relations generated by time states themselves
- Unresolved systems of language equations: expressive power and decision problems
- Restricted unification in the DL \(\mathcal{FL}_0\)
- Language equations with complementation: decision problems
- Decision problems for language equations
This page was built for publication: Unification of concept terms in description logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5929707)
