Scalability study of peer-to-peer consequence finding

  • Authors:
  • P. Adjiman;P. Chatalic;F. Goasdou´e;M.-C. Rousset;L. Simon

  • Affiliations:
  • PCRI, CNRS, Orsay Cedex, France and Universit´e Paris-Sud, LRI, INRIA, Futurs, Orsay Cedex, France;PCRI, CNRS, Orsay Cedex, France and Universit´e Paris-Sud, LRI, INRIA, Futurs, Orsay Cedex, France;PCRI, CNRS, Orsay Cedex, France and Universit´e Paris-Sud, LRI, INRIA, Futurs, Orsay Cedex, France;PCRI, CNRS, Orsay Cedex, France and Universit´e Paris-Sud, LRI, INRIA, Futurs, Orsay Cedex, France;PCRI, CNRS, Orsay Cedex, France and Universit´e Paris-Sud, LRI, INRIA, Futurs, Orsay Cedex, France

  • Venue:
  • IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In peer-to-peer inference systems, each peer can reason locally but also solicit some of its acquaintances, sharing part of its vocabulary. This paper studies both theoretically and experimentally the problem of computing proper prime implicates for propositional peer-to-peer systems, the global theory (union of all peer theories) of which is not known (as opposed to partition-based reasoning).