메뉴 건너뛰기




Volumn , Issue , 2008, Pages 272-279

Using constraint networks on Timelines to model and solve planning and scheduling problems

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; PROGRAMMING THEORY;

EID: 58849100493     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (18)

References (15)
  • 1
    • 0031074857 scopus 로고    scopus 로고
    • Fast Planning through Plan Graph Analysis
    • Blum, A., and Furst, M. 1997. Fast Planning through Plan Graph Analysis. Artificial Intelligence 90:281-300.
    • (1997) Artificial Intelligence , vol.90 , pp. 281-300
    • Blum, A.1    Furst, M.2
  • 3
    • 0035501435 scopus 로고    scopus 로고
    • Planning as Constraint Satisfaction: Solving the Planning-Graph by Compiling it into CSP
    • Do, M., and Kambhampati, S. 2001. Planning as Constraint Satisfaction: Solving the Planning-Graph by Compiling it into CSP. Artificial Intelligence 132(2): 151-182.
    • (2001) Artificial Intelligence , vol.132 , Issue.2 , pp. 151-182
    • Do, M.1    Kambhampati, S.2
  • 4
    • 2842560201 scopus 로고
    • STRIPS: A New Approach to the Application of Theorem Proving
    • Fikes, R., and Nilsson, N. 1971. STRIPS: a New Approach to the Application of Theorem Proving. Artificial Intelligence 2(3-4): 189-208.
    • (1971) Artificial Intelligence , vol.2 , Issue.3-4 , pp. 189-208
    • Fikes, R.1    Nilsson, N.2
  • 5
    • 0142185122 scopus 로고    scopus 로고
    • Constraint-Based Attribute and Interval Planning
    • Frank, J., and Jónson, A. 2003. Constraint-Based Attribute and Interval Planning. Constraints 8(4):339-364.
    • (2003) Constraints , vol.8 , Issue.4 , pp. 339-364
    • Frank, J.1    Jónson, A.2
  • 6
    • 0002303187 scopus 로고
    • Planning as Satisfiability
    • Kautz, H., and Selman, B. 1992. Planning as Satisfiability. In Proc. of ECAI-92, 359-363.
    • (1992) Proc. of ECAI-92 , pp. 359-363
    • Kautz, H.1    Selman, B.2
  • 7
    • 58849093951 scopus 로고    scopus 로고
    • Laburthe, F, and the OCRE project team. 2000. CHOCO: Implementing a CP Kernel. In Proc. of CP-00.
    • Laburthe, F, and the OCRE project team. 2000. CHOCO: Implementing a CP Kernel. In Proc. of CP-00.
  • 8
    • 0003780657 scopus 로고    scopus 로고
    • PDDL, the Planning Domain Definition Language
    • Technical report
    • McDermott, D. 1998. PDDL, the Planning Domain Definition Language. Technical report.
    • (1998)
    • McDermott, D.1
  • 9
    • 85135997562 scopus 로고
    • Dynamic Constraint Satisfaction Problems
    • Mittal, S., and Falkenhainer, B. 1990. Dynamic Constraint Satisfaction Problems. In Proc. of AAAI-90, 25-32.
    • (1990) Proc. of AAAI-90 , pp. 25-32
    • Mittal, S.1    Falkenhainer, B.2
  • 12
    • 84866939783 scopus 로고    scopus 로고
    • Decision upon Observations and Data Downloads by an Autonomous Earth Surveillance Satellite
    • Pralet, C., and Verfaillie, G. 2008. Decision upon Observations and Data Downloads by an Autonomous Earth Surveillance Satellite. In Proc. of i-SAIRAS-08.
    • (2008) Proc. of i-SAIRAS-08
    • Pralet, C.1    Verfaillie, G.2
  • 13
    • 0032596455 scopus 로고    scopus 로고
    • CPlan: A Constraint Programming Approach to Planning
    • van Beek, P., and Chen, X. 1999. CPlan: A Constraint Programming Approach to Planning. In Proc. of AAAI-99, 585-590.
    • (1999) Proc. of AAAI-99 , pp. 585-590
    • van Beek, P.1    Chen, X.2
  • 15
    • 31144445319 scopus 로고    scopus 로고
    • Branching and pruning: An Optimal Temporal POCL Planner Based on Constraint Programming
    • Vidal, V., and Geffner, H. 2006. Branching and pruning: An Optimal Temporal POCL Planner Based on Constraint Programming. Artificial Intelligence 170:298-335.
    • (2006) Artificial Intelligence , vol.170 , pp. 298-335
    • Vidal, V.1    Geffner, H.2


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