Skip to main content

Building a Network Knowledge Base Based on a Belief Revision Operator

  • Conference paper
  • First Online:
Computational Science and Its Applications – ICCSA 2023 Workshops (ICCSA 2023)

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

Included in the following conference series:

  • 481 Accesses

Abstract

We present a proposal for negotiation in a network knowledge base (NKB) formed by a set of k intelligent agents, in order to decide the acceptance (or not) of a new information ϕ that is expressed in propositional logic.

Each one of the agents Ai, i = 1,…,k has associated a knowledge base (KB) Ki expressed as propositional formulas in conjunctive form. In order to decide the acceptance of ϕ, the belief revision operator Ind is applied on each KB Ki and ϕ, then Si = Ind(ϕ, Ki), and each one of the literals that form Si is weighed in order to estimate the cost that is required by Ai to accept ϕ.

Si expresses the required information by the agent Ai such that (Ki ∪ Si) ╞ ϕ. The NKB uses a constant value γ that is the threshold of acceptance of NKB. Thus, a piece of new information ϕ will be accepted by all the agents in NKB if the average of the weights of the requested formulas Si is greater than γ. Otherwise, ϕ is rejected by all the agents in the NKB.

Only in the case that ϕ will be accepted collectively, each one of the Ki in the network NKB is updated, as Ki = (KiSi). Otherwise, there are no changes to any KB Ki in the NKB.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

References

  1. Shankar, N.: Metamathematics, machines and gödel’s proof. In: Cambridge Tracts in Theoretical Computer Science, No. 38. Cambridge University Press (1997)

    Google Scholar 

  2. Jansana, R.: Propositional Consequence Relations and Algebraic Logic. In: Zalta, E.N. (ed.) (2006)

    Google Scholar 

  3. Bordeaux, L., Hamadi, Y., Zhang, L.: Propositional satisfiability and constraint programming: a comparative survey. ACM Comput. Surv. 38, 1–54 (2006)

    Article  Google Scholar 

  4. Gallier, J.: SLD-resolution and logic programming (PROLOG). In: Logic for Computer Science, Foundations of Automatic Theorem Proving, pp. 410–447. University of Pennsylvania, Department of Computer and Information Science (2003)

    Google Scholar 

  5. De Ita, G., Marcial-Romero, R., Bellor, P., Contreras, M.: Belief revision between conjunctive normal forms. J. Intell. Fuzzy Syst. 34(5), 3155–3164 (2018)

    Article  Google Scholar 

  6. Bello, P., De Ita, G.: An algorithm to belief revision and to verify consistency of a knowledge base. IEEE Latin America Trans. 19(11), 1867–1874 (2021)

    Article  Google Scholar 

  7. Gallo, F., Simari, G., Martinez, M.V., Santos, N.A., Falappa, M.A.: Local belief dynamics in network knowledge Bases. ACM Trans. Comput. Logic 23(1), 1–36 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  8. De Ita, G., Marcial-Romero, R., Hernández, J., Pozos-Parra, P.: Using binary patterns for counting falsifying assignments of conjunctive forms. Elect. Notes in Theoretical Comput. Sci. 315, 17–30 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  9. Alchourron, C., Gardenfords, P., Makinson, D.: On the logic of theory change: partial meet contraction and revision functions. J. Symbolic Logic 50, 510–530 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  10. Katsuno, H., Mendelzon, A.O.: On the difference between updating a knowledge base and revising it. In: KR’91 Cambridge, MA, USA, pp. 387–394 (1991)

    Google Scholar 

  11. Darwiche, A., Pearl, J.: On the logic of iterated belief revision. Artif. Intell. 89, 1–29 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  12. Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 2nd edn. Prentice Hall Press, Upper Saddle River, NJ, USA (2009)

    MATH  Google Scholar 

  13. Julian, V., Botti, V.: Multi-agent systems. In: Applied Sciences (Switzerland), vol. 9, Issue 7. MDPI AG (2019). https://doi.org/10.3390/app9071402

  14. Oprea, M.: Applications of multi-agent systems (2004). https://doi.org/10.1007/1-4020-8159-6_9

  15. Wooldridge, M.: An Introduction to MultiAgent Systems. John Wiley & Sons, Chichester (2002)

    Google Scholar 

  16. Asadi, R., Mustapha, N., Sulaiman, N.: A framework for intelligent multi agent system based neural network classification model. Int. J. Comput. Sci. Inf. Secur. 5(1), 168–174 (2009)

    Google Scholar 

  17. Gallo, F.R., Simari, G.I., Martinez, M.V., Falappa, M.A.: Predicting user reactions to Twitter feed content based on personality type and social cues. Future Generation Comput. Syst. 110, 918–930 (2020). https://doi.org/10.1016/j.future.2019.10.044

    Article  Google Scholar 

  18. van Veen, D.-J., Kudesia, R.S., Heinimann, H.R.: An agent-based model of collective decision-making: how information sharing strategies scale with information overload. IEEE Trans. Comput. Soc. Syst. 7(3), 751–767 (2020). https://doi.org/10.1109/TCSS.2020.2986161

    Article  Google Scholar 

Download references

Acknowledgment

The authors wish to thank to the Conacyt (Consejo Nacional de Ciencias y Tecnología) – México.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Guillermo De Ita-Luna .

Editor information

Editors and Affiliations

Ethics declarations

Conflict of Interest

“The authors declare no conflict of interest”.

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

Osuna-González, R., De Ita-Luna, G. (2023). Building a Network Knowledge Base Based on a Belief Revision Operator. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2023 Workshops. ICCSA 2023. Lecture Notes in Computer Science, vol 14104. Springer, Cham. https://doi.org/10.1007/978-3-031-37105-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-37105-9_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-37104-2

  • Online ISBN: 978-3-031-37105-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics