Skip to main content
SpringerLink
Log in

Speculative Computation Through Consequence-Finding in Multi-Agent Environments

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

This paper is concerned with a multi-agent system which performs speculative computation under incomplete communication environments. In a master–slave style multi-agent system with speculative computation, a master agent asks queries to slave agents in problem solving, and proceeds computation with default answers when answers from slave agents are delayed. In this paper, we first provide a semantics for speculative computation using default logic. Speculative computation is considered in which reply messages from slave agents to a master are tentative and may change from time to time. In this system, default values used in speculative computation are only partially determined in advance. Next, we propose a procedure to compute speculative computation using a first-order consequence-finding procedure SOL with the answer literal method. The use of a consequence-finding procedure is convenient for updating agents' beliefs according to situation changes in the world. Then, we further refine the SOL calculus using conditional answer computation and skip-preference in SOL. The conditional answer format has a great advantage of explicitly representing how a conclusion depends on tentative replies and defaults. This dependency representation is important to avoid unnecessary recomputation of tentative conclusions. On the other hand, the skip-preference method has the great ability of preventing irrational/redundant derivations. Finally, we implemented a mechanism of process maintenance to avoid duplicate computation when slave agents change their answers. As long as new answers from slave agents do not conflict with any previously encountered situation, the obtained conclusions are never recomputed. We applied the proposed system to the meeting-room reservation problem to see the usefulness of the framework.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. G. Antoniou, A.P. Courtney, J. Ernst and M.A. Williams, A system for computing constrained default logic extensions, in: Proceedings of JELIA '96, Lecture Notes in Artificial Intelligence, Vol 1126 (Springer, 1996) pp. 237–250.

  2. P. Baumgartner, U. Furbach and F. Stolzenburg, Computing answers with model elimination, Artificial Intelligence 90 (1997) 135–176.

    Google Scholar 

  3. J. de Kleer, An assumption-based TMS, Artificial Intelligence 28 (1986) 127–162.

    Google Scholar 

  4. P. Dell'Acqua and L.M. Pereira, Enabling agents to update their knowledge and to prefer progress in artificial intelligence, in: Proceedings of the 10th Portuguese Conference on Artificial Intelligence, Lecture Notes in Artificial Intelligence, Vol. 2258 (Springer, 2001) pp. 183–190.

  5. P. Dell'Acqua, F. Sadri and F. Toni, Combining introspection and communication with rationality and reactivity in agents, in: Proceedings of JELIA'98, Lecture Notes in Artificial Intelligence, Vol. 1489 (Springer, 2002) pp. 17–32.

  6. A. del Val, A new method for consequence finding and compilation in restricted languages, in: Proceedings of AAAI-99 (AAAI Press, 1999) pp. 259–264.

  7. R. Demolombe, A strategy for the computation of conditional answers, in: Proceedings of ECAI'92, Lecture Notes in Artificial Intelligence, Vol. 810 (Springer, 1992) pp. 134–138.

  8. R. Demolombe and L. Fariñas del Cerro, An inference rule for hypothesis generation, in: Proceedings of IJCAI-91 (Morgan Kaufmann, 1991) pp. 152–157.

  9. U. Egly, Cuts in tableaux, in: Automated Deduction-A Basis for Application, Vol. 1, eds. W. Bibel and P.H. Schmitt (Kluwer, 1998) pp. 103–132.

  10. T. Eiter, M. Fink, G. Sabbatini and H. Tompits, Using methods of declarative logic programming for intelligent information agents, Theory and Practice of Logic Programming 2(6) (2002) 645–709.

    Google Scholar 

  11. M. Fuchs, Lemma generation for model elimination by combining top-down and bottom-up inference, in: Proceedings of IJCAI-99 (Morgan Kaufmann, 1999) pp. 4–9.

  12. C. Green, Theorem-proving by resolution as a basis for question-answering systems, in: Machine Intelligence, Vol. 4, eds. B. Meltzer and D. Michie (Edinburgh University Press, 1969) pp. 183–205.

  13. T. Imielinski, Intelligent query answering in rule based systems, Journal of Logic Programming 4 (1987) 229–257.

    Google Scholar 

  14. K. Inoue, Linear resolution for consequence finding, Artificial Intelligence 56 (1992) 301–353.

    Google Scholar 

  15. K. Inoue, Automated abduction, in: Computational Logic: Logic Programming and Beyond-Essays in Honour of Robert A. Kowalski, Part II, eds. A.C. Kakas and F. Sadri, Lecture Notes in Artificial Intelligence, Vol. 2408 (Springer, 2002) pp. 311–341.

  16. K. Inoue, S. Kawaguchi and H. Haneda, Controlling speculative computation in multi-agent environments, in: Proceedings of the 2nd International Workshop on Computational Logic in Multi-Agent Systems (CLIMA-01) (2001) pp. 9–18.

  17. K. Iwanuma, Lemma matching for a PTTP-based top-down theorem prover, in: Proceedings of CADE-14, Lecture Notes in Artificial Intelligence, Vol. 1249 (Springer, 1997) pp. 146–160.

  18. K. Iwanuma, K. Inoue and K. Satoh, Completeness of pruning methods for consequence finding procedure SOL, in: Proceedings of the 3rd International Workshop on First-Order Theorem Proving, eds. P. Baumgartner and H. Zhang (2000) pp. 89–100.

  19. K. Iwanuma and K. Inoue, Conditional answer computation in SOL as speculative computation in multi-agent environments, in: Proceedings of the 3rd International Workshop on Computational Logic in Multi-Agent Systems (CLIMA-02) (2002) pp. 149–162.

  20. K. Iwanuma and K. Inoue, Minimal answer computation and SOL, in: Proceedings of JELIA'02, Lecture Notes in Artificial Intelligence, Vol. 2424 (Springer, 2002) pp. 245–257.

  21. R. Kowalski and F. Sadri, From logic programming towards multi-agent systems, Annals of Mathematics and Artificial Intelligence 25 (1999) 391–419.

    Google Scholar 

  22. K. Kunen, The semantics of answer literals, Journal of Automated Reasoning 17 (1996) 83–95.

    Google Scholar 

  23. C.T. Lee, A completeness theorem and computer program for finding theorems derivable from given axioms, Ph.D. thesis, Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA (1967).

    Google Scholar 

  24. J.A. Leite, Evolving Knowledge Bases (IOS Press, 2003).

  25. R. Letz, Clausal tableaux, in: Automated Deduction: A Basis for Applications, Vol. 1, eds. W. Bibel and P.H. Schmitt (Kluwer, 1998) pp. 39–68.

  26. R. Letz, C. Goller and K. Mayr, Controlled integration of the cut rule into connection tableau calculi, Journal of Automated Reasoning 13 (1994) 297–338.

    Google Scholar 

  27. D.W. Loveland, Automated Theorem Proving: A Logical Basis (North-Holland, Amsterdam, 1978).

    Google Scholar 

  28. P. Marquis, Consequence finding algorithms, in: Handbook for Defeasible Reasoning and Uncertain Management Systems, Vol. 5, eds. D.M. Gabbay and P. Smets (Kluwer Academic, 2000) pp. 41–145.

  29. D. McIlaith and E. Amir, Theorem proving with structured theories, in: Proceedings of IJCAI-2001 (Morgan Kaufmann, 2001) pp. 624–631.

  30. E. Minicozzi and R. Reiter, A note on linear resolution strategies in consequence-finding, Artificial Intelligence 3 (1972) 175–180.

    Google Scholar 

  31. H. Nabeshima, K. Iwanuma and K. Inoue, SOLAR: a consequence finding system for advanced reasoning (2003) submitted.

  32. L.M. Pereira, C.V. Damasio and J.J. Alferes, Diagnosis and debugging as contradiction removal, in: Proceedings of the 2nd Workshop on Logic Programming and Nonmonotonic Reasoning (MIT Press, 1993) pp. 316–330.

  33. D. Poole, R. Goebel and R. Aleliunas, Theorist: a logical reasoning system for defaults and diagnosis, in: The Knowledge Frontier: Essays in the Representation of Knowledge, eds. N. Cercone and G. McCalla (Springer, 1987) pp. 331–352.

  34. A.S. Rao and M.P. Georgeff, Modeling rational agents within a BDI-architecture, in: Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (Morgan Kaufman, 1991) pp. 473–484.

  35. R. Reiter, A logic for default reasoning, Artificial Intelligence 13 (1980) 81–132.

    Google Scholar 

  36. F. Sadri and F. Toni, Computational logic and multi-agent systems: a roadmap, in: The Future of Computational Logic (1999).

  37. C. Sakama, K. Inoue, K. Iwanuma and K. Satoh, A defeasible reasoning system in multi-agent environments, in: Proceedings of the CL2000 Workshop on Computational Logic in Multi-Agent Systems (CLIMA-00) (2000) pp. 1–6.

  38. K. Satoh, Speculative computation and abduction for an autonomous agent, in: Proceedings of Nonmonotonic Reasoning Workshop 2002 (2002) pp. 191–199.

  39. K. Satoh, K. Inoue, K. Iwanuma and C. Sakama, Speculative computation by abduction under incomplete communication environments, in: Proceedings of the 4th International Conference on Multi-Agent Systems (ICMAS 2000) (IEEE Computer Society, 2000) pp. 263–270.

  40. K. Satoh and K. Yamamoto, Speculative computation with multi-agent belief revision, in: Proceedings of AAMAS 2002 (2002) to appear.

  41. M. Schroeder and G. Wagner, Vivid agents: theory, architecture, and applications, Journal for Applied Artificial Intelligence 14(7) (2000) 645–676.

    Google Scholar 

  42. Y. Shoham, Agent-oriented programming, Artificial Intelligence 60(1) (1993) 51–92.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo, 101-8430, Japan

    Katsumi Inoue

  2. Yamanashi University, 4-3-11 Takeda, Kofu, 400-8511, Japan

    Koji Iwanuma

Authors
  1. Katsumi Inoue
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Koji Iwanuma
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Inoue, K., Iwanuma, K. Speculative Computation Through Consequence-Finding in Multi-Agent Environments. Annals of Mathematics and Artificial Intelligence 42, 255–291 (2004). https://doi.org/10.1023/B:AMAI.0000034529.83643.ce

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:AMAI.0000034529.83643.ce

Search

Navigation