메뉴 건너뛰기




Volumn , Issue , 2000, Pages 191-198

Cooperation by iterated plan revision

Author keywords

[No Author keywords available]

Indexed keywords

MULTI AGENT SYSTEMS;

EID: 84962050793     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMAS.2000.858453     Document Type: Conference Paper
Times cited : (4)

References (10)
  • 1
    • 84968314764 scopus 로고
    • On logic of theory of change: Partial meet functions for contraction and revision
    • C. Alchourrón, P. Gärdenfors, and D. Makinson. On logic of theory of change: Partial meet functions for contraction and revision. Journal of Symbolic Logic, 50:510-530, 1985.
    • (1985) Journal of Symbolic Logic , vol.50 , pp. 510-530
    • Alchourrón, C.1    Gärdenfors, P.2    Makinson, D.3
  • 2
    • 0031074857 scopus 로고    scopus 로고
    • Fast planning through planning graph analysis
    • A. L. Blum and M. L. Furst. Fast planning through planning graph analysis. Artificial Intelligence, 90:281-300, 1997.
    • (1997) Artificial Intelligence , vol.90 , pp. 281-300
    • Blum, A.L.1    Furst, M.L.2
  • 4
    • 0031191004 scopus 로고    scopus 로고
    • Negotiation and cooperation in multi-agent environments
    • S. Kraus. Negotiation and cooperation in multi-agent environments. Artificial Intelligence, 94(1-2):79-98, 1997.
    • (1997) Artificial Intelligence , vol.94 , Issue.1-2 , pp. 79-98
    • Kraus, S.1
  • 7
  • 8
    • 8344286844 scopus 로고
    • Distributed cooperation algorithms
    • Y. Demazeau and J.-P. Müller, editors, Elsevier Science Publishers B.V.
    • E. Werner. Distributed cooperation algorithms. In Y. Demazeau and J.-P. Müller, editors, Decentralized A.I., pages 17-31. Elsevier Science Publishers B.V., 1990.
    • (1990) Decentralized A.I. , pp. 17-31
    • Werner, E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.