Proof systems for planning under 0-approximation semantics

DOI10.1007/S11432-013-4854-1zbMATH Open1343.68222OpenAlexW2010431601MaRDI QIDQ893736FDOQ893736

Authors: Yuping Shen, Xishun Zhao 

Publication date: 20 November 2015

Published in: Science China Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-013-4854-1

Recommendations

• Reasoning about actions with loops via Hoare logic
• scientific article; zbMATH DE number 1980936
• A logic programming approach to knowledge-state planning, semantics and complexity
• Logic Programming and Nonmonotonic Reasoning
• Computational complexity of planning and approximate planning in the presence of incompleteness

zbMATH Keywords

automated reasoningplan verificationHoare proof systemsoff-line planningplan generation

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• GOLOG: A logic programming language for dynamic domains
• Title not available (Why is that?)
• Computational Complexity
• FLUX: A logic programming method for reasoning agents
• An axiomatic basis for computer programming
• How to progress a database
• Title not available (Why is that?)
• Knowledge, action, and the frame problem
• Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
• Proceedings of the 1st international workshop on Symbolic model checking (SMC '99), as part of the 2nd federated logic conference (FLoC '99). Trento, Italy, July 6, 1999
• 25 years of model checking. History, achievements, perspectives
• Handbook of automated reasoning. In 2 vols
• Verification of sequential and concurrent programs
• Title not available (Why is that?)
• Approximation of action theories and its application to conformant planning
• Computational complexity of planning and approximate planning in the presence of incompleteness
• Title not available (Why is that?)
• Formalizing sensing actions -- a transition function based approach
• Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming
• Understanding planning with incomplete information and sensing
• Provably correct theories of action
• Logical verification of scientific discovery
• Conditional Planning with External Functions

Cited In (2)

• Reasoning about actions with loops via Hoare logic
• A correctness result for synthesizing plans with loops in stochastic domains

Uses Software

• GOLOG

This page was built for publication: Proof systems for planning under 0-approximation semantics

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