ASTREA: Answer Sets for a Trusted Reasoning Environment for Agents | SpringerLink
Skip to main content
Springer Nature Link
Log in

ASTREA: Answer Sets for a Trusted Reasoning Environment for Agents

  • Chapter
Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning

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

  • 892 Accesses

Abstract

In recent years, numerous papers have shown the power and flexibility of answer set programming (ASP) in the modeling of intelligent agents. This is not surprising since ASP was developed specifically for non-monotonic reasoning - including common-sense reasoning required in agent modeling. When dealing with multiple agents exchanging information, a common problem is dealing with conflicting information. As with humans, our intelligent agents may trust information from some agents more and than from others. In this paper, we present ASTREA, a methodology and framework for modeling multi-agent systems with trust. Starting from agents written in standard \(Ans\-Prolog\) , we model the agent’s knowledge, beliefs, reasoning capabilities and trust in other agents together with a conflict resolution strategy in CR-Prolog. The system is then able to advise the agent what information to take into account and what to discard.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

References

  1. Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: The socs computational logic approach to the specification and verification of agent societies. In: Priami, C., Quaglia, P. (eds.) GC 2004. LNCS, vol. 3267, pp. 314–339. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Alferes, J.J., Banti, F., Brogi, A., Leite, J.A.: Semantics for dynamic logic programming: A principle-based approach. In: Lifschitz, V., Niemel, I. (eds.) LPNMR 2003. LNCS, vol. 2923, pp. 8–20. Springer, Heidelberg (2003)

    Google Scholar 

  3. Alferes, J., Brogi, A., Leite, J., Pereira, L.: Logic programming for evolving agents. In: Klusch, M., Zhang, S.-W., Ossowski, S., Laamanen, H. (eds.) CIA 2003. LNCS (LNAI), vol. 2782, pp. 281–297. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Balduccini, M.: Answer set based design of highly autonomous, rational agents. Phd thesis, Texas Tech University (December 2005)

    Google Scholar 

  5. Balduccini, M., Gelfond, M.: Logic programs with consistency-restoring rules. In: AAAI Spring 2003 Symposium, pp. 9–18 (2003)

    Google Scholar 

  6. Balduccini, M., Gelfond, M.: The aaa architecture: An overview. In: AAAI 2008 Spring Symposium on Architectures for Intelligent Theory-Based Agents (2008)

    Google Scholar 

  7. Baral, C., Gelfond, M.: Reasoning agents in dynamic domains. In: Minker, J. (ed.) Logic Based Artificial Intelligence, pp. 257–279. Kluwer Academic Publishers, Dordrecht (2000)

    Chapter  Google Scholar 

  8. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  9. Baral, C., Gelfond, M.: Reasoning agents in dynamic domains. In: Logic-based artificial intelligence, pp. 257–279. Kluwer Academic Publishers, Dordrecht (2000)

    Chapter  Google Scholar 

  10. Bratman, M.E.: What is intention? In: Cohen, P.R., Morgan, J.L., Pollack, M.E. (eds.) Intentions in Communication, pp. 15–32. MIT Press, Cambridge (1990)

    Google Scholar 

  11. Brewka, G., Niemelä, I., Truszczynski, M.: Answer set programming. In: International Joint Conference on Artificial Intelligence (JCAI 2003). Morgan Kaufmann, San Francisco (2003)

    Google Scholar 

  12. Buccafurri, F., Caminiti, G.: A social semantics for multi-agent systems. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 317–329. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Buccafurri, F., Gottlob, G.: Multiagent compromises, joint fixpoints, and stable models. In: Kowalski, R.A. (ed.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2407, pp. 561–585. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  14. Buccafurri, F., Leone, N., Rullo, P.: Disjunctive ordered logic: Semantics and expressiveness. In: Cohn, A.G., Schubert, L.K., Shapiro, S.C. (eds.) Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning, June 1998, pp. 418–431. Morgan Kaufmann, Trento (1998)

    Google Scholar 

  15. Ciampolini, A., Lamma, E., Mello, P., Toni, F., Torroni, P.: Cooperation and competition in alias: A logic framework for agents that negotiate. Annals of Mathematics and Artificial Intelligence 37, 65–91 (2003), doi:10.1023/A:1020259411066

    Article  MathSciNet  MATH  Google Scholar 

  16. Cliffe, O., De Vos, M., Padget, J.: Specifying and analysing agent-based social institutions using answer set programming. In: Boissier, O., Padget, J., Dignum, V., Lindemann, G., Matson, E., Ossowski, S., Sichman, J.S., Vázquez-Salceda, J. (eds.) ANIREM 2005 and OOOP 2005. LNCS (LNAI), vol. 3913, pp. 99–113. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  17. De Vos, M., Cliffe, O., Watson, R., Crick, T., Padget, J., Needham, J., Brain, M.: T-LAIMA: Answer Set Programming for Modelling Agents with Trust. In: European Workshop on Multi-Agent Systems (EUMAS 2005), pp. 126–136 (December 2005)

    Google Scholar 

  18. De Vos, M., Vermeir, D.: Extending Answer Sets for Logic Programming Agents. Annals of Mathematics and Artifical Intelligence 42(1-3), 103–139 (2004); Special Issue on Computational Logic in Multi-Agent Systems

    Article  MathSciNet  MATH  Google Scholar 

  19. Delgrande, J., Schaub, T., Tompits, H.: Logic programs with compiled preferences. In: Horn, W. (ed.) European Conference on Artficial Intelligence, pp. 392–398. IOS Press, Amsterdam (2000)

    Google Scholar 

  20. Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: The KR system dlv: Progress report, comparisons and benchmarks. In: Cohn, A.G., Schubert, L., Shapiro, S.C. (eds.) KR1998: Principles of Knowledge Representation and Reasoning, pp. 406–417. Morgan Kaufmann, San Francisco (1998)

    Google Scholar 

  21. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: M. Veloso, editor, Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 386–392. AAAI Press/The MIT Press (2007), http://www.ijcai.org/papers07/contents.php.

  22. Gebser, M., Schaub, T., Thiele, S.: GrinGo: A New Grounder for Answer Set Programming. In: Baral, C., Brewka, G., Schlipf, J.S. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 266–271. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  23. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3-4), 365–386 (1991)

    Article  MATH  Google Scholar 

  24. Gelfond, M., Morales, R.: Encoding conformant planning in a-prolog. In: DRT 2004 (2004)

    Google Scholar 

  25. Konczak, K.: Voting theory in answer set programming. In: Fink, M., Tompits, H., Woltran, S. (eds.) Proceedings of the Twentieth Workshop on Logic Programmin (WLP 2006). Number INFSYS RR-1843-06-02 in Technical Report Series, pp. 45–53. Technische Universität Wien (2006)

    Google Scholar 

  26. Leite, J.A., Alferes, J.J., Pereira, L.M.: Minerva - a dynamic logic programming agent architecture. In: Intelligent Agents VIII. LNCS (LNAI), vol. 2002, pp. 141–157. Springer, Heidelberg (2002)

    Google Scholar 

  27. Niemelä, I., Simons, P.: Smodels: An implementation of the stable model and well-founded semantics for normal LP. In: Dix, J., Furbach, U., Nerode, A. (eds.) LPNMR 1997. LNCS (LNAI), vol. 1265, pp. 420–429. Springer, Berlin (1997)

    Chapter  Google Scholar 

  28. Niemelä, I., Simons, P.: Extending the smodels system with cardinality and weight constraints. In: Logic-Based Artificial Intelligence, pp. 491–521. Kluwer Academic Publishers, Dordrecht (2000)

    Chapter  Google Scholar 

  29. Sakama, C., Inoue, K.: Representing Priorities in Logic Programs. In: Maher, M. (ed.) Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming, September 2–6, pp. 82–96. MIT Press, Cambridge (1996)

    Google Scholar 

  30. Sakama, C., Inoue, K.: Coordination between Logical Agents. In: ao Leite, J., Torroni, P. (eds.) Pre=Proceedings of CLIMI V: Computation logic in multi-agent systems, Lisbon, Portugal, September29–30, pp. 96–113 (2004)

    Google Scholar 

  31. Van Nieuwenborgh, D., Vermeir, D.: Preferred answer sets for ordered logic programs. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 432–443. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  32. Witteveen, C., Brewka, G.: Skeptical reason maintenance and belief revision. Artificial Intelligence 61(1), 1–36 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  33. Wooldridge, M.: An introduction to multiagent systems. Wiley, Chichester (2002) ISBN: 0 47149691X

    Google Scholar 

  34. Wooldridge, M., Jennings, N.R.: Intelligent agents: theory and practice. The Knowledge Engineering Review 10(02), 115–152 (1995)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Texas Tech University, Lubbock, TX, 79409, USA

    Richard Watson

  2. Department of Computer Science, University of Bath, Bath, BA2 7AY, UK

    Marina De Vos

Authors
  1. Richard Watson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marina De Vos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Eastman Kodak Company, Rochester, NY, USA

    Marcello Balduccini

  2. Department of Computer Science, New Mexico State University, 88003, Las Cruces, NM, USA

    Tran Cao Son

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Watson, R., De Vos, M. (2011). ASTREA: Answer Sets for a Trusted Reasoning Environment for Agents. In: Balduccini, M., Son, T.C. (eds) Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning. Lecture Notes in Computer Science(), vol 6565. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20832-4_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20832-4_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20831-7

  • Online ISBN: 978-3-642-20832-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation