Solving Simple Planning Problems with More Inference and No Search

DOI10.1007/11564751_50zbMath1153.68494OpenAlexW1500277292MaRDI QIDQ3524212

Vincent Vidal, Héctor Geffner

Publication date: 9 September 2008

Published in: Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11564751_50

Mathematics Subject Classification ID

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

Related Items (2)

Efficient symbolic search for cost-optimal planning ⋮ Landmark-based approaches for goal recognition as planning

Uses Software

• Walksat
• Siege
• CPlan
• Graphplan

This page was built for publication: Solving Simple Planning Problems with More Inference and No Search