{"type":"ScholarlyArticle","title":"What Has Been Said? Identifying the Change Formula in a Belief Revision Scenario","authors":[{"name":"Nicolas Schwind","slug":"nicolas-schwind","given":"Nicolas","family":"Schwind","affiliation":"National Institute of Advanced Industrial Science and Technology , Tokyo , Japan"},{"name":"Katsumi Inoue","slug":"katsumi-inoue","given":"Katsumi","family":"Inoue","affiliation":"National Institute of Informatics , Tokyo , Japan; Tokyo Institute of Technology , Tokyo , Japan"},{"name":"Sébastien Konieczny","slug":"sebastien-konieczny","given":"Sébastien","family":"Konieczny","affiliation":"CRIL-CNRS , Université d'Artois , Lens , France"},{"name":"Jean-Marie Lagniez","slug":"jean-marie-lagniez","given":"Jean-Marie","family":"Lagniez","affiliation":"CRIL-CNRS , Université d'Artois , Lens , France"},{"name":"Pierre Marquis","slug":"pierre-marquis","given":"Pierre","family":"Marquis","affiliation":"CRIL-CNRS , Université d'Artois , Lens , France; Institut Universitaire de France"}],"abstract":"We consider the problem of identifying the change formula in a belief revision scenario: given that an unknown announcement (a formula mu) led a set of agents to revise their beliefs and given the prior beliefs and the revised beliefs of the agents, what can be said about mu? We show that under weak conditions about the rationality of the revision operators used by the agents, the set of candidate formulae has the form of a logical interval. We explain how the bounds of this interval can be tightened when the revision operators used by the agents are known and/or when mu is known to be independent from a given set of variables. We also investigate the completeness issue, i.e., whether mu can be exactly identified. We present some sufficient conditions for it, identify its computational complexity, and report the results of some experiments about it.","doi":"10.24963/ijcai.2019/258","url":"https://ijcai.org/proceedings/2019/258","pdf":"https://ijcai.org/proceedings/2019/0258.pdf","markdown":"https://ijcai.org/proceedings/2019/258.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/258","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":258,"pages":{"first":1865,"last":1871},"keywords":["Knowledge Representation and Reasoning: Belief Change","Knowledge Representation and Reasoning: Non-monotonic Reasoning"],"videos":[],"references":[{"position":1,"raw":"[Alchourrón et al., 1985] C. E. Alchourrón, P. Gärdenfors, and D. Makinson. On the logic of theory change: Par- tial meet contraction and revision functions. Journal of Symbolic Logic, 50(2):510-530, 1985.","title":"On the logic of theory change: Partial meet contraction and revision functions","authors":"C E Alchourrón, P Gärdenfors, D Makinson","year":"1985","venue":"Journal of Symbolic Logic","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Baltag and Moss, 2004] A. Baltag and L. S. Moss. Logics for epistemic programs. Synthese, 139(2):165-224, 2004.","title":"Logics for epistemic programs","authors":"A Baltag, L S Moss","year":"2004","venue":"Synthese","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Booth and Nittka, 2008] R. Booth and A. Nittka. Recon- structing an agent's epistemic state from observations about its beliefs and non-beliefs. Journal of Logic and Computation, 18(5):755-782, 2008.","title":"Reconstructing an agent's epistemic state from observations about its beliefs and non-beliefs","authors":"R Booth, A Nittka","year":"2008","venue":"Journal of Logic and Computation","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Craig, 1957] W. Craig. Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory. Journal of Symbolic Logic, 22:269-285, 1957.","title":"Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory","authors":"W Craig","year":"1957","venue":"Journal of Symbolic Logic","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Dalal, 1988] M. Dalal. Investigations into a theory of knowledge base revision: Preliminary report. In Proceed- ings of the Seventh National Conference on Artificial In- telligence (AAAI'88), pages 475-479, 1988.","title":"Investigations into a theory of knowledge base revision: Preliminary report","authors":"M","year":"1988","venue":"Proceedings of the Seventh National Conference on Artificial Intelligence (AAAI'88)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Hunter et al., 2017] A. Hunter, F. Schwarzentruber, and E. Tsang. Belief manipulation through propositional an- nouncements. In Proceedings of the Twenty-Sixth Inter- national Joint Conference on Artificial Intelligence (IJ- CAI'17), pages 1109-1115, 2017.","title":"Belief manipulation through propositional announcements","authors":"A Hunter, F Schwarzentruber, E Tsang","year":"2017","venue":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (IJ-CAI'17)","doi":null,"url":null,"internal_url":"/proceedings/2017/154"},{"position":7,"raw":"[Katsuno and Mendelzon, 1991] H. Katsuno and A. O. Mendelzon. Propositional knowledge base revision and minimal change. Artificial Intelligence, 52:263-294, 1991.","title":"Propositional knowledge base revision and minimal change","authors":"H Katsuno, A O Mendelzon","year":"1991","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Konieczny et al., 2004] S. Konieczny, J. Lang, and P. Mar- quis. DA 2 merging operators. Artificial Intelligence, 157(1-2):49-79, 2004.","title":"Marquis. DA 2 merging operators","authors":"S Konieczny, J Lang, P","year":"2004","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Lang et al., 2003] J. Lang, P. Liberatore, and P. Marquis. Propositional independence: Formula-variable indepen- dence and forgetting. Journal of Artificial Intelligence Re- search, 18:391-443, 2003.","title":"Propositional independence: Formula-variable independence and forgetting","authors":"J Lang, P Liberatore, P Marquis","year":"2003","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Lehmann et al., 2001] D. J. Lehmann, M. Magidor, and K. Schlechta. Distance semantics for belief revision. Jour- nal of Symbolic Logic, 66(1):295-317, 2001.","title":"Distance semantics for belief revision","authors":"D J Lehmann, M Magidor, K Schlechta","year":"2001","venue":"Journal of Symbolic Logic","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Liberatore, 2015] P. Liberatore. Revision by history. Jour- nal of Artificial Intelligence Research, 52:287-329, 2015.","title":"Revision by history","authors":"P Liberatore","year":"2015","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Muise et al., 2015] C. Muise, V. Belle, P. Felli, S. McIl- raith, T. Miller, A. Pearce, and L. Sonenberg. Planning over multi-agent epistemic states: A classical planning ap- proach, 2015.","title":"Planning over multi-agent epistemic states: A classical planning approach","authors":"C Muise, V Belle, P Felli, S Mcilraith, T Miller, A Pearce, L Sonenberg","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Schwind et al., 2015] N. Schwind, K. Inoue, G. Bourgne, S. Konieczny, and P. Marquis. Belief revision games. In Proceedings of the Twenty-Ninth AAAI Conference on Ar- tificial Intelligence (AAAI'15), pages 1590-1596, 2015.","title":"Belief revision games","authors":"N Schwind, K Inoue, G Bourgne, S Konieczny, P Marquis","year":"2015","venue":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI'15)","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Schwind et al., 2016] N. Schwind, K. Inoue, G. Bourgne, S. Konieczny, and P. Marquis. Is promoting beliefs useful to make them accepted in networks of agents? In Proceed- ings of the Twenty Fifth International Joint Conference on Artificial Intelligence (IJCAI'16), pages 1237-1243, 2016.","title":"Is promoting beliefs useful to make them accepted in networks of agents?","authors":"N Schwind, K Inoue, G Bourgne, S Konieczny, P Marquis","year":"2016","venue":"Proceedings of the Twenty Fifth International Joint Conference on Artificial Intelligence (IJCAI'16)","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[van Ditmarsch et al., 2008] H. van Ditmarsch, W. van der Hoek, and B. Kooi. Dynamic Epistemic Logic. Springer, 2008.","title":"Dynamic Epistemic Logic","authors":"H Van Ditmarsch, W Van Der Hoek, B Kooi","year":"2008","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}