ADL: exploring the middle ground between STRIPS and the situation calculus
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Artificial intelligence and mathematical theory of computation
Proving properties of states in the situation calculus
Artificial Intelligence
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
A Formal Proof of the Deadline Driven Scheduler
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Temporal reasoning in the situation calculus
Temporal reasoning in the situation calculus
Hi-index | 0.00 |
We illustrate the utility of the situation calculus for representing complex scheduling tasks by axiomatizing a deadline driven scheduler in the language. The actions arising in such a scheduler are examples of natural actions, as investigated in the concurrent situation calculus by Pinto (PhD thesis, 1994), and later by Reiter (Proc. Common Sense 96, 1996). Because the deadline driven scheduler is sequential, we must first suitably modify Reiter’s approach to natural actions so it applies to the sequential case. Having done this, we then show how the situation calculus axiomatization of this scheduler yields a very simple simulator in GOLOG, a situation calculus‐based logic programming language for dynamic domains.