scientific article; zbMATH DE number 1149436

zbMATH Open0900.68397arXivcs/9406101MaRDI QIDQ4386959FDOQ4386959

Authors: A. Borgida, Peter F. Patel-Schneider 

Publication date: 10 May 1998

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

Title of this publication is not available (Why is that?)

Recommendations

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

Mathematics Subject Classification ID

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

Cited In (15)

• Unification of concept terms in description logics
• Title not available (Why is that?)
• The learnability of description logics with equality constraints
• Towards a Scalable Query Rewriting Algorithm in Presence of Value Constraints
• Classic learning
• Speeding up inferences using relevance reasoning: a formalism and algorithms
• Title not available (Why is that?)
• Exact learning of lightweight description logic ontologies
• EXPtime tableaux for ALC
• ``Reducing classic to practice: Knowledge representation theory meets reality
• Title not available (Why is that?)
• Algebraic tableau reasoning for the description logic \(\mathcal{SHOQ}\)
• Title not available (Why is that?)
• 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)