Non-standard inferences in description logics

DOI10.1007/3-540-44613-3zbMath0983.03026OpenAlexW1538297965MaRDI 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 representationdescription logicgenerating new conceptsinferenceinstance problemknowledge representation languagesmatching concept patternssubsumption problem

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Knowledge representation (68T30) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Logic in computer science (03B70) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items

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