Non-standard inferences in description logics

DOI10.1007/3-540-44613-3zbMath0983.03026MaRDI QIDQ5940719

Ralf Küsters

Publication date: 20 August 2001

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-44613-3

zbMATH Keywords

knowledge representation; description logic; generating new concepts; inference; instance problem; knowledge representation languages; matching concept patterns; subsumption problem

Mathematics Subject Classification ID

68T27: Logic in artificial intelligence

03B42: Logics of knowledge and belief (including belief change)

68T30: Knowledge representation

03-02: Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations

03B70: Logic in computer science

68-02: Research exposition (monographs, survey articles) pertaining to computer science

Related Items

Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$, Structural subsumption and least common subsumers in a description logic with existential and number restrictions, Computing optimal repairs of quantified ABoxes w.r.t. static \(\mathcal{EL}\) TBoxes, Computing the least common subsumer w.r.t. a background terminology, Adding Threshold Concepts to the Description Logic $\mathcal{EL}$, Matching in Hybrid Terminologies, Unification in the Description Logic $\mathcal{EL}$, Towards a Scalable Query Rewriting Algorithm in Presence of Value Constraints