메뉴 건너뛰기




Volumn 11, Issue 4, 1995, Pages 625-655

COMPLEXITY RESULTS FOR SAS+ PLANNING

Author keywords

algorithms; computational complexity; planning; simplified action structures

Indexed keywords

ALGORITHMS; CONTROL SYSTEMS; FORMAL LOGIC; LEARNING SYSTEMS; PLANNING;

EID: 0029405902     PISSN: 08247935     EISSN: 14678640     Source Type: Journal    
DOI: 10.1111/j.1467-8640.1995.tb00052.x     Document Type: Article
Times cited : (418)

References (31)
  • 1
    • 84990601623 scopus 로고
    • Reasoning about interdependent actions. Licentiate Thesis, Department of Computer and Information Science, Linköping University, Linköping, Sweden
    • (1988) , pp. 139
    • Bäckström, C.1
  • 3
    • 84990627633 scopus 로고
    • Computational Complexity of Reasoning about Plans. Doctoral dissertation, Linkoping University, Linköping, Sweden
    • (1992)
    • Bäckström, C.1
  • 4
    • 4243214234 scopus 로고
    • In Proceedings of the 3rd International Conference on Principles on Knowledge Representation and Reasoning (KR‐92). Edited by, B. Swartout, B. Nebel, Morgan Kaufmann, Cambridge, MA. pp.
    • (1992) + planning , pp. 126-137
    • Bäckström, C.1
  • 6
    • 84990601612 scopus 로고
    • Expressive equivalence of planning formalisms. Artificial Intelligence, Special Issue on Planning and Scheduling. (In press).
    • (1994)
    • Bäckström, C.1
  • 7
    • 84990594706 scopus 로고
    • Planning using transformation between equivalent formalisms: A case study of efficiency. In Comparative Analysis of AI Planning Systems. Edited by,. Published in conjunction with AAAI‐94.
    • (1994)
    • Bäckström, C.1    Wilkins, D.2
  • 11
    • 0040258260 scopus 로고
    • In Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI‐94). Edited by, R. Reiter, J. Mylopoulos, Morgan Kaufmann, Sydney, Australia, pp.
    • (1991) Complexity results for planning , pp. 274-279
    • Bylander, T.1
  • 13
    • 0026986406 scopus 로고
    • Complexity results for serial decomposability. In Proceedings of the 10th (US) National Conference on Artificial Intelligence (AAAI‐92), San Jose, CA, pp.
    • (1992) , pp. 729-734
    • Bylander, T.1
  • 17
    • 0026961831 scopus 로고
    • On the complexity of domain‐independent planning. In Proceedings of the 10th (US) National Conference on Artificial Intelligence (AAAI‐92), pp.
    • (1992) , pp. 381-386
    • Erol, K.1    Nau, D.S.2    Subrahmanian, V.S.3
  • 25
    • 84990561330 scopus 로고
    • Tractable planning with state variables by exploiting structural restrictions. In Proceedings of the 12th (US) National Conference on Artificial Intelligence (AAAI‐94).
    • (1994)
    • Jonsson, P.1    Bäckström, C.2
  • 27
    • 84990621510 scopus 로고
    • Automatic Synthesis of Sequential Control Charts. Doctoral dissertation, Linkoping University, Linkbping, Sweden
    • (1993)
    • Klein, I.1
  • 30
    • 84990628630 scopus 로고
    • Editors.,. Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI‐91). Morgan Kaufmann, Sydney, Australia.
    • (1991)
    • Reiter, R.1    Mylopoulos, J.2


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