Scheduling in the situation calculus: A case study

  • Authors:
  • Ray Reiter;Zheng Yuhua

  • Affiliations:
  • Department of Computer Science, University of Toronto, Toronto, Canada M5S 3G4E-mail: {reiter,zy}@cs.toronto.edu;Department of Computer Science, University of Toronto, Toronto, Canada M5S 3G4E-mail: {reiter,zy}@cs.toronto.edu

  • Venue:
  • Annals of Mathematics and Artificial Intelligence
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.