{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T09:38:56Z","timestamp":1768556336149,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540689591","type":"print"},{"value":"9783540689614","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11961536_7","type":"book-chapter","created":{"date-parts":[[2007,1,19]],"date-time":"2007-01-19T08:09:10Z","timestamp":1169194150000},"page":"89-104","source":"Crossref","is-referenced-by-count":2,"title":["When Agents Communicate Hypotheses in Critical Situations"],"prefix":"10.1007","author":[{"given":"Gauvain","family":"Bourgne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Maudet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suzanne","family":"Pinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Hurwood, W.: Spreading rumors rapidly despite an adversary. In: Proc. 15th ACM Symposium on Principles of Distributed Computing, pp. 143\u2013151 (1996)","DOI":"10.1145\/248052.248077"},{"key":"7_CR2","volume-title":"The Mathematical Theory of Infectious Diseases","author":"N. Bailey","year":"1975","unstructured":"Bailey, N.: The Mathematical Theory of Infectious Diseases. Charles Griffin and Company, London (1975)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Birman, K., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., Minsky, Y.: Bimodal multicast. ACM Transactions on Computer Systems\u00a017(2) (1999)","DOI":"10.1145\/312203.312207"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Braginsky, D., Estrin, D.: Rumor routing algorithm for sensor networks. In: Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications (2002)","DOI":"10.1145\/570738.570742"},{"key":"7_CR5","unstructured":"Buchegger, S., Le Boudec, J.: The effect of rumor spreading in reputation systems for mobile ad-hoc networks. In: Proceedings of Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (2003)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Chlebus, B., Kowalski, D.: Gossiping to reach consensus. In: Proceedings of the 14th ACM Symp. on Parallel Algorithms and Architectures, pp. 220\u2013229 (2002)","DOI":"10.1145\/564870.564908"},{"key":"7_CR7","first-page":"236","volume-title":"Twelfth IEEE International Symposium on High Performance Distributed Computing (HPDC-12)","author":"F.M. Cuenca-Acuna","year":"2003","unstructured":"Cuenca-Acuna, F.M., Peery, C., Martin, R.P., Nguyen, T.D.: PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities. In: Twelfth IEEE International Symposium on High Performance Distributed Computing (HPDC-12), pp. 236\u2013246. IEEE Press, Los Alamitos (2003)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: Proceedings of 6th ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, pp. 1\u201312 (1987)","DOI":"10.1145\/41840.41841"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Jung, H., Tambe, M.: Argumentation as distributed constraint satisfaction: Applications and results. In: Proceedings of the fifth international conference on Autonomous agents (AGENTS 2001), pp. 324\u2013331 (2001)","DOI":"10.1145\/375735.376322"},{"key":"7_CR10","unstructured":"Kapferer, J.-N.: Rumeurs, le plus vieux m\u00e9dia du monde. Points Actuel (1990)"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-32261-0_16","volume-title":"Argumentation in Multi-Agent Systems","author":"N.C. Karunatillake","year":"2005","unstructured":"Karunatillake, N.C., Jennings, N.R.: Is it worth arguing? In: Rahwan, I., Mora\u00eftis, P., Reed, C. (eds.) ArgMAS 2004. LNCS, vol.\u00a03366, pp. 62\u201367. Springer, Heidelberg (2005)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-48254-7_25","volume-title":"Dependable Computing - EDDC-3","author":"M.-J. Lin","year":"1999","unstructured":"Lin, M.-J., Marzullo, K.: Directional gossip: Gossip in a wide area network. In: Hlavicka, J., Maehle, E., Pataricza, A. (eds.) EDDC 1999. LNCS, vol.\u00a01667, p. 364. Springer, Heidelberg (1999)"},{"issue":"3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1093\/logcom\/8.3.261","volume":"8","author":"S. Parsons","year":"1998","unstructured":"Parsons, S., Sierra, C., Jennings, N.R.: Agents that reason and negotiate by arguing. Journal of Logic and Computation\u00a08(3), 261\u2013292 (1998)","journal-title":"Journal of Logic and Computation"},{"issue":"2","key":"7_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1111\/j.1467-8640.1989.tb00319.x","volume":"5","author":"D. Poole","year":"1989","unstructured":"Poole, D.: Explanation and prediction: An architecture for default and abductive reasoning. Computational Intelligence\u00a05(2), 97\u2013110 (1989)","journal-title":"Computational Intelligence"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1002\/int.4550050506","volume":"5","author":"D. Poole","year":"1990","unstructured":"Poole, D.: A methodology for using a default and abductive reasoning system. International Journal of Intelligent Systems\u00a05, 521\u2013548 (1990)","journal-title":"International Journal of Intelligent Systems"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Roos, N., ten Tije, A., Witteveen, C.: A protocol for multi-agent diagnosis with spatially distributed knowledge. In: Proceedings of the Second international joint conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2003), pp. 655\u2013661 (2003)","DOI":"10.1145\/860575.860681"},{"key":"7_CR17","unstructured":"Roos, N., ten Tije, A., Witteveen, C.: Reaching diagnostic agreement in multiagent diagnosis. In: Proceedings of the Third International joint conference on Autonomous Agents and Multi-Agent System (AAMAS 2004), pp. 1254\u20131255 (2004)"},{"key":"7_CR18","unstructured":"Saks, M., Shavit, N., Woll, H.: Optimal time randomized consensus - making resilient algorithms fast in practice. In: Proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms, pp. 351\u2013362 (1991)"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Even, S., Monien, B.: On the number of rounds needed to disseminate information. In: Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 318\u2013327 (1989)","DOI":"10.1145\/72935.72969"},{"key":"7_CR20","unstructured":"Shibutani, T.: Improvised News: A Sociological Study of Rumor, Indianapolis and New york (1966)"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Ye, F., Zhong, G., Lu, S., Zhang, L.: Gradient broadcast: A robust data delivery protocol for large scale sensor networks. ACM Wireless Networks\u00a011(2) (2005)","DOI":"10.1007\/s11276-005-6612-9"}],"container-title":["Lecture Notes in Computer Science","Declarative Agent Languages and Technologies IV"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11961536_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:55:16Z","timestamp":1558284916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11961536_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540689591","9783540689614"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11961536_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}