SCOPUS 정보 검색 플랫폼

ICAPS 2010 - Proceedings of the 20th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2010, Pages 153-160

Constraint propagation in propositional planning

(2) Sideris, Andreas a Dimopoulos, Yannis a

Author keywords

[No Author keywords available]

Indexed keywords

BLACK BOXES; CONSTRAINT PROPAGATION; DIFFERENT TIME STEPS; ENCODINGS; MUTUAL EXCLUSIONS; PLANNING GRAPHS; PROPOSITIONAL PLANNING; PROPOSITIONAL SATISFIABILITY; SAT SOLVERS; SATISFIABILITY; THEORETICAL RESULT;

ENCODING (SYMBOLS); SCHEDULING;

FORMAL LOGIC;

EID: 78149273170 PISSN: None EISSN: None Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper

Times cited : (21)

References (12)

1
- 78650600115
- P{re,ic}oSAT@SC'09
- Biere, A. 2009. P{re,ic}oSAT@SC'09. In SAT Competition 2009, http://fmv.jku.ar/precosat/.
- (2009) SAT Competition 2009
- Biere, A.¹

2
- 0031074857
- Fast planning through planning graph analysis
- Blum, A., and Furst, M. L. 1997. Fast planning through planning graph analysis. Artif. Intell. 90(1-2):281-300.
- (1997) Artif. Intell. , vol.90 , Issue.1-2 , pp. 281-300
- Blum, A.¹ Furst, M.L.²

3
- 57749092639
- Long-distance mutual exclusion for planning
- Chen, Y.; Huang, R.; Xing, Z.; and Zhang, W. 2009. Long-distance mutual exclusion for planning. Artif. Intell. 173(2).
- (2009) Artif. Intell. , vol.173 , Issue.2
- Chen, Y.¹ Huang, R.² Xing, Z.³ Zhang, W.⁴

4
- 84880886806
- Long-distance mutual exclusion for propositional planning
- Chen, Y.; Xing, Z.; and Zhang, W. 2007. Long-distance mutual exclusion for propositional planning. In IJCAI, 1840-1845.
- (2007) IJCAI , pp. 1840-1845
- Chen, Y.¹ Xing, Z.² Zhang, W.³

5
- 21444441175
- An extensible sat-solver
- Een, N., and Sorensson, N. 2003. An extensible sat-solver. In SAT 2003.
- (2003) SAT 2003
- Een, N.¹ Sorensson, N.²

6
- 13444312272
- Planning graphs and knowledge compilation
- Geffner, H. 2004. Planning graphs and knowledge compilation. In ICAPS, 52-62.
- (2004) ICAPS , pp. 52-62
- Geffner, H.¹

7
- 60549086221
- Concise finite-domain representations for PDDL planning tasks
- Helmert, M. 2009. Concise finite-domain representations for PDDL planning tasks. Artif. Intell. 173(5-6):503-535.
- (2009) Artif. Intell. , vol.173 , Issue.5-6 , pp. 503-535
- Helmert, M.¹

8
- 84880681440
- Unifying sat-based and graph-based planning
- Kautz, H. A., and Selman, B. 1999. Unifying sat-based and graph-based planning. In IJCAI, 318-325.
- (1999) IJCAI , pp. 318-325
- Kautz, H.A.¹ Selman, B.²

9
- 38349080397
- SAT-PLAN: Planning as satisfiability
- Kautz, H. A.; Selman, B.; and Hoffmann, J. 2006. SAT-PLAN: Planning as satisfiability. In Booklet of the 5th Planning Competition.
- (2006) Booklet of the 5th Planning Competition
- Kautz, H.A.¹ Selman, B.² Hoffmann, J.³

10
- 78650613101
- Planning graphs and propositional clause-learning
- Rintanen, J. 2008. Planning graphs and propositional clause-learning. In KR, 535-543.
- (2008) KR , pp. 535-543
- Rintanen, J.¹

11
- 78149277851
- SAT-based parallel planning using a split representation of actions
- Robinson, N.; Gretton, C.; Pham, D. N.; and Sattar, A. 2009. SAT-based parallel planning using a split representation of actions. In ICAPS.
- (2009) ICAPS
- Robinson, N.¹ Gretton, C.² Pham, D.N.³ Sattar, A.⁴

12
- 17644413475
- M.Sc. Thesis, Simon Fraser University
- Ryan, L. 2003. Efficient algorithms for clause-learning sat solvers. In M.Sc. Thesis, Simon Fraser University.
- (2003) Efficient Algorithms for Clause-learning Sat Solvers
- Ryan, L.¹

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