Applicability conditions for plans with loops: computability results and algorithms

DOI10.1016/j.artint.2012.07.005zbMath1270.68277OpenAlexW2142369383MaRDI QIDQ359973

Shlomo Zilberstein, Siddharth Srivastava

Publication date: 23 August 2013

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

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0004370212000914

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Applicability conditions for plans with loops: computability results and algorithms ⋮ Knowledge-based programs as building blocks for planning ⋮ Reasoning about actions with loops via Hoare logic ⋮ A new representation and associated algorithms for generalized planning

Cites Work

• Unnamed Item
• Unnamed Item
• Applicability conditions for plans with loops: computability results and algorithms
• A new representation and associated algorithms for generalized planning
• Weak, strong, and strong cyclic planning via symbolic model checking
• The computational complexity of propositional STRIPS planning
• Transition graphs and the star-height of regular events
• STRIPS: A new approach to the application of theorem proving to problem solving
• How to Program an Infinite Abacus
• Guarded commands, nondeterminacy and formal derivation of programs
• An axiomatic basis for computer programming

This page was built for publication: Applicability conditions for plans with loops: computability results and algorithms