SODA

Reasoning about procedural programs in a chess ending

Rayner, Manny and Hugosson, Åsa (1988) Reasoning about procedural programs in a chess ending. [SICS Report]

[img]
Preview
PDF
1407Kb

Abstract

We demonstrate how to reason about plans by treating them as programs expressed in a simple imperative language, and illustrate this using an example originally suggested by McCarthy and later discussed at length by McDermott. A detailed correctness proof is provided, which it is argued is greatly superior to McDermott's.

Item Type:SICS Report
Additional Information:Original report number R88003. Related paper, "Reasoning about Plans Represented as Procedural Programs" located in Artificial Intelligence III: Methodology, Systems, Applications; Proceedings of the Third International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA '88), Varna, Bulgaria, 1988, pp. 93-102. T. O'Shea and V. Sgurev, editors, North-Holland Press.
ID Code:2545
Deposited By:Vicki Carleson
Deposited On:17 Sep 2009
Last Modified:18 Nov 2009 16:10

Repository Staff Only: item control page