Bounded-Resource Reasoning as (Strong or Classical) Planning

DOI10.1007/978-3-642-02734-5_6MaRDI QIDQ3393381zbMATH OpenOpenAlexWikidataFDO

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

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

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

Recommendations

• Verifying Space and Time Requirements for Resource-Bounded Agents
• Time and Space Bounds for Planning
• Using abstract resources to control reasoning
• scientific article; zbMATH DE number 2090953
• Computational Science and Its Applications – ICCSA 2004

Cites work

• A deductive solution for plan generation
• scientific article; zbMATH DE number 3274715 (Why is no real title available?)
• Space Complexity in Propositional Calculus
• The intractability of resolution
• Using temporal logics to express search control knowledge for planning
• Weak, strong, and strong cyclic planning via symbolic model checking

Cited in

(7)

• On composition of bounded-recall plans
• How to (plan to) meet a deadline between \textit{now} and \textit{then}
• A study of a dynamic progressive reasoning system
• scientific article; zbMATH DE number 1857494 (Why is no real title available?)
• Verifying Space and Time Requirements for Resource-Bounded Agents
• Computational Science and Its Applications – ICCSA 2004
• An intelligent system combining different resource-bounded reasoning techniques

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3393381)