Bounded-Resource Reasoning as (Strong or Classical) Planning

DOI10.1007/978-3-642-02734-5_6zbMath1250.68240OpenAlexW1552225464WikidataQ57302188 ScholiaQ57302188MaRDI QIDQ3393381

Alexandre Albore, Brian Logan, Natasha Alechina, Chiara Ghidini, Piergiorgio Bertoli

Publication date: 20 August 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02734-5_6

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Agent technology and artificial intelligence (68T42)

Cites Work

• Unnamed Item
• A deductive solution for plan generation
• Weak, strong, and strong cyclic planning via symbolic model checking
• The intractability of resolution
• Using temporal logics to express search control knowledge for planning
• Space Complexity in Propositional Calculus

This page was built for publication: Bounded-Resource Reasoning as (Strong or Classical) Planning