Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$ (Q5738984): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-53733-7_1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2588368184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding Threshold Concepts to the Description Logic $\mathcal{EL}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4406531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Unification in the Description Logic $$\mathcal {FL}_0$$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification in the Description Logic EL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification of concept terms in description logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5747087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata-based axiom pinpointing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Skew and infinitary formal power series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted automata and weighted logics with discounting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Similarity-based relaxed instance queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-standard inferences in description logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework for Semantic-Based Similarity Measures for $\mathcal{ELH}$ -Concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable approximate deduction for OWL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3515223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of the unification and admissibility problems for modal and description logics / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:30, 13 July 2024

scientific article; zbMATH DE number 6725124
Language Label Description Also known as
English
Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$
scientific article; zbMATH DE number 6725124

    Statements

    Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$ (English)
    0 references
    0 references
    0 references
    0 references
    1 June 2017
    0 references

    Identifiers