Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 4
Number of items: 4
  • 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
    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
    Dekker, M., Kloibhofer, J., Marti, J., & Venema, Y. (2023). Proof Systems for the Modal μ-Calculus Obtained by Determinizing Automata. In R. Ramanayake, & J. Urban (Eds.), Automated Reasoning with Analytic Tableaux and Related Methods: 32nd International Conference, TABLEAUX 2023, Prague, Czech Republic, September 18–21, 2023 : proceedings (pp. 242-259). (Lecture Notes in Computer Science; Vol. 14278), (Lecture Notes in Artificial Intelligence). Springer. https://doi.org/10.1007/978-3-031-43513-3_14
Page of