메뉴 건너뛰기




Volumn 4115 LNBI -III, Issue , 2006, Pages 211-222

Interest based negotiation automation

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATION; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; SOFTWARE AGENTS;

EID: 33749553122     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper
Times cited : (15)

References (14)
  • 5
    • 0036888791 scopus 로고    scopus 로고
    • Using similarity criteria to make issue trade-offs in automated negotiations
    • Faratin, P., Sierra, C., Jennings, N.R.: Using Similarity Criteria to Make Issue Trade-offs in Automated Negotiations. Journal of Artificial Intelligence, Vol. 142, No. 2 (2002) 205-237
    • (2002) Journal of Artificial Intelligence , vol.142 , Issue.2 , pp. 205-237
    • Faratin, P.1    Sierra, C.2    Jennings, N.R.3
  • 10
    • 0001548856 scopus 로고
    • A linear-time algorithm for testing the truth of certain quantified boolean formulas
    • Aspvall, B., Plass, M., Tarjan, R.: A Linear-time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas. Information Processing Letters (1979) 121-123
    • (1979) Information Processing Letters , pp. 121-123
    • Aspvall, B.1    Plass, M.2    Tarjan, R.3
  • 11
    • 4444314501 scopus 로고    scopus 로고
    • Optimal length tree-like resolution refutations for 2SAT formulas
    • Subramani, K.: Optimal Length Tree-Like Resolution Refutations for 2SAT Formulas. ACM Transactions on Computational Logic, Vol.5, No.2 (2004) 316-320
    • (2004) ACM Transactions on Computational Logic , vol.5 , Issue.2 , pp. 316-320
    • Subramani, K.1
  • 12
    • 84918983692 scopus 로고
    • A machine-oriented logic based on the resolution principle
    • Robinson, J.A.: A Machine-oriented Logic Based on the Resolution Principle. Journal of the ACM, Vol. 12 (1965) 23-41
    • (1965) Journal of the ACM , vol.12 , pp. 23-41
    • Robinson, J.A.1
  • 13
    • 0026940077 scopus 로고
    • On the complexity of propositional knowledge base revision, updates, and counterfactuals
    • Eiter, T., Gottlob, G.: On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals. Artificial Intelligence, Vol. 57, No. 2-3 (1992) 227-270
    • (1992) Artificial Intelligence , vol.57 , Issue.2-3 , pp. 227-270
    • Eiter, T.1    Gottlob, G.2
  • 14
    • 0031098932 scopus 로고    scopus 로고
    • A practical propositional knowledge base revision algorithm
    • Tao, X. H., Sun, W., Ma, S. H.: A Practical Propositional Knowledge Base Revision Algorithm. Journal of Computer Science and Technology, Vol.12, No.2 (1997) 154-159
    • (1997) Journal of Computer Science and Technology , vol.12 , Issue.2 , pp. 154-159
    • Tao, X.H.1    Sun, W.2    Ma, S.H.3


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