scientific article; zbMATH DE number 1149436

MaRDI QIDQ4386959zbMATH OpenFDO

Authors A. Borgida, Peter F. Patel-Schneider

Publication date 10 May 1998

Full work available at URL https://arxiv.org/abs/cs/9406101

Mathematics Subject Classification ID

Knowledge representation (68T30) Parallel algorithms in computer science (68W10) Semantics in the theory of computing (68Q55)

Recommendations

• Publication:4938424
• Practical reasoning for very expressive description logics
• An overview of tableau algorithms for description logics

Cited in

(15)

• Unification of concept terms in description logics
• The learnability of description logics with equality constraints
• scientific article; zbMATH DE number 1405450 (Why is no real title available?)
• Towards a Scalable Query Rewriting Algorithm in Presence of Value Constraints
• Classic learning
• Speeding up inferences using relevance reasoning: a formalism and algorithms
• scientific article; zbMATH DE number 140374 (Why is no real title available?)
• EXPtime tableaux for ALC
• Exact learning of lightweight description logic ontologies
• ``Reducing classic to practice: Knowledge representation theory meets reality
• scientific article; zbMATH DE number 870410 (Why is no real title available?)
• Algebraic tableau reasoning for the description logic \(\mathcal{SHOQ}\)
• scientific article; zbMATH DE number 7234173 (Why is no real title available?)
• Planning from second principles
• AI*IA 2003: Advances in Artificial Intelligence

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4386959)