Preferring and updating in abductive multi-agent systems (original) (raw)

Abstract

We present a logical framework and the declarative semantics of a multi-agent system in which each agent can communicate with and update other agents, can react to the environment, is able to prefer, whether beliefs or reactions, when several alternatives are possible, and is able to abduce hypotheses to explain observations. The knowledge state of an agent is represented by an updatable prioritized abductive logic program, in which priorities among rules can be expressed to allow the agent to prefer. We sketch two examples to illustrate how our approach functions, including how to prefer abducibles to tackle the problem of multiple hypotheses and how to perform the interplay between planning and acting.

We argue that the theory of the type of agents considered is a rich evolvable basis, and suitable for engineering configurable, dynamic, self-organizing and self-evolving agent societies.

Preview

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. J. J. Alferes, P. Dell’Acqua, E. Lamma, J. A. Leite, L. M. Pereira, and F. Riguzzi. A logic based approach to multi-agent systems. ALP Newsletter, August 2001. Available at http://centria.di.fct.unl.pt/~lmp.
  2. J. J. Alferes, J. A. Leite, L. M. Pereira, H. Przymusinski, and T. C. Przymusinski. Dynamic updates of non-monotonic knowledge bases. J. Logic Programming, 45(1-3):43–70, 2000.
    Article MATH MathSciNet Google Scholar
  3. J. J. Alferes, J. A. Leite, L. M. Pereira, and P. Quaresma. Planning as abductive updating. In D. Kitchin, editor, Procs. of the AISB’00 Symposium on AI Planning and Intelligent Agents, pages 1–8, Birmingham, England, 2000. AISB.
    Google Scholar
  4. J. J. Alferes and L. M. Pereira. Updates plus preferences. In M. O. Aciego, I. P. de Guzmn, G. Brewka, and L. M. Pereira, editors, Logics in AI, Procs. JELIA’00, LNAI 1919, pages 345–360, Berlin, 2000. Springer.
    Google Scholar
  5. A. Artikis and G. Pitt. A formal model of open agent societies. Proc. of Autonomous Agents, 2001.
    Google Scholar
  6. G. Brewka and T. Eiter. Preferred answer sets for extended logic programs. Artificial Intelligence, 109:297–356, 1999.
    Article MATH MathSciNet Google Scholar
  7. C. Castelfranchi. Engineering Social Order. In Andrea Omicini, Robert Tolksdorf, and Franco Zambonelli, editors, Engineering Societies in the Agents World. 1st Int. Workshop ESAW 2000. Revised Papers, LNAI 1972, pages 1–18, Berlin, 2000. Springer-Verlag.
    Google Scholar
  8. P. Davidsson. Categories of artificial societies. In A. Omicini, P. Petta, and R. Tolksdorf, editors, ESAW 2001, pages 1–9, 2001. Available at: http://lia.deis.unibo.it/confs/ESAW01/.
  9. P. Dell’Acqua and L. M. Pereira. Updating agents. In S. Rochefort, F. Sadri and F. Toni (eds.), Procs. of the ICLP’99 Workshop on Multi-Agent Systems in Logic (MASL’99), 1999.
    Google Scholar
  10. M. Denecker and A. Kakas, editors. Special Issue on Abductive Logic Programming, volume 44(1-3). J. Logic Programming, 2000.
    Google Scholar
  11. J. Ferber and O. Gutnecht. A meta-model for the analysis and design of organisations in multi-agent systems. In Int. Conf. on Multi-Agent Systems (ICMAS-98), pages 128–135. IEEE Computer Society, 1998.
    Google Scholar
  12. N. R. Jennings. On agent-based software engineering. Artificial Intelligence, 117:277–296, 2000.
    Article MATH Google Scholar
  13. A. C. Kakas, R. S Miller, and F. Toni. Planning with incomplete information. In C. Baral and M. Truszczynski, editors, Proc. NMR’2000, 8th Int. Workshop on Non-Monotonic Reasoning, Spec. Session on Representing Actions and Planning, 2000.
    Google Scholar
  14. J. A. Leite, J. J. Alferes, and L. M. Pereira. Minerva — A Dynamic Logic Programming Agent Architecture. To appear in: ATAL01-8th Int. Workshop on Agent Theories, Architectures, and Languages, 2001.
    Google Scholar
  15. A. Y. Levy and D. S. Weld. Intelligent internet systems. Artificial Intelligence, 118:1–14, 2000.
    Article Google Scholar
  16. L. Vercouter. A distributed approach to design open multi-agent systems. In A. Omicini, P. Petta, and R. Tolksdorf, editors, ESAW 2001, pages 24–37, 2001. Available at: http://lia.deis.unibo.it/confs/ESAW01/.
  17. F. Zambonelli, N. R. Jennings, and M. Wooldridge. Organisational abstractions for the analysis and design of multi-agent systems. In P. Ciancarini and M. Wooldridge, editors, Agent-Oriented Software Engineering, LNCS 1957, pages 127–141, Berlin, 2001. Springer-Verlag.
    Google Scholar

Download references

Author information

Authors and Affiliations

  1. Department of Science and Technology, Campus Norrköping, Linköping University, Norrköping, Sweden
    Pierangelo Dell’Acqua
  2. Centro de Inteligência Artificial - CENTRIA Departamento de Informática, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, 2829-516, Caparica, Portugal
    Luís Moniz Pereira

Authors

  1. Pierangelo Dell’Acqua
  2. Luís Moniz Pereira

Editor information

Editors and Affiliations

  1. Facoltà di Ingegneria della Romagna, Sede di Cesena, Università di Bologna, Alma Mater Studiorum, Via Rasi e Spinelli 176, 47023, Cesena (FC), Italy
    Andrea Omicini
  2. Software Agents and New Media Group, Austrian Research Institute for Artifiical Intelligence, Schottengasse 3, 1010, Vienna, Austria
    Paolo Petta
  3. Technische Universität Berlin, Fachbereich 13 - Informatik- FR 6-10 Franklinstr. 28/29, 10587, Berlin, Germany
    Robert Tolksdorf

Rights and permissions

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dell’Acqua, P., Pereira, L.M. (2001). Preferring and updating in abductive multi-agent systems. In: Omicini, A., Petta, P., Tolksdorf, R. (eds) Engineering Societies in the Agents World II. ESAW 2001. Lecture Notes in Computer Science(), vol 2203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45584-1\_5

Download citation

Keywords

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.

Publish with us