A new representation and associated algorithms for generalized planning

DOI10.1016/j.artint.2010.10.006zbMath1216.68253OpenAlexW2127972144MaRDI QIDQ543617

Siddharth Srivastava, Shlomo Zilberstein, Neil Immerman

Publication date: 17 June 2011

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2010.10.006

zbMATH Keywords

automated planningplan verificationplans with loops

Mathematics Subject Classification ID

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

Related Items (8)

Verification of agent navigation in partially-known environments ⋮ Applicability conditions for plans with loops: computability results and algorithms ⋮ Flexible FOND Planning with Explicit Fairness Assumptions ⋮ Agent planning programs ⋮ Reasoning about actions with loops via Hoare logic ⋮ Qualitative Numeric Planning: Reductions and Complexity ⋮ Abstraction for non-ground answer set programs ⋮ Computing programs for generalized planning using a classical planner

Uses Software

• GOLOG

Cites Work

• Unnamed Item
• Unnamed Item
• Applicability conditions for plans with loops: computability results and algorithms
• Weak, strong, and strong cyclic planning via symbolic model checking
• Programming by demonstration using version space algebra
• GOLOG: A logic programming language for dynamic domains
• Lazy abstraction
• Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings
• Verification, Model Checking, and Abstract Interpretation
• A survey on case-based planning

This page was built for publication: A new representation and associated algorithms for generalized planning