Belief Merging in Dynamic Logic of Propositional Assignments

We study syntactical merging operations that are defined semantically by means of the Hamming distance between valuations; more precisely, we investigate the Σ-semantics, Gmax-semantics and max-semantics. We work with a logical language containing merging operators as connectives, as opposed to the metalanguage operations of the literature. We capture these merging operators as programs of Dynamic Logic of Propositional Assignments DL-PA. This provides a syntactical characterisation of the three semantically defined merging operators, and a proof system for DL-PA therefore also provides a proof system for these merging operators. We explain how PSPACE membership of the model checking and satisfiability problem of star-free DL-PA can be extended to the variant of DL-PA where symbolic disjunctions that are parametrised by sets that are not defined as abbreviations, but are proper connectives are built into the language. As our merging operators can be polynomially embedded into this variant of DL-PA, we obtain that both the model checking and the satisfiability problem of a formula containing possibly nested merging operators is in PSPACE.

[1]  J. Pearl,et al.  On the Logic of Iterated Belief Revision , 1994, Artif. Intell..

[2]  Sarit Kraus,et al.  Combining Knowledge Bases Consisting of First Order Theories , 1991, ISMIS.

[3]  Marco Schaerf,et al.  BReLS: A System for the Integration of Knowledge Bases , 2000, KR.

[4]  Sébastien Konieczny,et al.  On the Difference between Merging Knowledge Bases and Combining them , 2000, KR.

[5]  Sébastien Konieczny,et al.  Merging with Integrity Constraints , 1999, ESCQARU.

[6]  Peter Z. Revesz.  On the semantics of theory change: arbitration between old and new information , 1993, PODS '93.

[7]  Thomas Lukasiewicz.  Proceedings of the 7th International Symposium on the Foundations of Information and Knowledge Systems‚ FoIKS 2012‚ Kiel‚ Germany‚ March 5−9‚ 2012 , 2000 .

[8]  Michael Clarke,et al.  Symbolic and Quantitative Approaches to Reasoning and Uncertainty , 1991, Lecture Notes in Computer Science.

[9]  Pierre Marquis,et al.  Reasoning under inconsistency: A forgetting-based approach , 2010, Artif. Intell..

[10]  Sébastien Konieczny,et al.  On the Logic of Merging , 1998, KR.

[11]  Michael Wooldridge,et al.  Reasoning About the Transfer of Control , 2014, J. Artif. Intell. Res..

[12]  Anthony Hunter,et al.  Implementing semantic merging operators using binary decision diagrams , 2008, Int. J. Approx. Reason..

[13]  Yde Venema,et al.  Dynamic Logic by David Harel, Dexter Kozen and Jerzy Tiuryn. The MIT Press, Cambridge, Massachusetts. Hardback: ISBN 0–262–08289–6, $50, xv + 459 pages , 2002, Theory and Practice of Logic Programming.

[14]  Alberto O. Mendelzon,et al.  Knowledge Base Merging by Majority , 1999 .

[15]  Michael Wooldridge,et al.  On the dynamics of delegation, cooperation, and control: a logical account , 2005, AAMAS '05.

[16]  Anthony Hunter,et al.  Merging First-Order Knowledge Using Dilation Operators , 2008, FoIKS.

[17]  Andreas Herzig,et al.  Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[18]  Dov M. Gabbay,et al.  Handbook of Philosophical Logic , 2002 .

[19]  Michael Wooldridge,et al.  On the logic of cooperation and propositional control , 2005, Artif. Intell..

[20]  Bernhard Beckert,et al.  Dynamic Logic , 2007, The KeY Approach.

[21]  Sébastien Konieczny,et al.  Logic Based Merging , 2011, J. Philos. Log..

[22]  Stefan Woltran,et al.  On Computing Belief Change Operations using Quantified Boolean Formulas , 2004, J. Log. Comput..

[23]  Emiliano Lorini,et al.  A Dynamic Logic of Normative Systems , 2011, IJCAI.