Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Isaque Macalam Saab Lima"'
Publikováno v:
LSFA
This work proposes a Dynamic Epistemic Logic with Communication Actions that can be performed concurrently. Unlike Concurrent Epistemic Action Logic introduced by Ditmarsch, Hoek and Kooi [van Ditmarsch, H., W. van der Hoek and B. Kooi, “Concurrent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::31c3b21644ca061fcc4ffbf52ccaa99f
https://doi.org/10.1016/j.entcs.2019.07.005
https://doi.org/10.1016/j.entcs.2019.07.005
Publikováno v:
Anais do Workshop Brasileiro de Lógica (WBL 2020).
This work proposes an extension of Dynamic Epistemic Logic with Communication Actions by adding the notion of postconditions from Dynamic Epistemic Logic with Assigments to deal with boolean assignments to action models. Other concurrent logics, like
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1abc2c707dac5ca565e12e8ecc42ebfa
https://doi.org/10.5753/wbl.2020.11455
https://doi.org/10.5753/wbl.2020.11455
Publikováno v:
Diagrammatic Representation and Inference ISBN: 9783319913759
Diagrams
Diagrams
We introduce a general approach, based on diagrams, to the specification and construction of model checkers. This approach gives general model checkers that can be instantiated to a model checker for a specific modal logic with semantics described by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2afca4be55975b601b517a17a7725f62
https://doi.org/10.1007/978-3-319-91376-6_60
https://doi.org/10.1007/978-3-319-91376-6_60
Publikováno v:
Computación y Sistemas. 21
This work proposes a extension of dynamic epistemic logic to work with assignment. The difference between this work and others works, such as [7], is the use of actions models, from DEL, to make Boolean assignments to the propositions, instead of cre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4fac6f9d23a33bd6719385c3b2740a1c
https://doi.org/10.13053/cys-21-3-2808
https://doi.org/10.13053/cys-21-3-2808
Publikováno v:
DCM
Electronic Proceedings in Theoretical Computer Science, Vol 144, Iss Proc. DCM 2013, Pp 73-84 (2014)
Electronic Proceedings in Theoretical Computer Science, Vol 144, Iss Proc. DCM 2013, Pp 73-84 (2014)
In this paper we describe an approach to resolve strategic games in which players can assume different types along the game. Our goal is to infer which type the opponent is adopting at each moment so that we can increase the player's odds. To achieve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bf97a4dbfb12790280f03f9c327b4b65