Author of the publication

Model Checking and Validity in Propositional and Modal Inclusion Logics.

, , , and . MFCS, volume 83 of LIPIcs, page 32:1-32:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Descriptive complexity of real computation and probabilistic independence logic., , , and . LICS, page 550-563. ACM, (2020)Logics with Probabilistic Team Semantics and the Boolean Negation., , , , , and . JELIA, volume 14281 of Lecture Notes in Computer Science, page 665-680. Springer, (2023)A Remark on the Expressivity of Asynchronous TeamLTL and HyperLTL., , and . CoRR, (2024)On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic., , , and . CSL, volume 183 of LIPIcs, page 27:1-27:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Model Checking and Validity in Propositional and Modal Inclusion Logics., , , and . MFCS, volume 83 of LIPIcs, page 32:1-32:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals., and . CoRR, (2020)Descriptive Complexity of Deterministic Polylogarithmic Time., , , , and . WoLLIC, volume 11541 of Lecture Notes in Computer Science, page 208-222. Springer, (2019)Complexity of Propositional Independence and Inclusion Logic., , , and . MFCS (1), volume 9234 of Lecture Notes in Computer Science, page 269-280. Springer, (2015)Strongly Complete Axiomatization for a Logic with Probabilistic Interventionist Counterfactuals., and . JELIA, volume 14281 of Lecture Notes in Computer Science, page 649-664. Springer, (2023)Approximation and Dependence via Multiteam Semantics., , , , and . FoIKS, volume 9616 of Lecture Notes in Computer Science, page 271-291. Springer, (2016)