메뉴 건너뛰기




Volumn 4670 LNCS, Issue , 2007, Pages 255-270

Multivalued action languages with constraints in CLP(FD)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; COMPUTER PROGRAMMING LANGUAGES;

EID: 38149127350     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74610-2_18     Document Type: Conference Paper
Times cited : (13)

References (17)
  • 3
    • 38149098358 scopus 로고    scopus 로고
    • Baral, C., Son, T.C., Tuan, L.C.: A Transition Function based Characterization of Actions with Delayed and Continuous Effects. In: KRR, Morgan Kaufmann, San Francisco (2002)
    • Baral, C., Son, T.C., Tuan, L.C.: A Transition Function based Characterization of Actions with Delayed and Continuous Effects. In: KRR, Morgan Kaufmann, San Francisco (2002)
  • 4
    • 27144559454 scopus 로고    scopus 로고
    • Dovier, A., Formisano, A., Pontelli, E.: A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, 3668, pp. 67-82. Springer, Heidelberg (2005)
    • Dovier, A., Formisano, A., Pontelli, E.: A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 67-82. Springer, Heidelberg (2005)
  • 5
    • 67651222010 scopus 로고    scopus 로고
    • Dovier, A., Formisano, A., Pontelli, E.: An Empirical Study of CLP and ASP Solutions of Combinatorial Problems. J. of Experimental & Theoretical Artificial Intelligence (2007)
    • Dovier, A., Formisano, A., Pontelli, E.: An Empirical Study of CLP and ASP Solutions of Combinatorial Problems. J. of Experimental & Theoretical Artificial Intelligence (2007)
  • 6
    • 38149093060 scopus 로고    scopus 로고
    • Gelfond, M., Lifschitz, V.: Action Languages. Elect. Trans. Artif. Intell. 2,193-210 (1998)
    • Gelfond, M., Lifschitz, V.: Action Languages. Elect. Trans. Artif. Intell. 2,193-210 (1998)
  • 7
  • 10
    • 84880774432 scopus 로고    scopus 로고
    • Generalizing GraphPlan by Formulating Planning as a CSP
    • Lopez, A., Bacchus, F.: Generalizing GraphPlan by Formulating Planning as a CSP. In: Proc. of IJCAI (2003)
    • (2003) Proc. of IJCAI
    • Lopez, A.1    Bacchus, F.2
  • 12
    • 38149063335 scopus 로고    scopus 로고
    • Phan, T., Son, TC, Pontelli, E.: CPP: a Constraint Logic Programming based Planner with Preferences. In: LPNMR, Springer, Heidelberg (2007)
    • Phan, T., Son, TC, Pontelli, E.: CPP: a Constraint Logic Programming based Planner with Preferences. In: LPNMR, Springer, Heidelberg (2007)
  • 13
    • 38149085871 scopus 로고    scopus 로고
    • Phan, T., Son, T.C., Baral, C.: Planning with Sensing Actions, Incomplete Information, and Static Causal Laws using Logic Programming. TPLP (to appear)
    • Phan, T., Son, T.C., Baral, C.: Planning with Sensing Actions, Incomplete Information, and Static Causal Laws using Logic Programming. TPLP (to appear)
  • 16
    • 84867805629 scopus 로고    scopus 로고
    • Planning with different forms of domain-dependent control knowledge
    • Eiter, T, Faber, W, Truszczyński, M, eds, LPNMR 2001, Springer, Heidelberg
    • Son, T.C., Baral, C., Mcllraith, S.A.: Planning with different forms of domain-dependent control knowledge. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 226-239. Springer, Heidelberg (2001)
    • (2001) LNCS (LNAI , vol.2173 , pp. 226-239
    • Son, T.C.1    Baral, C.2    Mcllraith, S.A.3
  • 17
    • 84888232617 scopus 로고    scopus 로고
    • Thielscher, M.: Reasoning about Actions with CHRs and Finite Domain Constraints. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, 2401, pp. 70-84. Springer, Heidelberg (2002)
    • Thielscher, M.: Reasoning about Actions with CHRs and Finite Domain Constraints. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, pp. 70-84. Springer, Heidelberg (2002)


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