Relevant bibliographies by topics / Arbitrary public announcement logic

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers
  5. Reports

Academic literature on the topic 'Arbitrary public announcement logic'

Author: Grafiati
Published: 8 June 2024
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Arbitrary public announcement logic.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Arbitrary public announcement logic"

1

Charrier, Tristan, Sophie Pinchinat, and FranÇois Schwarzentruber. "Symbolic model checking of public announcement protocols." Journal of Logic and Computation 29, no. 8 (2019): 1211–49. http://dx.doi.org/10.1093/logcom/exz023.

Full text
Abstract:
Abstract We study the symbolic model checking problem against public announcement protocol logic (PAPL), featuring protocols with public announcements, arbitrary public announcements and group announcements. Technically, symbolic models are Kripke models whose accessibility relations are presented as programs described in a dynamic logic style with propositional assignments. We highlight the relevance of such symbolic models and show that the symbolic model checking problem against PAPL is A$_{\textrm{pol}}$Exptime-complete as soon as announcement protocols allow for either arbitrary announcem
APA, Harvard, Vancouver, ISO, and other styles
2

BALBIANI, PHILIPPE, ALEXANDRU BALTAG, HANS VAN DITMARSCH, ANDREAS HERZIG, TOMOHIRO HOSHI, and TIAGO DE LIMA. "‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’." Review of Symbolic Logic 1, no. 3 (2008): 305–34. http://dx.doi.org/10.1017/s1755020308080210.

Full text
Abstract:
Public announcement logic is an extension of multiagent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. We propose an extension of public announcement logic with a dynamic modal operator that expresses what is true after any announcement: ⋄φ expresses that there is a truthful announcement ψ after which φ is true. This logic gives a perspective on Fitch's knowability issues: For which formulas φ, does it hold that φ → ⋄Kφ? We give various semantic results and show completeness for a Hilbert-style axiomatization of th
APA, Harvard, Vancouver, ISO, and other styles
3

Galimullin, Rustam, та Louwe B. Kuijer. "Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard". Electronic Proceedings in Theoretical Computer Science 379 (9 липня 2023): 260–71. http://dx.doi.org/10.4204/eptcs.379.21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Courtault, J. R., H. van Ditmarsch, and D. Galmiche. "A public announcement separation logic." Mathematical Structures in Computer Science 29, no. 06 (2019): 828–71. http://dx.doi.org/10.1017/s0960129518000348.

Full text
Abstract:
AbstractWe define a Public Announcement Separation Logic (PASL) that allows us to consider epistemic possible worlds as resources that can be shared or separated, in the spirit of separation logics. After studying its semantics and illustrating its interest for modelling systems, we provide a sound and complete tableau calculus that deals with resource, agent and announcement constraints and give also a countermodel extraction method.
APA, Harvard, Vancouver, ISO, and other styles
5

Balbiani, P., H. van Ditmarsch, A. Herzig, and T. de Lima. "Tableaux for Public Announcement Logic." Journal of Logic and Computation 20, no. 1 (2008): 55–76. http://dx.doi.org/10.1093/logcom/exn060.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Benevides, Mário, Alexandre Madeira, and Manuel A. Martins. "Graded epistemic logic with public announcement." Journal of Logical and Algebraic Methods in Programming 125 (February 2022): 100732. http://dx.doi.org/10.1016/j.jlamp.2021.100732.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Başkent, Can. "Public Announcement Logic in Geometric Frameworks." Fundamenta Informaticae 118, no. 3 (2012): 207–23. http://dx.doi.org/10.3233/fi-2012-710.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Wang, Yanjing, and Qinxiang Cao. "On axiomatizations of public announcement logic." Synthese 190, S1 (2013): 103–34. http://dx.doi.org/10.1007/s11229-012-0233-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

FRANCO, ANDRÉS CORDÓN, HANS VAN DITMARSCH, and ANGEL NEPOMUCENO. "DYNAMIC CONSEQUENCE AND PUBLIC ANNOUNCEMENT." Review of Symbolic Logic 6, no. 4 (2013): 659–79. http://dx.doi.org/10.1017/s1755020313000294.

Full text
Abstract:
AbstractIn van Benthem (2008), van Benthem proposes a dynamic consequence relation defined as ${\psi _1}, \ldots ,{\psi _n}{ \models ^d}\phi \,{\rm{iff}}{ \models ^{pa}}[{\psi _1}] \ldots [{\psi _n}]\phi ,$ where the latter denotes consequence in public announcement logic, a dynamic epistemic logic. In this paper we investigate the structural properties of a conditional dynamic consequence relation $\models _{\rm{\Gamma }}^d$ extending van Benthem’s proposal. It takes into account a set of background conditions Γ, inspired by Makinson (2003) wherein Makinson calls this reasoning ‘modulo’ a set
APA, Harvard, Vancouver, ISO, and other styles
10

Mohd Nasir, Muhammad Farhan, Wan Ainun Mior Othman, and Kok Bin Wong. "Labelled Natural Deduction for Public Announcement Logic with Common Knowledge." Mathematics 8, no. 4 (2020): 626. http://dx.doi.org/10.3390/math8040626.

Full text
Abstract:
Public announcement logic is a logic that studies epistemic updates. In this paper, we propose a sound and complete labelled natural deduction system for public announcement logic with the common knowledge operator (PAC). The completeness of the proposed system is proved indirectly through a Hilbert calculus for PAC known to be complete and sound. We conclude with several discussions regarding the system including some problems of the system in attaining normalisation and subformula property.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Arbitrary public announcement logic"

1

Liu, Mo. "Dynamic Epistemic Logic with Quantification And Normative Systems." Electronic Thesis or Diss., Université de Lorraine, 2023. http://www.theses.fr/2023LORR0077.

Full text
Abstract:
Nous vivons dans un monde où l'information est constamment mise à jour. Les logiques dotées d'opérateurs dynamiques sont capables de raisonner sur les changements d'information multi-agents. La logique épistémique dynamique est la logique du changement de connaissances. Par exemple, dans la logique de l'annonce publique, une annonce restreint le domaine aux états où elle est vraie pour représenter les conséquences du changement de connaissances. Une généralisation de la logique épistémique dynamique est l'extension avec quantification. Elle comble un fossé intéressant entre la logique modale p
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
Abstract:
Le projet de cette thèse émane du constat d'une scission entre épistémologie d'une part et logique épistémique d'autre part. Si des tentatives de conciliation se sont avérées fructueuses, nous explorons ici la possibilité d'une réconciliation entre épistémologie et logique épistémique à travers l'argumentation.Étudier la logique épistémique au sein d'une pratique argumentative, c'est-À-Dire au sein de dialogues, nous permet de bénéficier d'un cadre d'étude dynamique pour explorer le dynamisme et la signification du langage de la logique épistémique. Nous montrons que cette conciliation de l'ép
APA, Harvard, Vancouver, ISO, and other styles
3

Pivoňková, Martina. "Dynamické epistemické logiky." Master's thesis, 2012. http://www.nusl.cz/ntk/nusl-310484.

Full text
Abstract:
In this thesis we will deal with the logic of public announcement which is a dynamic extension of epistemic logic. First we will explain the logic of truthful public announcement for the multiagent S5 system. Then we will examine what the public announcement can look like in systems weaker than S5. We will focus namely on systems in which the T axiom is invalid and the epistemic modality is interpreted not as a "knowledge" but as a "belief". We will create new semantics of public announcement which is not necessarily truthful but it is believed to be true. We will also try to axiomatize system
APA, Harvard, Vancouver, ISO, and other styles
4

Kuncová, Alexandra. "Generický přístup ke změně nejistoty s důrazem na kondicionalizaci." Master's thesis, 2016. http://www.nusl.cz/ntk/nusl-350578.

Full text
Abstract:
First, we consider different kinds of representation of uncertainty and the meth- ods for updating each of them by conditioning. We focus on the generic frame- work of (conditional) plausibility spaces, since it generalises all the introduced representations. Further, we select three frameworks and list the properties that need to be added to a conditional plausibility space in order to recover each of these frameworks. The main goal of this work, however, is to show how public announcement on single-agent plausibility models, ranking structures, and pos- sibility structures realised by their
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Arbitrary public announcement logic"

1

Kuijer, Louwe Bouke. "How Arbitrary Are Arbitrary Public Announcements?" In Pristine Perspectives on Logic, Language, and Computation. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44116-9_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Charrier, Tristan, Sophie Pinchinat, and 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. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-73579-5_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Xiong, Zuojun, and Thomas Ågotnes. "Arbitrary Propositional Network Announcement Logic." In Lecture Notes in Computer Science. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-65840-3_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cabrer, Leonardo, Umberto Rivieccio, and Ricardo Oscar Rodriguez. "Łukasiewicz Public Announcement Logic." In Information Processing and Management of Uncertainty in Knowledge-Based Systems. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-40581-0_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wáng, Yì N., and Thomas Ågotnes. "Subset Space Public Announcement Logic." In Logic and Its Applications. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36039-8_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Reiche, Sebastian, and Christoph Benzmüller. "Public Announcement Logic in HOL." In Lecture Notes in Computer Science. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-65840-3_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wáng, Yì N., and Thomas Ågotnes. "Public Announcement Logic with Distributed Knowledge." In Logic, Rationality, and Interaction. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24130-7_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ma, Minghui, Katsuhiko Sano, François Schwarzentruber, and Fernando R. Velázquez-Quesada. "Tableaux for Non-normal Public Announcement Logic." In Logic and Its Applications. Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-45824-2_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Demey, Lorenz. "Structures of Oppositions in Public Announcement Logic." In Around and Beyond the Square of Opposition. Springer Basel, 2012. http://dx.doi.org/10.1007/978-3-0348-0379-3_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Sadrzadeh, Mehrnoosh, Alessandra Palmigiano, and Minghui Ma. "Algebraic Semantics and Model Completeness for Intuitionistic Public Announcement Logic." In Logic, Rationality, and Interaction. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24130-7_34.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Arbitrary public announcement logic"

1

Herzig, Andreas, and Antonio Yuste Ginel. "Multi-Agent Abstract Argumentation Frameworks With Incomplete Knowledge of Attacks." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/265.

Full text
Abstract:
We introduce a multi-agent, dynamic extension of abstract argumentation frameworks (AFs), strongly inspired by epistemic logic, where agents have only partial information about the conflicts between arguments. These frameworks can be used to model a variety of situations. For instance, those in which agents have bounded logical resources and therefore fail to spot some of the actual attacks, or those where some arguments are not explicitly and fully stated (enthymematic argumentation). Moreover, we include second-order knowledge and common knowledge of the attack relation in our structures (wh
APA, Harvard, Vancouver, ISO, and other styles
2

Lutz, Carsten. "Complexity and succinctness of public announcement logic." In the fifth international joint conference. ACM Press, 2006. http://dx.doi.org/10.1145/1160633.1160657.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chakraborty, Sourav, Avijeet Ghosh, Sujata Ghosh, and 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}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/kr.2023/14.

Full text
Abstract:
Public observation logic (POL) reasons about agent expectations and agent observations in various real world situations. The expectations of agents take shape based on certain protocols about the world around and they remove those possible scenarios where their exceptions and observations do not match. This in turn influences the epistemic reasoning of these agents. In this work, we study the computational complexity of the satisfaction problems of various fragments of POL. In the process, we also highlight the inevitable link that these fragments have with the well-studied Public announcement
APA, Harvard, Vancouver, ISO, and other styles
4

Huang, Xiao, Biqing Fang, Hai Wan, and Yongmei Liu. "A General Multi-agent Epistemic Planner Based on Higher-order Belief Change." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/152.

Full text
Abstract:
In recent years, multi-agent epistemic planning has received attention from both dynamic logic and planning communities. Existing implementations of multi-agent epistemic planning are based on compilation into classical planning and suffer from various limitations, such as generating only linear plans, restriction to public actions, and incapability to handle disjunctive beliefs. In this paper, we propose a general representation language for multi-agent epistemic planning where the initial KB and the goal, the preconditions and effects of actions can be arbitrary multi-agent epistemic formula
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Arbitrary public announcement logic"

1

Lutz, Carsten. Complexity and Succinctness of Public Announcement Logic. Technische Universität Dresden, 2005. http://dx.doi.org/10.25368/2022.152.

Full text
Abstract:
There is a recent trend of extending epistemic logic (EL) with dynamic operators that allow to express the evolution of knowledge and belief induced by knowledge-changing actions. The most basic such extension is public announcement logic (PAL), which is obtained from EL by adding an operator for truthful publix announcements. In this paper, we consider the computational complexity of PAL and show that it coincides with that of EL. This holds in the single- and multi-agent case, and also in the presence of common knowledge operators. We also prove that there are properties that can be expresse
APA, Harvard, Vancouver, ISO, and other styles
2

Ocampo-Gaviria, José Antonio, Roberto Steiner Sampedro, Mauricio Villamizar Villegas, et al. Report of the Board of Directors to the Congress of Colombia - March 2023. Banco de la República de Colombia, 2023. http://dx.doi.org/10.32468/inf-jun-dir-con-rep-eng.03-2023.

Full text
Abstract:
Banco de la República is celebrating its 100th anniversary in 2023. This is a very significant anniversary and one that provides an opportunity to highlight the contribution the Bank has made to the country’s development. Its track record as guarantor of monetary stability has established it as the one independent state institution that generates the greatest confidence among Colombians due to its transparency, management capabilities, and effective compliance with the central banking and cultural responsibilities entrusted to it by the Constitution and the Law. On a date as important as this,
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Arbitrary public announcement logic' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography