\(\mathcal{ALCQPI}_{R^+}\): rational grading in an expressive description logic with inverse and transitive roles and counting

DOI10.1134/S1995080220090322zbMath1492.68125OpenAlexW3104226853MaRDI QIDQ2211383

M. Yanchev

Publication date: 11 November 2020

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080220090322

zbMATH Keywords

complexitydescription logicsPSPACEpart restrictionsrational grading

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Attributive concept descriptions with complements
• The complexity of concept languages
• A new description logic with set constraints and cardinality constraints on role successors
• Relationships between nondeterministic and deterministic tape complexities
• In so many possible worlds
• Majority Digraphs
• Presburger Modal Logic Is PSPACE-Complete

This page was built for publication: \(\mathcal{ALCQPI}_{R^+}\): rational grading in an expressive description logic with inverse and transitive roles and counting