Improving plan execution flexibility using block-substitution

DOI10.1613/JAIR.1.18587MaRDI QIDQ7306169zbMATH OpenFDO

Authors Sabah Binte Noor, Fazlul Hasan Siddiqui

Publication date 30 July 2026

Published in The Journal of Artificial Intelligence Research (JAIR) (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1613/JAIR.1.18587

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites work

• A Preprocessor for Max-SAT Solvers
• A unified framework for explanation-based generalization of partially ordered and partially instantiated plans
• An introduction to the planning domain definition language
• Concise finite-domain representations for PDDL planning tasks
• Continuing plan quality optimisation
• Core-boosted linear search for incomplete MaxSAT
• Fast planning through planning graph analysis
• scientific article; zbMATH DE number 1216125 (Why is no real title available?)
• scientific article; zbMATH DE number 1467489 (Why is no real title available?)
• Mathematical programming models for optimizing partial-order plan flexibility
• More than a name? on implications of preconditions and effects of compound HTN planning tasks
• Multi-contributor causal structures for planning: A formalization and evaluation
• Open-WBO: a modular MaxSAT solver
• Optimal partial-order plan relaxation via MaxSAT
• Principles and Practice of Constraint Programming – CP 2004
• STRIPS: A new approach to the application of theorem proving to problem solving
• The computational complexity of propositional STRIPS planning
• The LAMA planner: guiding cost-based anytime planning with landmarks

This page was built for publication: Improving plan execution flexibility using block-substitution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7306169)