Approximate unification in the description logic FL₀
From MaRDI portal
Publication:2835862
DOI10.1007/978-3-319-48758-8_4zbMATH Open1483.68364OpenAlexW2546288571MaRDI QIDQ2835862FDOQ2835862
Authors: Franz Baader, Pavlos Marantidis, Alexander Okhotin 
Publication date: 30 November 2016
Published in: Logics in Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-48758-8_4
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity of unification problems with associative-commutative operators
- Unification in the description logic EL
- Unification of concept terms in description logics
- Title not available (Why is that?)
- Proximity-based unification theory
- Title not available (Why is that?)
- A Framework for Semantic-Based Similarity Measures for $\mathcal{ELH}$ -Concepts
- Approximate Unification in the Description Logic $$\mathcal {FL}_0$$
Cited In (7)
- Efficient TBox Reasoning with Value Restrictions using the wer Reasoner
- Matching in the Description Logic FL0 with respect to General TBoxes
- UEL: Unification Solver for the Description Logic $\mathcal{EL}$ – System Description
- Unification in a description logic with transitive closure of roles
- Extensions of unification modulo ACUI
- Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$
- Approximate Unification in the Description Logic $$\mathcal {FL}_0$$
This page was built for publication: Approximate unification in the description logic \(\mathcal {FL}_0\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835862)
