A Multi-agent approach to first-order logic

  • Guilherme Bittencourt
  • Isabel Tonin
Multi-Agent Systems and Distributed Artificial Intelligence
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1323)


This paper presents a hierarchical heterogeneous multi-agent society based on a hypercube parallel architecture able to manage, in a distributed way, a first-order logic knowledge base and to draw inferences from it. The knowledge base is structured into theories, composed by sets of formulas. The adopted internal representation of these theories consists of both canonical forms of the formulas that define them. The inference method underlying the deductive capabilities of the architecture is based on the fact that the two canonical forms of a set of formulas can used as a generalized inference rule, giving rise to a complete logical inference method. A prototype of the proposed knowledge representation system, where concurrence is sequentially simulated, has been implemented in Common Lisp/CLOS.

Content Areas

Agent-Oriented Programming Automated Reasoning Knowledge Representation Theorem Proving 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    W. Bibel. Automated Theorem Proving. Vieweg Verlag, 1987.Google Scholar
  2. 2.
    G. Bittencourt. Boxing theories (abstract).Workshop on Logic, Language, Information and Computation (WoLLIC'96), Journal of the Interest Group in Pure and Applied Logics (IGPL), Imperial College, London and Max-PlanckInstitut, Saarbrücken, 4(1):479–481, 1996.Google Scholar
  3. 3.
    G. Bittencourt. Concurrent inference through dual transformation. Journal of the Interest Group in Pure and Applied Logics (IGPL), in press, 1997.Google Scholar
  4. 4.
    G. Bittencourt. In the quest of the missing link. In Proceedings of IJCAI 15, 1997.Google Scholar
  5. 5.
    R.J. Brachman and H.J. Levesque, editors. Readings in Knowledge Representation. Morgan Kaufmann Publishers, Inc., Los Altos, CA, 1985.Google Scholar
  6. 6.
    C.-L. Chang and Lee R.C.-T. Symbolic Logic and Mechanical Theorem Proving. Academic Press, Computer Science Classics, 1973.Google Scholar
  7. 7.
    J. Chassin De Kergommeaux and P. Robert. An abstract machine to implement or-and parallel prolog efficiently. The Journal of Logic Programming, 8(3):249–264, May 1990.Google Scholar
  8. 8.
    W.-T. Chen and M.-Y. Fang. An efficient procedure for theorem proving in propositional logic on vector computers. Parallel Computing, 17:983–5, 1991.Google Scholar
  9. 9.
    A. Ciepielewski, S. Haridi, and B. Hausman. Or-parallel prolog on shared memory multiprocessors. The Journal of Logic Programming, 7(2):125–147, September 1989.Google Scholar
  10. 10.
    N. Eisinger. What you always wanted to know about clause graph resolution. In Proceedings of the 8th ICAD, Springer-Verlag LNCS No. 230, pages 316–336, 1986.Google Scholar
  11. 11.
    M. Fitting. First-Order Logic and Automated Theorem Proving. Springer-Verlag, New York, 1990.Google Scholar
  12. 12.
    L. Gasser. Boundaries, identity and aggregation: Plurality issues in multiagent systems. In Eric Werner and Yves Demazeau, editors, Decentralized Artificial Intelligence, pages 199–212. Elsevier Science Publishers, Amsterdam, NL, 1992.Google Scholar
  13. 13.
    B. Hayes-Roth. A blackboard architecture for control.Artificial Intelligence, 26(3):251–321, July 1985.Google Scholar
  14. 14.
    C.E. Hewitt. Open information system semantics for distributed artificial intelligence. Artificial Intelligence (Special Volume Foundations of Artificial Intelligence), 47(1-3):79–106, January 1991.Google Scholar
  15. 15.
    M.N. Huhns and D.M. Bridgeland. Multi-agent truth maintenance. IEEE Transactions on Systems, Man and Cybernetics, 21(6):1437–1445, 1991.Google Scholar
  16. 16.
    R. Loganantharaj and R.A. Mueller. Parallel theorem proving with connection graphs. In Proceedings of the 8th ICAD, Springer-Verlag LNCS No. 230, pages 337–352, 1986.Google Scholar
  17. 17.
    B. Malheiro, N.R. Jennings, and E. Oliveira. Belief revision in multi-agent systems. In A. Cohn, editor, Proceedings of ECAI 11. John Wiley & Sons, Ltd., 1994.Google Scholar
  18. 18.
    T.R. Martinez and J.J. Vidal. Adaptative parallel logic networks. Journal of Parallel and Distributed Computing, 5(1):26–58, February 1988.Google Scholar
  19. 19.
    C. Mason and R. Johnson. Datms: A framework for distributed assuption based reasoning. In L. Gasser and M.N. Huhns, editors, Distributed Artificial Intelligence Vol. II, pages 293–317. Elsevier Science Publishers, Amsterdam, NL, 1989.Google Scholar
  20. 20.
    B. Moulin and B. Chaib-Draa. An overview of distributed artificial intelligence. In G.M.P. O'Hare and N.R. Jennings, editors, Foundations of Distributed Artificial Intelligence, chapter 1, pages 3–55. John Wiley & Sons. Inc, 1996. http://iris.ift.ulaval.ca/publications/moulin/pub-96/pub-96.html.Google Scholar
  21. 21.
    M.J. Quinn. Desingning Efficient Algorithms for Parallel Computers. McGraw-Hill International Editions, 1987.Google Scholar
  22. 22.
    G.L. Steele Jr. Common LISP, the Language. Digital Press, Burlington, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Guilherme Bittencourt
    • 1
  • Isabel Tonin
    • 1
  1. 1.Laboratório de Controle e Microinformática Departamento de Engenharia ElétricaUniversidade Federal de Santa CatarinaFlorianópolisBrazil

Personalised recommendations