메뉴 건너뛰기




Volumn 13, Issue , 2000, Pages 305-338

Conformant Planning via Symbolic Model Checking

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0013365496     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.774     Document Type: Article
Times cited : (110)

References (44)
  • 1
    • 0001657540 scopus 로고
    • Fast planning through planning graph analysis
    • Blum, A. L., & Furst, M. L. (1995). Fast planning through planning graph analysis. In Proc. Ijcai.
    • (1995) Proc. Ijcai
    • Blum, A.L.1    Furst, M.L.2
  • 2
    • 0031074857 scopus 로고    scopus 로고
    • Fast planning through planning graph analysis
    • Blum, A. L., & Furst, M. L. (1997). Fast planning through planning graph analysis. Artificial Intelligence 1-2, 90, 279-298.
    • (1997) Artificial Intelligence 1-2 , vol.90 , pp. 279-298
    • Blum, A.L.1    Furst, M.L.2
  • 4
    • 0025558645 scopus 로고
    • Efficient Implementation of a BDD Package
    • Orlando, Florida. ACM/IEEE, IEEE Computer Society Press
    • Brace, K., Rudell, R., & Bryant, R. (1990). Efficient Implementation of a BDD Package. In 27th ACM/IEEE Design Automation Conference, pp. 40-45 Orlando, Florida. ACM/IEEE, IEEE Computer Society Press.
    • (1990) 27th ACM/IEEE Design Automation Conference , pp. 40-45
    • Brace, K.1    Rudell, R.2    Bryant, R.3
  • 5
    • 0022769976 scopus 로고
    • Graph-Based Algorithms for Boolean Function Manipulation
    • Bryant, R. E. (1986). Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8), 677-691.
    • (1986) IEEE Transactions on Computers , vol.C-35 , Issue.8 , pp. 677-691
    • Bryant, R.E.1
  • 6
    • 0026107125 scopus 로고
    • On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
    • Bryant, R. E. (1991). On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Transactions on Computers, 40(2), 205-213.
    • (1991) IEEE Transactions on Computers , vol.40 , Issue.2 , pp. 205-213
    • Bryant, R.E.1
  • 7
    • 0026913667 scopus 로고
    • Symbolic Boolean manipulation with ordered binary-decision diagrams
    • Bryant, R. E. (1992). Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3), 293-318.
    • (1992) ACM Computing Surveys , vol.24 , Issue.3 , pp. 293-318
    • Bryant, R.E.1
  • 9
    • 33846175636 scopus 로고
    • Acting optimally in partially observable stochastic domains
    • AAAI-Press
    • Cassandra, A., Kaelbling, L., & Littman, M. (1994). Acting optimally in partially observable stochastic domains. In Proc. of AAAI-94. AAAI-Press.
    • (1994) Proc. of AAAI-94
    • Cassandra, A.1    Kaelbling, L.2    Littman, M.3
  • 11
    • 84898684942 scopus 로고    scopus 로고
    • Planning via Model Checking: A Decision Procedure for AR
    • Steel, S., & Alami, R. (Eds.), Proceeding of the Fourth European Conference on Planning, Toulouse, France. Springer-Verlag. Also ITC-IRST Technical Report 9705-02, ITC-IRST Trento, Italy
    • Cimatti, A., Giunchiglia, E., Giunchiglia, F., & Traverso, P. (1997). Planning via Model Checking: A Decision Procedure for AR. In Steel, S., & Alami, R. (Eds.), Proceeding of the Fourth European Conference on Planning, No. 1348 in Lecture Notes in Artificial Intelligence, pp. 130-142 Toulouse, France. Springer-Verlag. Also ITC-IRST Technical Report 9705-02, ITC-IRST Trento, Italy.
    • (1997) Lecture Notes in Artificial Intelligence , vol.1348 , pp. 130-142
    • Cimatti, A.1    Giunchiglia, E.2    Giunchiglia, F.3    Traverso, P.4
  • 12
    • 0347348574 scopus 로고    scopus 로고
    • Conformant Planning via Model Checking
    • Biundo, S. (Ed.), Proceeding of the Fifth European Conference on Planning, United Kingdom. Springer-Verlag. Also ITC-IRST Technical Report 9908-01, ITC-IRST Trento, Italy
    • Cimatti, A., & Roveri, M. (1999). Conformant Planning via Model Checking. In Biundo, S. (Ed.), Proceeding of the Fifth European Conference on Planning, Lecture Notes in Artificial Intelligence Durham, United Kingdom. Springer-Verlag. Also ITC-IRST Technical Report 9908-01, ITC-IRST Trento, Italy.
    • (1999) Lecture Notes in Artificial Intelligence Durham
    • Cimatti, A.1    Roveri, M.2
  • 14
    • 0031620024 scopus 로고    scopus 로고
    • Automatic OBDD-based Generation of Universal Plans in Non-Deterministic Domains
    • Madison, Wisconsin. AAAI-Press. Also IRST-Technical Report 9801-10, Trento, Italy
    • Cimatti, A., Roveri, M., & Traverso, P. (1998a). Automatic OBDD-based Generation of Universal Plans in Non-Deterministic Domains. In Proceeding of the Fifteenth National Conference on Artificial Intelligence (AAAI-98) Madison, Wisconsin. AAAI-Press. Also IRST-Technical Report 9801-10, Trento, Italy.
    • (1998) Proceeding of the Fifteenth National Conference on Artificial Intelligence (AAAI-98)
    • Cimatti, A.1    Roveri, M.2    Traverso, P.3
  • 16
    • 0000289556 scopus 로고    scopus 로고
    • Formal methods: State of the art and future directions
    • Clarke, E. M., & Wing, J. M. (1996). Formal methods: State of the art and future directions. ACM Computing Surveys, 28(4), 626-643.
    • (1996) ACM Computing Surveys , vol.28 , Issue.4 , pp. 626-643
    • Clarke, E.M.1    Wing, J.M.2
  • 17
    • 0022706656 scopus 로고
    • Automatic verification of finite-state concurrent systems using temporal logic specifications
    • Clarke, E., Emerson, E., & Sistla, A. (1986). Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2), 244-263.
    • (1986) ACM Transactions on Programming Languages and Systems , vol.8 , Issue.2 , pp. 244-263
    • Clarke, E.1    Emerson, E.2    Sistla, A.3
  • 19
    • 0347978845 scopus 로고    scopus 로고
    • Strong Cyclic Planning Revisited
    • Biundo, S. (Ed.), Proceeding of the Fifth European Conference on Planning, United Kingdom. Springer-Verlag
    • Daniele, M., Traverso, P., & Vardi, M. Y. (1999). Strong Cyclic Planning Revisited. In Biundo, S. (Ed.), Proceeding of the Fifth European Conference on Planning, Lecture Notes in Artificial Intelligence Durham, United Kingdom. Springer-Verlag.
    • (1999) Lecture Notes in Artificial Intelligence Durham
    • Daniele, M.1    Traverso, P.2    Vardi, M.Y.3
  • 20
    • 0346087497 scopus 로고    scopus 로고
    • Automata-Theoretic Approach to Planning for Temporally Extended Goals
    • Biundo, S. (Ed.), Proceeding of the Fifth European Conference on Planning, United Kingdom. Springer-Verlag
    • De Giacomo, G., & Vardi, M. (1999). Automata-Theoretic Approach to Planning for Temporally Extended Goals. In Biundo, S. (Ed.), Proceeding of the Fifth European Conference on Planning, Lecture Notes in Artificial Intelligence Durham, United Kingdom. Springer-Verlag.
    • (1999) Lecture Notes in Artificial Intelligence Durham
    • De Giacomo, G.1    Vardi, M.2
  • 24
    • 0031220639 scopus 로고    scopus 로고
    • Representing action: Indeterminacy and ramifications
    • Giunchiglia, E., Kartha, G. N., & Lifschitz, V. (1997). Representing action: Indeterminacy and ramifications. Artificial Intelligence, 95(2), 409-438.
    • (1997) Artificial Intelligence , vol.95 , Issue.2 , pp. 409-438
    • Giunchiglia, E.1    Kartha, G.N.2    Lifschitz, V.3
  • 31
    • 0002529410 scopus 로고    scopus 로고
    • Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search
    • Kautz, H. A., & Selman, B. (1996). Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search. In Proc. AAAI-96.
    • (1996) Proc. AAAI-96
    • Kautz, H.A.1    Selman, B.2
  • 32
    • 0029333536 scopus 로고
    • An algorithm for probabilistic planning
    • Kushmerick, N., Hanks, S., & Weld, D. S. (1995). An algorithm for probabilistic planning. Artificial Intelligence, 76(1-2), 239-286.
    • (1995) Artificial Intelligence , vol.76 , Issue.1-2 , pp. 239-286
    • Kushmerick, N.1    Hanks, S.2    Weld, D.S.3
  • 34
    • 84990609972 scopus 로고
    • A critique of pure reason
    • McDermott, D. (1987). A critique of pure reason. Computational Intelligence, 3(3), 151-237.
    • (1987) Computational Intelligence , vol.3 , Issue.3 , pp. 151-237
    • McDermott, D.1
  • 36
    • 0346087488 scopus 로고
    • Machine Intelligence at Edinburgh
    • Edinburgh University Press
    • Michie, D. (1974). Machine Intelligence at Edinburgh. In On Machine Intelligence, pp. 143-155. Edinburgh University Press.
    • (1974) On Machine Intelligence , pp. 143-155
    • Michie, D.1
  • 38
    • 0013414269 scopus 로고    scopus 로고
    • Ph.D. thesis, Dept. Engineering-Economic Systems - Stanford University
    • Peot, M. (1998). Decision-Theoretic Planning. Ph.D. thesis, Dept. Engineering-Economic Systems - Stanford University.
    • (1998) Decision-Theoretic Planning
    • Peot, M.1
  • 39
  • 40
    • 84880670427 scopus 로고    scopus 로고
    • Improvements to the Evaluation of Quantified Boolean Formulae
    • Dean, T. (Ed.), Morgan Kaufmann Publishers
    • Rintanen, J. (1999b). Improvements to the Evaluation of Quantified Boolean Formulae. In Dean, T. (Ed.), 16th Iinternational Joint Conference on Artificial Intelligence, pp. 1192-1197. Morgan Kaufmann Publishers.
    • (1999) 16th Iinternational Joint Conference on Artificial Intelligence , pp. 1192-1197
    • Rintanen, J.1
  • 42
    • 0004000699 scopus 로고    scopus 로고
    • Department of Electrical and Computer Engineering - University of Colorado at Boulder
    • Somenzi, F. (1997). CUDD: CU Decision Diagram package - release 2.1.2. Department of Electrical and Computer Engineering - University of Colorado at Boulder.
    • (1997) CUDD: CU Decision Diagram Package - Release 2.1.2
    • Somenzi, F.1


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