From post

Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints.

, , и . ECAI, том 325 из Frontiers in Artificial Intelligence and Applications, стр. 616-623. IOS Press, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

The One-Variable Logic Meets Presburger Arithmetic.. CoRR, (2018)Order-Invariance of Two-Variable Logic is coNExpTime-complete.. CoRR, (2022)Completing the Picture: Complexity of Graded Modal Logics with Converse., , и . Theory Pract. Log. Program., 21 (4): 493-520 (2021)Data Complexity in Expressive Description Logics With Path Expressions.. CoRR, (2024)All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs., , и . IJCAI, стр. 1719-1725. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..A Framework for Reasoning about Dynamic Axioms in Description Logics., , и . IJCAI, стр. 1681-1687. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..A Note on C² Interpreted over Finite Data-Words., и . TIME, том 178 из LIPIcs, стр. 17:1-17:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Data Complexity in Expressive Description Logics With Path Expressions (Extended Abstract).. Description Logics, том 3739 из CEUR Workshop Proceedings, CEUR-WS.org, (2024)On the Limits of Decision: the Adjacent Fragment of First-Order Logic., , и . CoRR, (2023)Extending Two-Variable Logic on Trees., , и . CoRR, (2016)