Solving planning problems by partial deduction

DOI10.1007/3-540-44404-1_29MaRDI QIDQ2767038zbMATH OpenFDO

Authors Helko Lehmann, Michael Leuschel

Publication date 22 July 2002

Published in Lecture Notes in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44404-1_29

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• A new deductive approach to planning
• scientific article; zbMATH DE number 1882043
• Linear deductive planning
• Computational Logic in Multi-Agent Systems
• Solving the entailment problem in the fluent calculus using binary decision diagrams

Cited in

(9)

• Partial-order planning: Evaluating possible efficiency gains
• Solving the entailment problem in the fluent calculus using binary decision diagrams
• Intelligent Backtracking in Plan-Based Deduction
• scientific article; zbMATH DE number 1748581 (Why is no real title available?)
• scientific article; zbMATH DE number 1882043 (Why is no real title available?)
• Artificial Intelligence and Symbolic Computation
• Computational Logic in Multi-Agent Systems
• A deductive solution for plan generation
• A new deductive approach to planning

Describes a project that uses

Uses Software

• ECCE

This page was built for publication: Solving planning problems by partial deduction

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