Reasoning about procedural programs in a chess ending 1988 (English)Report (Other academic)

Abstract [en]

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.

Place, publisher, year, edition, pages

Kista, Sweden: Swedish Institute of Computer Science , 1988, 1. , p. 15

Series

SICS Research Report, ISSN 0283-3638 ; R88:03

National Category

Computer and Information Sciences

Identifiers

URN: urn:nbn:se:ri:diva-22206OAI: oai:DiVA.org:ri-22206DiVA, id: diva2:1041750

Note

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.

Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2018-02-02Bibliographically approved

Open Access in DiVA

By organisation

SICS

On the subject

Computer and Information Sciences

Search outside of DiVA

GoogleGoogle ScholarTotal: 74 downloadsTotal: 54 hits