Behrouz Babaki, Gilles Pesant
and Claude-Guy Quimper
Paper (2020)
An external link is available for this item
| Department: | Department of Computer Engineering and Software Engineering |
|---|---|
| PolyPublie URL: | https://publications.polymtl.ca/47234/ |
| Conference Title: | 13th International Symposium on Combinatorial Search (SOCS 2020) |
| Conference Location: | Vienna, Austria |
| Conference Date(s): | 2020-05-26 - 2020-05-28 |
| Editors: | Daniel Harabor and Mauro Vallati |
| Journal Title: | Proceedings of the International Symposium on Combinatorial Search (vol. 11, no. 1) |
| Publisher: | AAAI Press |
| DOI: | 10.1609/socs.v11i1.18529 |
| Official URL: | https://doi.org/10.1609/socs.v11i1.18529 |
| Date Deposited: | 18 Apr 2023 15:00 |
| Last Modified: | 25 Sep 2024 16:35 |
| Cite in APA 7: | Babaki, B., Pesant, G., & Quimper, C.-G. (2020, May). Solving Classical AI Planning Problems Using Planning-Independent CP Modeling and Search [Paper]. 13th International Symposium on Combinatorial Search (SOCS 2020), Vienna, Austria. Published in Proceedings of the International Symposium on Combinatorial Search, 11(1). https://doi.org/10.1609/socs.v11i1.18529 |
|---|---|
Statistics
Dimensions
Repository Staff Only
|
View Item |
