Bibliografie tematiche / Arbitrary public announcement logic

Letteratura scientifica selezionata sul tema "Arbitrary public announcement logic"

Autore: Grafiati

Pubblicato: 8 giugno 2024

Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili

Scegli il tipo di fonte:

Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al tema "Arbitrary public announcement logic".

Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.

Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.

Articoli di riviste sul tema "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 (dicembre 2019): 1211–49. http://dx.doi.org/10.1093/logcom/exz023.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

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 announcements or iteration of public announcements. However, when both options are discarded, the complexity drops to Pspace-complete.

BALBIANI, 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 (ottobre 2008): 305–34. http://dx.doi.org/10.1017/s1755020308080210.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

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 this logic. There is a natural generalization to a logic for arbitrary events.

Galimullin, 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 luglio 2023): 260–71. http://dx.doi.org/10.4204/eptcs.379.21.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

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.

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

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Baş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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

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 Γ. In the presence of common knowledge, conditional dynamic consequence is definable from (unconditional) dynamic consequence. An open question is whether dynamic consequence is compact. We further investigate a dynamic consequence relation for soft instead of hard announcements. Surprisingly, it shares many properties with (hard) dynamic consequence. Dynamic consequence relations provide a novel perspective on reasoning about protocols in multi-agent systems.

Mohd 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 aprile 2020): 626. http://dx.doi.org/10.3390/math8040626.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

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.

Più fonti

Tesi sul tema "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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

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 propositionnelle et la logique du premier ordre en termes d'expressivité et de décidabilité. La logique des annonces publiques arbitraires étend la logique des annonces publiques en ajoutant la quantification sur toutes les annonces. Elle est plus expressive que les logiques modales et la logique des annonces publiques, mais indécidable. Dans cette thèse, nous proposons de nouvelles versions de la logique d'annonce publique arbitraire. Tout d'abord, nous pouvons restreindre la quantification de toutes les annonces à des sous-ensembles de celles-ci. Plus précisément, les annonces concernées pourraient n'utiliser qu'un sous-ensemble de toutes les variables propositionnelles ou impliquer une formule donnée. Bien que ces variantes de la logique des annonces publiques arbitraires soient encore indécidables, nous montrons qu'il existe une hiérarchie intéressante de l'expressivité relative de ces variantes. Une autre approche est basée sur l'idée d'empaqueter des opérateurs ensemble. Les opérateurs groupés représentent des notions plus complexes et restreignent également l'expressivité des langages. La notion de "connaissabilité'' peut être interprétée comme "il existe un changement d'information possible après lequel l'agent sait quelque chose''. Il est naturel de la représenter par l'ensemble d'un opérateur dynamique quantifié et d'un opérateur épistémique. Dans cette thèse, nous proposons des logiques de connaissabilité utilisant de tels opérateurs. Nous montrons que s'il n'y a pas de restriction sur les annonces, alors la logique de connaissabilité est plus expressive que la logique d'annonce publique, mais indécidable. Si nous ne quantifions que les annonces booléennes, alors la logique a la même expressivité que la logique modale propositionnelle. En plus de l'extension avec la quantification, dans cette thèse, nous combinons également la logique épistémique dynamique avec un système normatif. La logique de mise à jour de flèches contient des modalités qui spécifient quelles relations doivent être préservées après la mise à jour par les conditions source et cible. Elle est conçue pour raisonner sur les changements de croyances multi-agents. Nous pouvons également l'utiliser pour représenter la notion de "norme'' qui régule les comportements des agents de manière conséquente. Nous proposons une logique normative de mise à jour des flèches qui combine la logique de mise à jour de flèches et la logique temporelle normative. Elle conclut également la combinaison additive, multiplicative et séquentielle des normes. La logique normative de mise à jour de flèches permet de distinguer les façons statiques et dynamiques de considérer les normes comme une logique épistémique dynamique. Nous montrons son expressivité relative par rapport à d'autres logiques apparentées, sa décidabilité et sa complexité
We 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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

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'épistémologie et de la logique épistémique dans une pratique argumentative est pertinente dans le domaine juridique car elle offre une approche originale de la notion de condition dans le droit
The 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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

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 systems that have arisen in this way. Keywords: public announcement logic, logic for belief

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

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 corresponding update mechanisms, can be embedded into the framework of conditional plausibility spaces. At the very end we briefly illustrate a general update model using plausibility measures. Keywords: belief revision, dynamic logic, epistemic logic, plausibility space, pub- lic announcement, uncertainty, update.

Capitoli di libri sul tema "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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Charrier, 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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Xiong, 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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Cabrer, 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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Wá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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Reiche, 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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Wá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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Ma, 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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Demey, 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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Sadrzadeh, 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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Atti di convegni sul tema "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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

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 (where the latter accounts for the state of the debate), so as to reason about different kinds of persuasion and about strategic features. This version of multi-agent AFs, as well as their updates with public announcements of attacks (more concretely, the effects of these updates on the acceptability of an argument) can be described using S5-PAL, a well-known dynamic-epistemic logic. We also discuss how to extend our proposal to capture arbitrary higher-order attitudes and uncertainty.

Lutz, 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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Chakraborty, 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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

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 logic.

Huang, 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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

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 formulas, and the solution is an action tree branching on sensing results.To support efficient reasoning in the multi-agent KD45 logic, we make use of a normal form called alternative cover disjunctive formula (ACDF). We propose basic revision and update algorithms for ACDF formulas. We also handle static propositional common knowledge, which we call constraints. Based on our reasoning, revision and update algorithms, adapting the PrAO algorithm for contingent planning from the literature, we implemented a multi-agent epistemic planner called MAEP. Our experimental results show the viability of our approach.

Rapporti di organizzazioni sul tema "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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

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 expressed exponentially more succint in PAL than in EL. This shows that, despite the known fact that PAL and EL have the same expressive power, ther eis a benefit in adding the public announcement operator to EL: it exponentially increases the succinctness of formulas without having negative effects on computational complexity.