Author of the publication

A Tableaux System for Deontic Action Logic.

, and . DEON, volume 5076 of Lecture Notes in Computer Science, page 34-48. Springer, (2008)

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

Tractable Probabilistic mu-Calculus That Expresses Probabilistic Temporal Logics., , and . STACS, volume 30 of LIPIcs, page 211-223. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)A Complete and Compact Propositional Deontic Logic., and . ICTAC, volume 4711 of Lecture Notes in Computer Science, page 109-123. Springer, (2007)Characterizing Locality (Encapsulation) with Bisimulation., and . ICTAC, volume 6255 of Lecture Notes in Computer Science, page 322-336. Springer, (2010)Satisfiability Calculus: An Abstract Formulation of Semantic Proof Systems., , , and . Fundam. Informaticae, 166 (4): 297-347 (2019)Default Modal Systems as Algebraic Updates., , , and . DaLí, volume 12569 of Lecture Notes in Computer Science, page 103-119. Springer, (2020)Playing Against Fair Adversaries in Stochastic Games with Total Rewards., , , and . CAV (2), volume 13372 of Lecture Notes in Computer Science, page 48-69. Springer, (2022)Measuring Masking Fault-Tolerance., , , and . TACAS (2), volume 11428 of Lecture Notes in Computer Science, page 375-392. Springer, (2019)A Stochastic Game Approach to Masking Fault-Tolerance: Bisimulation and Quantification., , , and . CoRR, (2022)Deontic Action Logics via Algebra., , , and . DEON, page 77-93. College Publications, (2021)How Easy it is to Know How: An Upper Bound for the Satisfiability Problem., , , , and . JELIA, volume 14281 of Lecture Notes in Computer Science, page 405-419. Springer, (2023)