Change search
ReferencesLink to record
Permanent link

Direct link
Reasoning about procedural programs in a chess ending
Number of Authors: 2
1988 (English)Report (Refereed)
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. , 15 p.
SICS Research Report, ISSN 0283-3638 ; R88:03
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-22206OAI: diva2:1041750
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

Open Access in DiVA

fulltext(1407 kB)2 downloads
File information
File name FULLTEXT01.pdfFile size 1407 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 2 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link