Zobrazeno 1 - 10
of 387
pro vyhledávání: '"F. Benevides"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Mario R. F. Benevides, Vitor Machado
Publikováno v:
LSFA
Populational Announcement Logic (PPAL), is a variant of the standard Public Announcement Logic (PAL) with a fuzzy-inspired semantics, where instead of specific agents we have populations and groups. The semantics and the announcement logic are define
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef646ff2f099d6f6f9d8357255d03c8e
https://doi.org/10.1016/j.entcs.2020.02.007
https://doi.org/10.1016/j.entcs.2020.02.007
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
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:
Fundamentals of Software Engineering ISBN: 9783030892463
FSEN
FSEN
Dynamic Epistemic Logic (DEL) is used in the analysis of a wide class of application scenarios involving multi-agents systems with local perceptions of information and knowledge. In its classical form, the knowledge of epistemic states is represented
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5016f5c6fa8a1c4318101405f5a626dd
http://hdl.handle.net/10773/32935
http://hdl.handle.net/10773/32935
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:
Anais do Workshop Brasileiro de Lógica (WBL 2020).
This paper presents an on going work on Propositional Dynamic Logic PDL in which atomic programs are STRIPS actions. We think that this new framework is appropriate to reasoning about actions and plans when dealing with planning problem. Unlike, PDL
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e8b755b0c28fc16028f181bb51ab9fd7
https://doi.org/10.5753/wbl.2020.11454
https://doi.org/10.5753/wbl.2020.11454
Publikováno v:
Theoretical Computer Science. 744:22-36
This work extends our previous work [4] , [22] with the iteration operator. This new operator allows for representing more general networks and thus enhancing the former propositional logic for Petri nets. We provide an axiomatization and a new seman
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3229668b3cca6087771eb151214707ca
https://doi.org/10.1016/j.tcs.2018.01.007
https://doi.org/10.1016/j.tcs.2018.01.007
Publikováno v:
LSFA
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Multi-Agent Epistemic Logic has been investigated in Computer Science [Fagin, R., J. Halpern, Y. Moses and M. Vardi, “Reasoning about Knowledge,” MIT Press, USA, 1995] to represent and reason about agents or groups of agents knowledge and beliefs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f7bae9e7057a418b4f637863c368dafb
https://doi.org/10.1016/j.entcs.2018.10.004
https://doi.org/10.1016/j.entcs.2018.10.004
Publikováno v:
Theoretical Computer Science. 685:83-103
We present a sound and complete graph calculus for modalities. This calculus is a general framework for expressing modal formulas and frame properties, with a rich repertoire of relations, and reasoning about them in a uniform manner. The calculus em
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a344ebdf1d588bfc77fee10c9fd5e517
https://doi.org/10.1016/j.tcs.2016.11.037
https://doi.org/10.1016/j.tcs.2016.11.037