scientific article; zbMATH DE number 1424042

zbMATH Open0944.03024MaRDI QIDQ4945232FDOQ4945232

Authors: Stephan Tobies 

Publication date: 23 March 2000

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

Recommendations

• scientific article; zbMATH DE number 1448975
• The complexity of finite model reasoning in description logics
• The complexity of finite model reasoning in description logics.
• The Complexity of Conjunctive Query Answering in Expressive Description Logics
• On the complexity of (restricted) \(\mathcal{ALCI}r\)

zbMATH Keywords

complexitydescription logicexpressivityexpressive powertwo-variable fragment of predicate logic with counting quantifiers

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic in artificial intelligence (68T27) Subsystems of classical logic (including intuitionistic logic) (03B20) Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (5)

• Actions over core-closed knowledge bases
• The complexity of finite model reasoning in description logics.
• A description logic based situation calculus
• Extending \({\mathcal A}{\mathcal L}{\mathcal C}{\mathcal Q}\) with bounded self-reference
• The complexity of finite model reasoning in description logics

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 Q4945232)