메뉴 건너뛰기




Volumn FS-01-03, Issue , 2001, Pages 26-35

Towards Argumentation as Distributed Constraint Satisfaction

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL METHODS; CONSTRAINT SATISFACTION PROBLEMS;

EID: 84859618616     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (3)

References (21)
  • 1
    • 0031366535 scopus 로고    scopus 로고
    • Dynamic prioritization of complex agents in distributed constraint satisfaction problems
    • Armstrong, A., and Durfee, E. 1997. Dynamic prioritization of complex agents in distributed constraint satisfaction problems. In Proceedings of IJCAI.
    • (1997) Proceedings of IJCAI
    • Armstrong, A.1    Durfee, E.2
  • 3
    • 33748334246 scopus 로고    scopus 로고
    • Poaching and distraction in asynchronous agent activities
    • Dimopoulos, Y.; Nebel, B.; and Toni, F. 1999. Preferred arguments are harder to compute than stable extensions Proceedings of IJCAI
    • Chia, M.; Neiman, D.; and Lesser, V. 1998. Poaching and distraction in asynchronous agent activities. In Proceedings of ICMAS. Dimopoulos, Y.; Nebel, B.; and Toni, F. 1999. Preferred arguments are harder to compute than stable extensions. In Proceedings of IJCAI.
    • (1998) Proceedings of ICMAS
    • Chia, M.1    Neiman, D.2    Lesser, V.3
  • 4
    • 0002297087 scopus 로고
    • Look-ahead value ordering for constraint satisfaction problems
    • Frost, D., and Dechter, R. 1995. Look-ahead value ordering for constraint satisfaction problems. In Proc. of IJCAI.
    • (1995) Proc. of IJCAI.
    • Frost, D.1    Dechter, R.2
  • 6
    • 85169807613 scopus 로고    scopus 로고
    • Automated negotiation: Prospects, methods and challenges. J. of Group Decision and Negotiation 10(2). Jung, H.; Tambe, M.; and Kulkarni, S. 2001. Argumentation as distributed constraint satisfaction: Applications and results
    • Proc. of Int’l Conf. on Autonomous Agents
    • Jennings, N. R.; Faratin, P.; Lomuscio, A. R.; Parsons, S.; Sierra, C.; and Woodlidge, M. 2001. Automated negotiation: Prospects, methods and challenges. J. of Group Decision and Negotiation 10(2). Jung, H.; Tambe, M.; and Kulkarni, S. 2001. Argumentation as distributed constraint satisfaction: Applications and results. In Proc. of Int’l Conf. on Autonomous Agents.
    • (2001)
    • Jennings, N. R.1    Faratin, P.2    Lomuscio, A. R.3    Parsons, S.4    Sierra, C.5    Woodlidge, M.6
  • 7
    • 0032156107 scopus 로고    scopus 로고
    • Reaching agreements through argumentation: a logical model and implementation
    • Kraus, S.; Sycara, K.; and Evenchik, A. 1998. Reaching agreements through argumentation: a logical model and implementation. Artificial Intelligence 104.
    • (1998) Artificial Intelligence , vol.104
    • Kraus, S.1    Sycara, K.2    Evenchik, A.3
  • 8
    • 0002514541 scopus 로고
    • Algorithms for constraint-satisfaction problems: A survey
    • Kumar, V. 1992. Algorithms for constraint-satisfaction problems: A survey. AI Magazine 12(1).
    • (1992) AI Magazine , vol.12 , Issue.1
    • Kumar, V.1
  • 9
    • 0003716288 scopus 로고    scopus 로고
    • Multiagent coordination in tightly coupled task scheduling
    • Liu, J., and Sycara, K. 1996. Multiagent coordination in tightly coupled task scheduling. In Proc. of ICMAS.
    • (1996) Proc. of ICMAS.
    • Liu, J.1    Sycara, K.2
  • 10
    • 84871845523 scopus 로고    scopus 로고
    • Determining successful negotiation strategies: An evolutionary approach
    • Matos, N.; Sierra, C.; and Jennings, N. 1998. Determining successful negotiation strategies: An evolutionary approach. In Proceedings of ICMAS.
    • (1998) Proceedings of ICMAS
    • Matos, N.1    Sierra, C.2    Jennings, N.3
  • 11
    • 84914354863 scopus 로고
    • Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method
    • Minton, S.; Johnston, M. D.; Philips, A.; and Laird, P. 1990. Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method. In Proc. of AAAI.
    • (1990) Proc. of AAAI.
    • Minton, S.1    Johnston, M. D.2    Philips, A.3    Laird, P.4
  • 12
    • 0001772851 scopus 로고    scopus 로고
    • Negotiation through argumentation — a preliminary report
    • Parsons, S., and Jennings, N. R. 1996. Negotiation through argumentation — a preliminary report. In Proc. of ICMAS.
    • (1996) Proc. of ICMAS.
    • Parsons, S.1    Jennings, N. R.2
  • 14
    • 84962121969 scopus 로고    scopus 로고
    • Computational dialectics for argument-based agent systems
    • Sawamura, H.; Umeda, Y.; and Meyer, R. 2000. Computational dialectics for argument-based agent systems. In Proc. of ICMAS.
    • (2000) Proc. of ICMAS.
    • Sawamura, H.1    Umeda, Y.2    Meyer, R.3
  • 16
    • 0033312576 scopus 로고    scopus 로고
    • The benefits of arguing in a team
    • Tambe, M., and Jung, H. 1999. The benefits of arguing in a team. AI Magazine 20(4).
    • (1999) AI Magazine , vol.20 , Issue.4
    • Tambe, M.1    Jung, H.2
  • 21
    • 85017332139 scopus 로고    scopus 로고
    • Distributed constraint satisfaction algorithm for complex local problems
    • Yokoo, M., and Hirayama, K. 1998. Distributed constraint satisfaction algorithm for complex local problems. In Proc. of ICMAS.
    • (1998) Proc. of ICMAS.
    • Yokoo, M.1    Hirayama, K.2


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