Optimal Partial-Order Plan Relaxation via MaxSAT

DOI10.1613/jair.5128zbMath1386.68155OpenAlexW2540405007MaRDI QIDQ2821448

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

Publication date: 21 September 2016

Published in: Journal of Artificial Intelligence Research (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)

Related Items (4)

Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets ⋮ A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions ⋮ A faster tree-decomposition based algorithm for counting linear extensions ⋮ Proofs and Certificates for Max-SAT

This page was built for publication: Optimal Partial-Order Plan Relaxation via MaxSAT