Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 21
Number of items: 21
  • Open Access
    Bachor, P., Dekker, P. M., & Behnke, G. (2025). Is This Plan Necessarily Redundant? On the Computational Complexity of Unobserved Domain Learning. In D. Harabor, & M. Ramirez (Eds.), Proceedings of the Thirty-Fifth International Conference on Automated Planning and Scheduling: November 9-14, 2025, Melbourne, Victoria, Australia (pp. 11-20). (ICAPS; Vol. 35). AAAI Press. https://doi.org/10.1609/icaps.v35i1.36096
  • Open Access
    Behnke, G., Gattinger, M., Wang, H., & Ghosh, A. (2025). Comparing State-Representations for DEL Model Checking. Electronic Proceedings in Theoretical Computer Science, 437, 233-250. https://doi.org/10.4204/EPTCS.437.21
  • Open Access
    Dekker, P. M., & Behnke, G. (2025). Hardness of Chosen Length Planning Games and Regular Fixed Methods FOND HTN Planning. In D. Harabor, & M. Ramirez (Eds.), Proceedings of the Thirty-Fifth International Conference on Automated Planning and Scheduling: November 9-14, 2025, Melbourne, Victoria, Australia (pp. 45-53). (ICAPS; Vol. 35). AAAI Press. https://doi.org/10.1609/icaps.v35i1.36100
  • Open Access
    Dekker, M., & Behnke, G. (2024). Barely Decidable Fragments of Planning. In U. Endriss, F. S. Melo, K. Bach, A. Bugarín-Diz, J. M. Alonso-Moral, S. Barro, & F. Heintz (Eds.), ECAI 2024: 27th European Conference on Artificial Intelligence, 19–24 October 2024, Santiago de Compostela, Spain : including 13th Conference on Prestigious Applications of Intelligent Systems (PAIS 2024) : proceedings (pp. 4198-4206). (Frontiers in Artificial Intelligence and Applications; Vol. 392). IOS Press. https://doi.org/10.3233/FAIA240992
  • Open Access
    Behnke, G., & Steinmetz, M. (2024). On the Computational Complexity of Stackelberg Planning and Meta-Operator Verification. In S. Bernardini, & C. Muise (Eds.), Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling: June 1–6, 2024, Alberta, Canada (pp. 20-24). (ICAPS; Vol. 34). AAAI Press. https://doi.org/10.1609/icaps.v34i1.31456
  • Open Access
    Taitler, A., Alford, R., Espasa, J., Behnke, G., Fišer, D., Gimelfarb, M., Pommerening, F., Sanner, S., Scala, E., Schreiber, D., Segovia-Aguas, J., & Seipp, J. (2024). The 2023 International Planning Competition. AI Magazine, 45(2), 280-296. https://doi.org/10.1002/aaai.12169
  • Open Access
    Behnke, G. (2024). Symbolic Reasoning Methods for AI Planning. In M. Wooldridge, J. Dy, & S. Natarajan (Eds.), Proceedings of the 38th AAAI Conference on Artificial Intelligence: AAAI-2024 (Vol. 20, pp. 22661). AAAI Press. https://doi.org/10.1609/aaai.v38i20.30277
  • Open Access
    Bachor, P., & Behnke, G. (2024). Learning Planning Domains from Non-redundant Fully-Observed Traces: Theoretical Foundations and Complexity Analysis. In M. Wooldridge, J. Dy, & S. Natarajan (Eds.), Proceedings of the 38th AAAI Conference on Artificial Intelligence: AAAI-2024 (Vol. 18, pp. 20028-20035). AAAI Press. https://doi.org/10.1609/aaai.v38i18.29980
  • Lin, S., Behnke, G., Ondrčková, S., Barták, R., & Bercher, P. (2023, March 7). Experimental Results for the AAAI 2023 Paper "On Total-Order HTN Plan Verification with Method Preconditions -- An Extension of the CYK Parsing Algorithm" [Data set]. Zenodo. https://doi.org/10.5281/zenodo.7704558
  • Open Access
    Lin, S., Behnke, G., Ondrčková, S., Barták, R., & Bercher, P. (2023). On Total-Order HTN Plan Verification with Method Preconditions: An Extension of the CYK Parsing Algorithm. In B. Williams, Y. Chen, & J. Neville (Eds.), Proceedings of the 37th AAAI Conference on Artificial Intelligence: AAAI-2023 : Washington, DC, USA, February 7-14, 2023 (Vol. 10, pp. 12041–12048). AAAI Press. https://doi.org/10.1609/aaai.v37i10.26420
Page 1 of 3