Design and validation of computer protocols
Design and validation of computer protocols
Model checking vs. theorem proving: a manifesto
Artificial intelligence and mathematical theory of computation
Between MDPs and semi-MDPs: a framework for temporal abstraction in reinforcement learning
Artificial Intelligence
Symbolic Model Checking
Effective Bayesian inference for stochastic programs
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
| Hi-index | 0.00 |
A logic allows one to express statements (axioms) that are, perhaps approximately, true of the world. A model is a particular object that is similar to, or "models", the world. For example, the growing field of model checking involves formal models of the behavior of physical computer chips. Bayesian networks, MPDs, and POMDPs are models of (real) probabilistic environments. This paper argues that world-modeling is more natural that world-axiomatizing. The main technical result is an algorithm for exactly computing the asymptotic average reward of a robot controller written in a high level programming language when run in a world model also defined in a high level language.