Skip to main content

Combinations of Normal and Non-normal Modal Logics for Modeling Collective Trust in Normative MAS

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNAI,volume 7639)

Abstract

We provide technical details for combining normal and a non-normal logics for the notion of collective trust. Such combinations lead to different levels of expressiveness of the system. We give a possible structure for a combined model checker for one of the logic resulting from such combinations.

Keywords

  • Model Checker
  • Modal Logic
  • Canonical Model
  • Propositional Atom
  • Kripke Model

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ambrossio, A., Mendoza, L.: Completitud e implementación de modalidades en MAS. Thesis report, Facultad de Informatica UNLP (2011)

    Google Scholar 

  2. Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science, vol. 53. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  3. Dunin-Keplicz, B., Verbrugge, R.: Collective intentions. Fundam. Inform., 271–295 (2002)

    Google Scholar 

  4. Dziubinski, M., Verbrugge, R., Dunin-Keplicz, B.: Complexity issues in multiagent logics. Fundam. Inform. 75(1-4), 239–262 (2007)

    MathSciNet  MATH  Google Scholar 

  5. Elgesem, D.: The modal logic of agency. Nordic Journal of Philosophical Logic 2, 1–46 (1997)

    MathSciNet  MATH  Google Scholar 

  6. Fajardo, R., Finger, M.: Non-normal modalisation. In: Advances in Modal Logic 2002, pp. 83–96 (2002)

    Google Scholar 

  7. Fajardo, R., Finger, M.: How not to combine modal logics. In: IICAI, pp. 1629–1647 (2005)

    Google Scholar 

  8. Falcone, R., Castelfranchi, C.: Social Trust: A Cognitive Approach. In: Trust and Deception in Virtual Societies, pp. 55–90. Kluwer Academic Publishers (2001)

    Google Scholar 

  9. Finger, M., Gabbay, D.: Combining temporal logic systems. Notre Dame Journal of Formal Logic 37 (1996)

    Google Scholar 

  10. Franceschet, M., Montanari, A., De Rijke, M.: Model checking for combined logics with an application to mobile systems. Automated Software Eng. 11, 289–321 (2004)

    CrossRef  Google Scholar 

  11. Governatori, G., Rotolo, A.: On the Axiomatization of Elgesem’s Logic of Agency and Ability. Journal of Philosophical Logic 34(4), 403–431 (2005)

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. Hansson, B., Gärdenfors, P.: A guide to intensional semantics. Modality, Morality and Other Problems of Sense and Nonsense. Essays Dedicated to Sören Halldén (1973)

    Google Scholar 

  13. Herrestad, H., Krogh, C.: Deontic logic relativised to bearers and counterparties. In: Bing, J., Torvund, O. (eds.) Anniversary Antology in Computers and Law, TANO (1995)

    Google Scholar 

  14. Jones, A., Sergot, M.: A logical framework. In: Open Agent Societies: Normative Specifications in Multi-agent Systems (2007)

    Google Scholar 

  15. Memmo, D., Sartor, G., di Cardano, G.Q.: Trust, Reliance, Good Faith, and the Law. In: Nixon, P., Terzis, S. (eds.) iTrust 2003. LNCS, vol. 2692, pp. 150–164. Springer, Heidelberg (2003)

    CrossRef  Google Scholar 

  16. Rasga, J., Sernadas, A., Sernadas, C.: Fibring as biporting subsumes asymmetric combinations. Preprint, SQIG - IT and IST - TU Lisbon, 1049-001 Lisboa, Portugal (2010)

    Google Scholar 

  17. Rasga, J., Sernadas, A., Sernadas, C.: Importing logics. Studia Logica (2011)

    Google Scholar 

  18. Rotolo, A., Sartor, G., Smith, C.: Good faith in contract negotiation and performance. IJBPIM Journal of Business Processes and Management, Special Issue on Contract Architectures and Languages 4, 154–173 (2009)

    Google Scholar 

  19. Smith, C., Rotolo, A.: Collective trust and normative agents. Logic Journal of IGPL 18(1), 195–213 (2010)

    CrossRef  MathSciNet  MATH  Google Scholar 

  20. Smith, C., Rotolo, A., Sartor, G.: Representations of time within normative MAS. Frontiers in Artificial Intelligence and Applications 223, 107–116 (2010)

    Google Scholar 

  21. Whittaker, S., Zimmermann, R.: Good Faith in European Contract Law. Cambridge University Press, Cambridge (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Smith, C., Ambrossio, A., Mendoza, L., Rotolo, A. (2012). Combinations of Normal and Non-normal Modal Logics for Modeling Collective Trust in Normative MAS. In: Palmirani, M., Pagallo, U., Casanovas, P., Sartor, G. (eds) AI Approaches to the Complexity of Legal Systems. Models and Ethical Challenges for Legal Systems, Legal Language and Legal Ontologies, Argumentation and Software Agents. AICOL 2011. Lecture Notes in Computer Science(), vol 7639. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35731-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35731-2_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35730-5

  • Online ISBN: 978-3-642-35731-2

  • eBook Packages: Computer ScienceComputer Science (R0)