scientific article; zbMATH DE number 1424042
From MaRDI portal
zbMATH Open0944.03024MaRDI QIDQ4945232FDOQ4945232
Publication date: 23 March 2000
Title of this publication is not available (Why is that?)
complexitydescription logicexpressivityexpressive powertwo-variable fragment of predicate logic with counting quantifiers
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 (3)
Recommendations
- Title not available (Why is that?) π π
- 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\) π π
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)