Proof systems for planning under 0-approximation semantics
From MaRDI portal
Publication:893736
DOI10.1007/s11432-013-4854-1zbMath1343.68222OpenAlexW2010431601MaRDI QIDQ893736
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
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation of action theories and its application to conformant planning
- Knowledge, action, and the frame problem
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
- Verification of sequential and concurrent programs
- 25 years of model checking. History, achievements, perspectives
- 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
- How to progress a database
- Computational complexity of planning and approximate planning in the presence of incompleteness
- Understanding planning with incomplete information and sensing
- GOLOG: A logic programming language for dynamic domains
- Provably correct theories of action
- Logical verification of scientific discovery
- Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming
- Computational Complexity
- Conditional Planning with External Functions
- An axiomatic basis for computer programming
- FLUX: A logic programming method for reasoning agents
- Formalizing sensing actions -- a transition function based approach
This page was built for publication: Proof systems for planning under 0-approximation semantics
