From post

Reverse Engineering of Temporal Queries with and without LTL Ontologies: First Steps (Extended Abstract).

, , , , , и . Description Logics, том 3263 из CEUR Workshop Proceedings, CEUR-WS.org, (2022)

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.

 

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

Coalgebraic Semantics of Heavy-Weighted Automata., , и . WADT, том 9463 из Lecture Notes in Computer Science, стр. 48-68. Springer, (2014)Verification of Parameterized Communicating Automata via Split-Width., и . FoSSaCS, том 9634 из Lecture Notes in Computer Science, стр. 197-213. Springer, (2016)HyperLTL Satisfiability is Σ11-complete, HyperCTL* Satisfiability is Σ12-complete., , , и . CoRR, (2021)Reverse Engineering of Temporal Queries Mediated by LTL Ontologies., , , , , и . IJCAI, стр. 3230-3238. ijcai.org, (2023)HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete., , , и . MFCS, том 202 из LIPIcs, стр. 47:1-47:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Expressivité de la logique du premier ordre, de la logique dynamique propositionnelle sans étoile et des automates communicants. (Expressivity of first-order logic, star-free propositional dynamic logic and communicating automata).. University of Paris-Saclay, France, (2020)Reverse Engineering of Temporal Queries with and without LTL Ontologies: First Steps (Extended Abstract)., , , , , и . Description Logics, том 3263 из CEUR Workshop Proceedings, CEUR-WS.org, (2022)Unique Characterisability and Learnability of Temporal Instance Queries., , , , , и . KR, (2022)Interpolants and Explicit Definitions in Horn Description Logics (Extended Abstract)., , и . Description Logics, том 2954 из CEUR Workshop Proceedings, CEUR-WS.org, (2021)Interpolants and Explicit Definitions in Extensions of the Description Logic EL., , и . KR, (2022)