Optimal partial-order plan relaxation via MaxSAT

DOI10.1613/JAIR.5128MaRDI QIDQ2821448zbMATH OpenOpenAlexFDO

Authors Christian Muise, J. Christopher Beck, Sheila A. McIlraith

Publication date 21 September 2016

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

Full work available at URL https://doi.org/10.1613/jair.5128

Mathematics Subject Classification ID

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

Recommendations

• Mathematical programming models for optimizing partial-order plan flexibility
• scientific article; zbMATH DE number 1216125
• Partial-order planning: Evaluating possible efficiency gains
• A weighted CSP approach to cost-optimal planning
• Planning as satisfiability with IPC simple preferences and action costs

Cited in

(8)

• Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets
• scientific article; zbMATH DE number 1216125 (Why is no real title available?)
• A faster tree-decomposition based algorithm for counting linear extensions
• Proofs and Certificates for Max-SAT
• Max-SAT with cardinality constraint parameterized by the number of clauses
• Max-SAT with cardinality constraint parameterized by the number of clauses
• Improving plan execution flexibility using block-substitution
• A faster tree-decomposition based algorithm for counting linear extensions

This page was built for publication: Optimal partial-order plan relaxation via MaxSAT

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