Skip to main content

Belief Revision with Satisfaction Measure

  • Conference paper
  • First Online:
Logic, Rationality, and Interaction (LORI 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14329))

Included in the following conference series:

  • 257 Accesses

Abstract

In this paper we propose a satisfaction measure for the theory of belief revision, which should be an alternative to the classical distance measure for defining revision operators. We present the idea of satisfaction measure as a monotonic condition, and characterize how it affects the revision operation by proving an extension of the AGM representation theorem (H. Katsuno and A. Mendelzon, 1991). A unique syntactical form, the disjunction of all prime implicants, is used to compile the belief bases. Then we develop a method to generate revision operators meet that monotonic condition. Lastly, we compare such an operator to four operators of other kinds with an example, then highlight its novelty and advantages.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 74.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The operator \(\circ ^{d_{H}}\) is named as \(\circ ^{D}\) in [15].

  2. 2.

    See [15] for the details of \(\circ _{\textit{IP}}^{{\hat{D}}}\).

References

  1. Alchourrón, C., Gärdenfors, P., Makinson, D.: On the logic of theory change: partial meet contraction and revision functions. J. Symbolic Logic 50(2), 510–530 (1985)

    Article  Google Scholar 

  2. Borgida, A.: Language features for flexible handling of exceptions in information systems. ACM Trans. Database Syst. (TODS) 10(4), 565–603 (1985)

    Article  Google Scholar 

  3. Borja-Macías, V., Pozos-Parra, P.: Model-based belief merging without distance measures. In: Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 1–3 (2007). https://doi.org/10.1145/1329125.1329312

  4. Chávez-Bosquez, O., Pozos-Parra, P., Ma, J.: Implementing \(\Delta _{ps}\) (ps-merge) belief merging operator for belief revision. Computación y Sistemas 21(3), 419–434 (2017)

    Article  Google Scholar 

  5. Dalal, M.: Investigations into a theory of knowledge base revision: preliminary report. In: Proceedings of the 7th National Conference on Artificial Intelligence (AAAI-88), pp. 475–479 (1988)

    Google Scholar 

  6. Fermé, E., Hansson, S.O.: AGM 25 years: twenty-five years of research in belief change. J. Philos. Log. 40(2), 295–331 (2011)

    Article  Google Scholar 

  7. Fine, B., Fine, K.: Social choice and individual ranking I. Rev. Econ. Stud. 41(3), 303–322 (1974)

    Article  Google Scholar 

  8. Hamilton, A.G.: Logic for Mathematicians. Cambridge University Press, Cambridge (1988)

    Google Scholar 

  9. Katsuno, H., Mendelzon, A.O.: Propositional knowledge base revision and minimal change. Artif. Intell. 52(3), 263–294 (1991)

    Article  Google Scholar 

  10. Kean, A., Tsiknis, G.: An incremental method for generating prime implicants/implicates. J. Symb. Comput. 9(2), 185–206 (1990)

    Article  Google Scholar 

  11. Konieczny, S., Pérez, R.P.: Merging information under constraints: a logical framework. J. Log. Comput. 12(5), 773–808 (2002)

    Article  Google Scholar 

  12. Lehmann, D., Magidor, M., Schlechta, K.: Distance semantics for belief revision. J. Symbolic Logic 66(1), 295–317 (2001)

    Article  Google Scholar 

  13. Liberatore, P., Schaerf, M.: Arbitration: a commutative operator for belief revision. In: Proceedings of the 2nd World Conference on the Fundamentals of Artificial Intelligence (WOCFAI 1995), pp. 217–228 (1995)

    Google Scholar 

  14. Lin, J., Mendelzon, A.O.: Knowledge base merging by majority. In: Pareschi, R., Fronhöfer, B. (eds.) Dynamic Worlds: From the Frame Problem to Knowledge Management, vol. 12, pp. 195–218. Springer, Dordrecht (1999). https://doi.org/10.1007/978-94-017-1317-7_6

    Chapter  Google Scholar 

  15. Marchi, J., Bittencourt, G., Perrussel, L.: Prime forms and minimal change in propositional belief bases. Ann. Math. Artif. Intell. 59(1), 1–45 (2010)

    Article  Google Scholar 

  16. Ramesh, A., Becker, G., Murray, N.V.: CNF and DNF considered harmful for computing prime implicants/implicates. J. Autom. Reason. 18(3), 337–356 (1997)

    Article  Google Scholar 

  17. Rodrigues, O., Gabbay, D., Russo, A.: Belief revision. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. 16, pp. 1–114. Springer, Dordrecht (2011)

    Google Scholar 

  18. Schlechta, K.: Non-prioritized belief revision based on distances between models. Theoria 63(1–2), 34–53 (1997)

    Article  Google Scholar 

  19. Tison, P.: Generalization of consensus theory and application to the minimization of boolean functions. IEEE Trans. Electron. Comput. EC-16(4), 446–456 (1967). https://doi.org/10.1109/PGEC.1967.264648

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wei Zhao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhao, W. (2023). Belief Revision with Satisfaction Measure. In: Alechina, N., Herzig, A., Liang, F. (eds) Logic, Rationality, and Interaction. LORI 2023. Lecture Notes in Computer Science, vol 14329. Springer, Cham. https://doi.org/10.1007/978-3-031-45558-2_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-45558-2_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-45557-5

  • Online ISBN: 978-3-031-45558-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics