A deductive solution for plan generation

DOI10.1007/BF03037438zbMath0624.68079OpenAlexW2258046470MaRDI QIDQ578927

Wolfgang Bibel

Publication date: 1986

Published in: New Generation Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03037438

zbMATH Keywords

roboticsframe problem3-socks problemconnection methodrobot plan generationSkolem function

Mathematics Subject Classification ID

Related Items (16)

Doctoral Consortium Extended Abstract: Planning with Concurrent Transaction Logic ⋮ Strong planning under uncertainty in domains with numerous but identical elements (a generic approach) ⋮ Default reasoning by deductive planning ⋮ Linearity and plan generation ⋮ Ramification and causality ⋮ A new deductive approach to planning ⋮ Situational Calculus, linear connection proofs and STRIPS-like planning: An experimental comparison ⋮ Collaborative planning with confidentiality ⋮ John McCarthy's legacy ⋮ Generating plans in linear logic. I: Actions as proofs ⋮ Generating plans in linear logic. II: A geometry of conjunctive actions ⋮ Bounded-Resource Reasoning as (Strong or Classical) Planning ⋮ Let's plan it deductively! ⋮ Connection-based proof construction in linear logic ⋮ Connection methods in linear logic and proof nets construction ⋮ The qualification problem: A solution to the problem of anomalous models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linearity and plan generation
• Matings in matrices
• Toward automatic program synthesis

This page was built for publication: A deductive solution for plan generation