Approximate unification in the description logic FL₀
From MaRDI portal
Publication:2835862
Recommendations
Cites work
- scientific article; zbMATH DE number 3574390 (Why is no real title available?)
- scientific article; zbMATH DE number 1936671 (Why is no real title available?)
- scientific article; zbMATH DE number 1765664 (Why is no real title available?)
- A Framework for Semantic-Based Similarity Measures for $\mathcal{ELH}$ -Concepts
- Approximate unification in the description logic \(\mathcal {FL}_0\)
- Complexity of unification problems with associative-commutative operators
- On language equations with one-sided concatenation
- Proximity-based unification theory
- Unification in the description logic EL
- Unification of concept terms in description logics
Cited in
(7)- UEL: Unification Solver for the Description Logic $\mathcal{EL}$ – System Description
- Approximate unification in the description logic \(\mathcal {FL}_0\)
- Matching in the Description Logic FL0 with respect to General TBoxes
- Extensions of unification modulo ACUI
- Unification in a description logic with transitive closure of roles
- Efficient TBox Reasoning with Value Restrictions using the wer Reasoner
- Approximation in description logics: how weighted tree automata can help to define the required concept comparison measures in \(\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)