Literatura científica selecionada sobre o tema "Arbitrary public announcement logic"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Índice
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Arbitrary public announcement logic".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Arbitrary public announcement logic"
Charrier, Tristan, Sophie Pinchinat e FranÇois Schwarzentruber. "Symbolic model checking of public announcement protocols". Journal of Logic and Computation 29, n.º 8 (dezembro de 2019): 1211–49. http://dx.doi.org/10.1093/logcom/exz023.
Texto completo da fonteBALBIANI, PHILIPPE, ALEXANDRU BALTAG, HANS VAN DITMARSCH, ANDREAS HERZIG, TOMOHIRO HOSHI e TIAGO DE LIMA. "‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’". Review of Symbolic Logic 1, n.º 3 (outubro de 2008): 305–34. http://dx.doi.org/10.1017/s1755020308080210.
Texto completo da fonteGalimullin, Rustam, e Louwe B. Kuijer. "Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard". Electronic Proceedings in Theoretical Computer Science 379 (9 de julho de 2023): 260–71. http://dx.doi.org/10.4204/eptcs.379.21.
Texto completo da fonteCourtault, J. R., H. van Ditmarsch e D. Galmiche. "A public announcement separation logic". Mathematical Structures in Computer Science 29, n.º 06 (15 de abril de 2019): 828–71. http://dx.doi.org/10.1017/s0960129518000348.
Texto completo da fonteBalbiani, P., H. van Ditmarsch, A. Herzig e T. de Lima. "Tableaux for Public Announcement Logic". Journal of Logic and Computation 20, n.º 1 (21 de novembro de 2008): 55–76. http://dx.doi.org/10.1093/logcom/exn060.
Texto completo da fonteBenevides, Mário, Alexandre Madeira e Manuel A. Martins. "Graded epistemic logic with public announcement". Journal of Logical and Algebraic Methods in Programming 125 (fevereiro de 2022): 100732. http://dx.doi.org/10.1016/j.jlamp.2021.100732.
Texto completo da fonteBaşkent, Can. "Public Announcement Logic in Geometric Frameworks". Fundamenta Informaticae 118, n.º 3 (2012): 207–23. http://dx.doi.org/10.3233/fi-2012-710.
Texto completo da fonteWang, Yanjing, e Qinxiang Cao. "On axiomatizations of public announcement logic". Synthese 190, S1 (5 de janeiro de 2013): 103–34. http://dx.doi.org/10.1007/s11229-012-0233-5.
Texto completo da fonteFRANCO, ANDRÉS CORDÓN, HANS VAN DITMARSCH e ANGEL NEPOMUCENO. "DYNAMIC CONSEQUENCE AND PUBLIC ANNOUNCEMENT". Review of Symbolic Logic 6, n.º 4 (14 de outubro de 2013): 659–79. http://dx.doi.org/10.1017/s1755020313000294.
Texto completo da fonteMohd Nasir, Muhammad Farhan, Wan Ainun Mior Othman e Kok Bin Wong. "Labelled Natural Deduction for Public Announcement Logic with Common Knowledge". Mathematics 8, n.º 4 (18 de abril de 2020): 626. http://dx.doi.org/10.3390/math8040626.
Texto completo da fonteTeses / dissertações sobre o assunto "Arbitrary public announcement logic"
Liu, Mo. "Dynamic Epistemic Logic with Quantification And Normative Systems". Electronic Thesis or Diss., Université de Lorraine, 2023. http://www.theses.fr/2023LORR0077.
Texto completo da fonteWe live in a world where information is constantly being updated. Logics with dynamic operators are capable of reasoning about multi-agent information change. Dynamic epistemic logic is the logic of knowledge change. For example, in public announcement logic, an announcement restricts the domain to states where it is true to represent the consequences of knowledge change. A generalization of dynamic epistemic logic is the extension with quantification. It bridges an interesting gap between propositional modal logic and first-order logic in expressivity and decidability. Arbitrary public announcement logic extends public announcement logic by adding quantification over all announcements. It is more expressive than modal logics and public announcement logic, but undecidable. In this thesis, we propose some novel versions of arbitrary public announcement logic. Firstly, we can restrict the quantification from over all announcements to over subsets of them. To be specific, the announcements involved could use only a subset of all propositional variables or implied or implying a given formula. Even though these variants of arbitrary public announcement logic are still undecidable, we show there is an interesting hierarchy of relative expressivity of them. Another approach is based on the idea of packing operators together. Packed operators represent more complex notions and also restrict the expressivity of languages. The notion of "knowability'' can be interpreted as "there is a possible information change after which the agent knows something''. It is natural to represent by the package of a quantified dynamic operator and a epistemic operator. In this thesis, we propose logics of knowability using such packed operators. We show that if there is no restriction on announcements, then the logic of knowability is more expressive than public announcement logic, but undecidable; if we only quantify over boolean announcements, then the logic has the same expressivity as propositional modal logic. Besides the extension with quantification, in this thesis, we also combine dynamic epistemic logic with normative system. Arrow update logic contains modalities that specify which relations should be preserved after updating by source and target conditions. It is designed to reason about multi-agent belief change. We can also use it to represent the notion of "norm'' which regulates behaviors of agents in a consequential way. We propose normative arrow update logic which combines arrow update logic and normative temporal logic. It also concludes additive, multiplicative and sequential combination of norms. Normative arrow update logic can distinguish between static and dynamic ways to consider norms as dynamic epistemic logic. We show its relative expressivity with other related logics, its decidability, and complexity
Magnier, Sébastien. "Considérations dialogiques autour de la dynamique épistémique et de la notion de condition dans le droit". Thesis, Lille 3, 2013. http://www.theses.fr/2013LIL30039.
Texto completo da fonteThe project of this thesis stems from the observation of a split between epistemology and epistemic logic.If some attempts at conciliation have been successful, here we explore the possibility of reconciliation between epistemology and epistemic logic through argumentation.Studying epistemic logic in argumentative practice, that is to say in dialogues, enables us to benefit from a dynamic framework to explore the dynamics and the meaning of the language of epistemic logic.We show that this reconciliation of epistemology and epistemic logic in an argumentative practice is relevant in the legal field because it offers an original approach to the notion of condition in law
Pivoňková, Martina. "Dynamické epistemické logiky". Master's thesis, 2012. http://www.nusl.cz/ntk/nusl-310484.
Texto completo da fonteKuncová, Alexandra. "Generický přístup ke změně nejistoty s důrazem na kondicionalizaci". Master's thesis, 2016. http://www.nusl.cz/ntk/nusl-350578.
Texto completo da fonteCapítulos de livros sobre o assunto "Arbitrary public announcement logic"
Kuijer, Louwe Bouke. "How Arbitrary Are Arbitrary Public Announcements?" In Pristine Perspectives on Logic, Language, and Computation, 109–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44116-9_8.
Texto completo da fonteCharrier, Tristan, Sophie Pinchinat e François Schwarzentruber. "Model Checking Against Arbitrary Public Announcement Logic: A First-Order-Logic Prover Approach for the Existential Fragment". In Lecture Notes in Computer Science, 133–52. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-73579-5_9.
Texto completo da fonteXiong, Zuojun, e Thomas Ågotnes. "Arbitrary Propositional Network Announcement Logic". In Lecture Notes in Computer Science, 277–93. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-65840-3_17.
Texto completo da fonteCabrer, Leonardo, Umberto Rivieccio e Ricardo Oscar Rodriguez. "Łukasiewicz Public Announcement Logic". In Information Processing and Management of Uncertainty in Knowledge-Based Systems, 108–22. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-40581-0_10.
Texto completo da fonteWáng, Yì N., e Thomas Ågotnes. "Subset Space Public Announcement Logic". In Logic and Its Applications, 245–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36039-8_22.
Texto completo da fonteReiche, Sebastian, e Christoph Benzmüller. "Public Announcement Logic in HOL". In Lecture Notes in Computer Science, 222–38. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-65840-3_14.
Texto completo da fonteWáng, Yì N., e Thomas Ågotnes. "Public Announcement Logic with Distributed Knowledge". In Logic, Rationality, and Interaction, 328–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24130-7_24.
Texto completo da fonteMa, Minghui, Katsuhiko Sano, François Schwarzentruber e Fernando R. Velázquez-Quesada. "Tableaux for Non-normal Public Announcement Logic". In Logic and Its Applications, 132–45. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-45824-2_9.
Texto completo da fonteDemey, Lorenz. "Structures of Oppositions in Public Announcement Logic". In Around and Beyond the Square of Opposition, 313–39. Basel: Springer Basel, 2012. http://dx.doi.org/10.1007/978-3-0348-0379-3_22.
Texto completo da fonteSadrzadeh, Mehrnoosh, Alessandra Palmigiano e Minghui Ma. "Algebraic Semantics and Model Completeness for Intuitionistic Public Announcement Logic". In Logic, Rationality, and Interaction, 394–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24130-7_34.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Arbitrary public announcement logic"
Herzig, Andreas, e Antonio Yuste Ginel. "Multi-Agent Abstract Argumentation Frameworks With Incomplete Knowledge of Attacks". In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/265.
Texto completo da fonteLutz, Carsten. "Complexity and succinctness of public announcement logic". In the fifth international joint conference. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1160633.1160657.
Texto completo da fonteChakraborty, Sourav, Avijeet Ghosh, Sujata Ghosh e François Schwarzentruber. "On Simple Expectations and Observations of Intelligent Agents: A Complexity Study". In 20th International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/kr.2023/14.
Texto completo da fonteHuang, Xiao, Biqing Fang, Hai Wan e Yongmei Liu. "A General Multi-agent Epistemic Planner Based on Higher-order Belief Change". In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/152.
Texto completo da fonteRelatórios de organizações sobre o assunto "Arbitrary public announcement logic"
Lutz, Carsten. Complexity and Succinctness of Public Announcement Logic. Technische Universität Dresden, 2005. http://dx.doi.org/10.25368/2022.152.
Texto completo da fonte