The complexity of finite model reasoning in description logics.

DOI10.1007/B11829MaRDI QIDQ5900710zbMATH OpenOpenAlexFDO

Authors Carsten Lutz, Ulrike Sattler, Lidia Tendera

Publication date 20 April 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11829

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27)

Recommendations

• The complexity of finite model reasoning in description logics
• scientific article; zbMATH DE number 1448975
• scientific article; zbMATH DE number 1424042
• On the complexity of (restricted) \(\mathcal{ALCI}r\)
• Extending \(\mathcal{ALCQIO}\) with trees

Cited in

(9)

• On the expressive power of description logics with cardinality constraints on finite and infinite sets
• \(\mathcal{ALCQPI}_{R^+}\): rational grading in an expressive description logic with inverse and transitive roles and counting
• The complexity of finite model reasoning in description logics
• On the complexity of (restricted) \(\mathcal{ALCI}r\)
• Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
• Exploring Finite Models in the Description Logic ${\mathcal {EL}}_{\rm gfp}$
• Extending \(\mathcal{ALCQIO}\) with trees
• scientific article; zbMATH DE number 1424042 (Why is no real title available?)
• scientific article; zbMATH DE number 1448975 (Why is no real title available?)

This page was built for publication: The complexity of finite model reasoning in description logics.

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