Skip to main content
SpringerLink
Log in

Multiagent Compromises, Joint Fixpoints, and Stable Models

  • Chapter
  • First Online:
Computational Logic: Logic Programming and Beyond

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

Abstract

We assume the requirements or desires of an agent are modeled by a logic program. In a multi-agent setting, a joint decision of the agents, reflecting a compromise of the various requirements, corresponds to a suitable joint model of the respective logic programs. In this paper, an appropriate semantics for selecting joint models representing compromises is proposed: the joint fixpoint semantics. The intended joint models are defined to be the (minimal) joint fixpoints of the agent programs. We study computational properties of this new semantics showing that determining whether two (or more) logic programs have a joint fixpoint is NP complete. This remains true even for entirely positive logic programs. We also study the complexity of skeptical and credulous reasoning under the joint fixpoint semantics. The former is proven to be co-NP complete, while the latter is Σ 2 P complete. We show how the joint fixpoints of a set of logic programs can be computed as stable sets.

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

Access this chapter

Log in via an institution
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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Buccafurri, F., Gottlob, G.: Multiagent Compromises, Joint Fixpoints and Stable Models. Technical Report DBAI-TR-2000-36 (2000) available from the authors

    Google Scholar 

  2. Buccafurri, F., Leone, N., Rullo, P.: Stable Models and their Computation for Logic Programming with Inheritance and True Negation. Journal of Logic Programming 27(1), Elsevier Science (1996) 5–43

    Article  MATH  MathSciNet  Google Scholar 

  3. Buccafurri, F., Leone, N., Rullo, P.: Semantics and Espressiveness of Disjunctive Ordered Logic. Annals of Mathematics and Artificial Intelligence Journal. J.C. Balzer AC, Science Publisher 25 (1999) 311–337

    Article  MATH  MathSciNet  Google Scholar 

  4. Eiter, T., Gottlob, G.: Propositional Circumscription and Extended Closed-World Reasoning are П2 p-Complete. Theoretical Computer Science 114(2) (1993) 231–245

    Article  MATH  MathSciNet  Google Scholar 

  5. Eiter, T., Gottlob, G.: On the Computational Cost of Disjunctive Logic Programming: Propositional Case. Annals of Mathematics and Artificial Intelligence, 15(3–4) (1995) 289–323

    Article  MATH  MathSciNet  Google Scholar 

  6. Eiter, T., Gottlob, G., Mannila, H.: Disjunctive Datalog. ACM Transactions on Database Systems 22(3) (1997) 315–363

    Article  Google Scholar 

  7. Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: A Deductive System for Non-Monotonic Reasoning. Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR’ 97). Lecture Notes in Computer Science, Vol. 1265. Springer-Verlag, Dagstuhl, Germany (1997) 364–375

    Google Scholar 

  8. Eiter, T., Gottlob, G., Cadoli, M.: Default Logic as a Query Language. Transactions on Knowledge Data Engineering 9(3) (1997) 448–463

    Article  Google Scholar 

  9. Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. Proceedings of the 5th International Conference on Logic Programming. MIT Press, Cambridge, (1988) 1070–1080

    Google Scholar 

  10. Gottlob, G., Moerkotte, G., Subrahmanian, V.S.: The PARK Semantics for Active Rules. Proceedings of the International Conference on Extending Database Technology, EDBT’96, Lecture Notes in Computer Science. Springer Verlag, (1996) 35–55

    Google Scholar 

  11. Gottlob, G.: Complexity Results for Nonmonotonic Logics. Journal of Logic and Computation 2(3) (1992) 397–425

    Article  MATH  MathSciNet  Google Scholar 

  12. Grosof, B.: Prioritized Conflict Handling for Logic Programs. Proceedings of the International Logic Programming Symposium, ILPS’97, MIT Press, Cambridge, (1997) 197–211.

    Google Scholar 

  13. Kowalski, R., and Sadri, F.: From LP Towards Multi-Agent Systems. Annals of Mathematics and Artificial Intelligence 25(3–4) (1999) 391–419

    Article  MATH  MathSciNet  Google Scholar 

  14. Kolaitis, P.G., Papadimitriou, C.H.: Why not Negation by Fixpoint? Journal of Computer and System Sciences 43(1) (1991) 125–144

    Article  MATH  MathSciNet  Google Scholar 

  15. Martelli, M., Mascardi V., Zini, F.: Towards Multi-Agent Software Prototyping. Proceedings of The Third International Conference and Exhibition on The Practical Application of Intelligent Agents and Multi-Agent Technology (PAAM 98), London, UK, (1998) 331–354

    Google Scholar 

  16. McCarthy, J.: Circumscription-a Form of Nonmonotonic Reasoning, Artificial Intelligence 13 (1980) 27–39

    Article  MATH  MathSciNet  Google Scholar 

  17. Niemelä, I., Simons, P.: Smodels-an Implementation of the Stable Model and Well-founded Semantics for Normal Logic Programs. Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR’ 97), Lecture Notes in Computer Science, Vol. 1265. Springer-Verlag, Dagstuhl, Germany (1997) 420–429

    Google Scholar 

  18. Reiter, R.: A Logic for Default Reasoning. Artificial Intelligence 13 (1980) 81–132

    Article  MATH  MathSciNet  Google Scholar 

  19. Saccá, D.: The Expressive Power of Stable Models for Datalog Queries with Negation. Proceedings of the ILPS’93 Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic Programming, Washington D.C., USA (1993) 150–162

    Google Scholar 

  20. Schlipf, J.S.: The Expressive Powers of Logic Programming Semantics, Proceedings of the ACM Symposium on Principles of Database Systems (1990) 196–204

    Google Scholar 

  21. Schlipf, J.S.: A Survey of Complexity and Undecidability Results in Logic Programming. Proceedings of the ILPS’93 Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic Programming, Washington D.C., USA (1993) 93–102

    Google Scholar 

  22. Schroeder, M., De Almeida Mora, I., and Pereira L.M.: A Deliberative and Reactive Diagnosis Agent based on Logic Programming. Intelligent Agents III: Lecture Notes in Artificial Intelligence 1193, Springer-Verlag, J.P. Muller, M.J. Wooldridge and N. Jennings ed., (1997) 293–307

    Google Scholar 

  23. Subrahmanian V.S., Bonatti P., Dix, J., and Eiter T., Kraus S., Özcan, F., and Ross, R.: Heterogenous Active Agents. MIT-Press (2000)

    Google Scholar 

  24. Wooldridge, M., Jennings, N.R.: Formalizing the Cooperative Problem Solving Process. Readings in Agents, M. Huhns and M. Singh ed., Morgan Kaufmann (1997) 430–440

    Google Scholar 

  25. Wooldridge, M., Jennings, N.R.: Agent Theories, Architectures and Languages: A survey. Intelligent Agents, M. J. Wooldridge and N. R. Jennings ed., Lecture Notes in Artificial Intelligence, Springer-Verlag 890 (1995) 1–39.

    Google Scholar 

  26. Wooldridge, M., Jennings, N.R.: Intelligent Agents: Theory and Practice. Knowledge Engineering Reviews 10(2) 1995

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DIMET, Universitá di Reggio Calabria, I-89100, Reggio Calabria, Italy

    Francesco Buccafurri

  2. Institut für Informationssysteme, Technische Universität Wien, A-1040, Wien, Austria

    Georg Gottlob

Authors
  1. Francesco Buccafurri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Georg Gottlob
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Cyprus, 75 Kallipoleos St., 1678, Nicosia, Cyprus

    Antonis C. Kakas

  2. Department of Computing, Imperial College of Science, Technology and Medicine, 180 Queen’s Gate, London, SW7 2BZ, UK

    Fariba Sadri

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Buccafurri, F., Gottlob, G. (2002). Multiagent Compromises, Joint Fixpoints, and Stable Models. In: Kakas, A.C., Sadri, F. (eds) Computational Logic: Logic Programming and Beyond. Lecture Notes in Computer Science(), vol 2407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45628-7_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-45628-7_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43959-2

  • Online ISBN: 978-3-540-45628-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation