Extending ALCQIO with trees

DOI10.1109/LICS.2015.54MaRDI QIDQ4635832zbMATH OpenFDO

Authors Mantas Šimkus, Helmut Veith, Florian Zuleger, Tomer Kotek

Publication date 23 April 2018

Published in 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/LICS.2015.54

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27)

Recommendations

• The complexity of finite model reasoning in description logics.
• The complexity of finite model reasoning in description logics
• Extending two-variable logic on trees
• Extending \({\mathcal A}{\mathcal L}{\mathcal C}{\mathcal Q}\) with bounded self-reference
• Generalized satisfiability for the description logic \(\mathcal{ALC}\)

Cited in

(1)

• The complexity of finite model reasoning in description logics.

This page was built for publication: Extending \(\mathcal{ALCQIO}\) with trees

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