Reasoning about actions with loops via Hoare logic
From MaRDI portal
Publication:1712544
DOI10.1007/s11704-016-5158-6zbMath1403.68267OpenAlexW2411931905MaRDI QIDQ1712544
Publication date: 22 January 2019
Published in: Frontiers of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11704-016-5158-6
Related Items
Cites Work
- Applicability conditions for plans with loops: computability results and algorithms
- Plan aggregation for strong cyclic planning in nondeterministic domains
- A new representation and associated algorithms for generalized planning
- On the semantics of deliberation in IndiGolog -- from theory to implementation
- Weak, strong, and strong cyclic planning via symbolic model checking
- Verification of sequential and concurrent programs
- Proof systems for planning under 0-approximation semantics
- Representing action: indeterminacy and ramifications
- Computational complexity of planning and approximate planning in the presence of incompleteness
- Ability and knowing how in the situation calculus
- Logic programming and reasoning with incomplete information
- Answer Set Programming and Planning with Knowledge and World-Altering Actions in Multiple Agent Domains
- Ten Years of Hoare's Logic: A Survey—Part I
- Soundness and Completeness of an Axiom System for Program Verification
- Representing action and change by logic programs
- Provably correct theories of action
- Knowledge compilation and theory approximation
- Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming
- An axiomatic basis for computer programming
- Formalizing sensing actions -- a transition function based approach
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Reasoning about actions with loops via Hoare logic
