A new deductive approach to planning

DOI10.1007/BF03037518zbMath0711.68026MaRDI QIDQ922685

Steffen Hölldobler, Josef Schneeberger

Publication date: 1990

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

zbMATH Keywords

equational reasoningHorn clauseslogic programmingdeductive planning

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Logic programming (68N17)

Related Items

Doctoral Consortium Extended Abstract: Planning with Concurrent Transaction Logic ⋮ Default reasoning by deductive planning ⋮ A history based approximate epistemic action theory for efficient postdictive reasoning ⋮ Ramification and causality ⋮ Event calculus and temporal action logics compared ⋮ Situational Calculus, linear connection proofs and STRIPS-like planning: An experimental comparison ⋮ John McCarthy's legacy ⋮ A semantic characterization of a useful fragment of the situation calculus with knowledge ⋮ Reasoning about actions: steady versus stabilizing state constraints ⋮ Let's plan it deductively! ⋮ On linear logic planning and concurrency ⋮ The qualification problem: A solution to the problem of anomalous models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A deductive solution for plan generation
• On the satisfiability of circumscription
• Planning for conjunctive goals
• Linearity and plan generation
• Foundations of equational logic programming
• Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
• A theory of complete logic programs with equality
• Extending SLD resolution to equational horn clauses using E-unification
• On solving equations and disequations