Unification of concept terms in description logics
From MaRDI portal
Publication:5929707
DOI10.1006/jsco.2000.0426zbMath0970.68166OpenAlexW2049209348WikidataQ57383725 ScholiaQ57383725MaRDI QIDQ5929707
Paliath Narendran, Franz Baader
Publication date: 16 April 2001
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/aa3b69cff35be1fd61aa212216e5f04e45462729
Related Items
Restricted unification in the DL \(\mathcal{FL}_0\) ⋮ About the unification type of \(\mathbf{K}+\square \square \bot\) ⋮ Deciding unifiability and computing local unifiers in the description logic \(\mathcal{EL}\) without top constructor ⋮ Multi-Agents’ Temporal Logic using Operations of Static Agents’ Knowledge ⋮ Filtering unification and most general unifiers in modal logic ⋮ Multi-agent logics with dynamic accessibly relations, projective unifiers ⋮ Language equations with complementation: decision problems ⋮ Equations over free inverse monoids with idempotent variables ⋮ Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\) ⋮ KD is nullary ⋮ Admissibility and unification in the modal logics related to S4.2 ⋮ Extending Unification in $\mathcal{EL}$ to Disunification: The Case of Dismatching and Local Disunification ⋮ Best unifiers in transitive modal logics ⋮ EQUATIONS IN FREE INVERSE MONOIDS ⋮ Extensions of unification modulo ACUI ⋮ Computational completeness of equations over sets of natural numbers ⋮ Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$ ⋮ Decision problems for language equations ⋮ Unification modulo ACUI plus distributivity axioms ⋮ Unification in linear temporal logic LTL ⋮ Unification in the Description Logic $\mathcal{EL}$ without the Top Concept ⋮ Unification in the Description Logic $\mathcal{EL}$ ⋮ Description Logics ⋮ Language equations with complementation: expressive power ⋮ Approximate Unification in the Description Logic $$\mathcal {FL}_0$$ ⋮ Language equations ⋮ Canonical rules ⋮ Temporal logic with accessibility temporal relations generated by time states themselves ⋮ Closure properties and decision problems of dag automata ⋮ Unification and Inference Rules in the Multi-modal Logic of Knowledge and Linear Time LTK ⋮ Decidability of trajectory-based equations ⋮ Unresolved systems of language equations: expressive power and decision problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unification in commutative theories
- Matching - a special case of unification?
- Attributive concept descriptions with complements
- The complexity of existential quantification in concept languages.
- Computational complexity of terminological reasoning in BACK
- Reasoning and revision in hybrid representation systems
- The KL-ONE family
- Haskell overloading is DEXPTIME-complete
- Cardinality restrictions on concepts
- Combination problems for commutative/monoidal theories or how algebra can help in equational unification
- Terminological reasoning is inherently intractable
- Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
- Matching in description logics
- Deduction in Concept Languages: from Subsumption to Instance Checking
- Incoherence and subsumption for recursive views and queries in object-oriented data models
- Some new decidability results on positive and negative set constraints
