Up a level |
Fortin, Marie, Kuijer, Louwe B, Totzke, Patrick ORCID: 0000-0001-5274-8190 and Zimmermann, Martin
(2021)
HyperLTL Satisfiability is $Σ_1^1$-complete, HyperCTL*
Satisfiability is $Σ_1^2$-complete.
Leibniz International Proceedings in Informatics, LIPIcs, 202.
Kuijer, Louwe ORCID: 0000-0001-6696-9023, Fortin, Marie, Totzke, Patrick ORCID: 0000-0001-5274-8190 and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2021)
HyperLTL Satisfiability is Σ11-complete, HyperCTL* Satisfiability is Σ21-complete.
In: Mathematical Foundations of Computer Science, 2021-8-23 - 2021-8-27, Tallinn.
Fortin, Marie, Konev, Boris ORCID: 0000-0002-6507-0494 and Wolter, Frank ORCID: 0000-0002-4470-606X
(2022)
Interpolants and Explicit Definitions in Extensions of the Description Logic EL.
In: 19th International Conference on Principles of Knowledge Representation and Reasoning {KR-2022}, 2022-7-31 - 2022-8-5.
Fortin, Marie, Konev, Boris ORCID: 0000-0002-6507-0494 and Wolter, Frank
(2022)
Interpolants and Explicit Definitions in Extensions of the Description
Logic EL.
[Preprint]
Fortin, Marie, Konev, Boris ORCID: 0000-0002-6507-0494 and Wolter, Frank ORCID: 0000-0002-4470-606X
(2021)
Interpolants and Explicit Definitions in Horn Description Logics (Extended Abstract).
In: 34th International Workshop on Description Logics, 2021-9-19 - 2021-9-21, Bratislava.
Fortin, Marie, Konev, Boris ORCID: 0000-0002-6507-0494, Ryzhikov, Vladislav, Savateev, Yury, Wolter, Frank ORCID: 0000-0002-4470-606X and Zakharyaschev, Michael
(2022)
Unique Characterisability and Learnability of Temporal Instance Queries.
In: 19th International Conference on Principles of Knowledge Representation and Reasoning {KR-2022}, 2022-7-31 - 2022-8-5.
Fortin, Marie, Konev, Boris ORCID: 0000-0002-6507-0494, Ryzhikov, Vladislav, Savateev, Yury, Wolter, Frank and Zakharyaschev, Michael
(2022)
Unique Characterisability and Learnability of Temporal Instance Queries.
[Preprint]