A Near-optimal Method for Reasoning About Action
We give an algorithm for "before-after" reasoning about action. The algorithm decides satisfiability and validity of formulae of propositional dynamic logic, a recently developed logic of change of state that subsumes the zero-order component of most other action-oriented logics. The algor...
| 主要作者: | |
|---|---|
| 出版: |
2023
|
| 在线阅读: | https://hdl.handle.net/1721.1/148941 |