메뉴 건너뛰기
Proceedings of the National Conference on Artificial Intelligence
Volumn 2, Issue , 2005, Pages 578-583
Using SAT and logic programming to design polynomial-time algorithms for planning in non-deterministic domains
Author keywords

[No Author keywords available]
Indexed keywords

COMPUTATIONAL COMPLEXITY; LOGIC PROGRAMMING; POLYNOMIALS;
EID: 29344433294     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (4)
References (10)
  • 1
    • 29344462786 scopus 로고    scopus 로고
    • A polynomial time algorithm for constructing k-maintainable policies
    • Baral, C., and Eiter, T. 2004. A polynomial time algorithm for constructing k-maintainable policies. In Proc. ICAPS'04, 720-730.
    • (2004) Proc. ICAPS'04 , pp. 720-730
    • Baral, C.1    Eiter, T.2
  • 2
    • 33744474877 scopus 로고    scopus 로고
    • Goal specification in presence of non-deterministic actions
    • Baral, C., and Zhao, J. 2004 Goal specification in presence of non-deterministic actions. In ECAI 2004, pp. 272-277.
    • (2004) ECAI 2004 , pp. 272-277
    • Baral, C.1    Zhao, J.2
  • 3
    • 0038517219 scopus 로고    scopus 로고
    • Weak, strong, and strong cyclic planning via symbolic model checking
    • Cimatti, A.; Pistore, M.; Roveri, M.; and Traverso, P. 2003. Weak, strong, and strong cyclic planning via symbolic model checking. AIJ 147(1-2):35-84.
    • (2003) AIJ , vol.147 , Issue.1-2 , pp. 35-84
    • Cimatti, A.1    Pistore, M.2    Roveri, M.3    Traverso, P.4
  • 4
    • 0036927344 scopus 로고    scopus 로고
    • Planning with a language for extended goals
    • Dal Lago, U.; Pistore, M.; and Traverso, P. 2002. Planning with a language for extended goals. In AAAI'02, 447-454.
    • (2002) AAAI'02 , pp. 447-454
    • Dal Lago, U.1    Pistore, M.2    Traverso, P.3
  • 5
    • 0038062314 scopus 로고    scopus 로고
    • Complexity and expressive power of logic programming
    • Dantsin, E.; Eiter, T.; Gottlob, G.; and Voronkov, A. 2001. Complexity and expressive power of logic programming. ACM Comp. Surveys 33(3):374-425.
    • (2001) ACM Comp. Surveys , vol.33 , Issue.3 , pp. 374-425
    • Dantsin, E.1    Eiter, T.2    Gottlob, G.3    Voronkov, A.4
  • 6
    • 0021509216 scopus 로고
    • Linear-time algorithms for testing the satisfiability of propositional horn theories
    • Cowling, W., and Gallier, J. H. 1984. Linear-time algorithms for testing the satisfiability of propositional Horn theories. Journal of Logic Programming 3:267-284.
    • (1984) Journal of Logic Programming , vol.3 , pp. 267-284
    • Cowling, W.1    Gallier, J.H.2
  • 7
    • 77951505493 scopus 로고
    • Classical negation in logic programs and disjunctive databases
    • Gelfond, M., and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9:365-385.
    • (1991) New Generation Computing , vol.9 , pp. 365-385
    • Gelfond, M.1    Lifschitz, V.2
  • 8
    • 0002303187 scopus 로고
    • Planning as Satisfiability
    • Kautz, H., and Selman, B. 1992. Planning as Satisfiability. In Proc. ECAI '92, pp. 359-363.
    • (1992) Proc. ECAI '92 , pp. 359-363
    • Kautz, H.1    Selman, B.2
  • 10
    • 0010122418 scopus 로고    scopus 로고
    • Extending and implementing the stable model semantics
    • Simons, P.; Niemelä, I.; and Soininen, T. 2002. Extending and implementing the stable model semantics. Art. Intelligence 138:181-234.
    • (2002) Art. Intelligence , vol.138 , pp. 181-234
    • Simons, P.1    Niemelä, I.2    Soininen, T.3

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