Why Conniving is Better than Plannng
| dc.date.accessioned | 2004-10-04T14:45:37Z | |
| dc.date.accessioned | 2018-11-24T10:12:22Z | |
| dc.date.available | 2004-10-04T14:45:37Z | |
| dc.date.available | 2018-11-24T10:12:22Z | |
| dc.date.issued | 1972-04-01 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/6200 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/6200 | |
| dc.description.abstract | This paper is a critique of a computer programming language, Carl Hewitts PLANNER, a formalism designed especially to cope with the problems that Artificial Intelligence encounters. It is our contention that the backtrack control structure that is the backbone of PLANNER is particular, automatic backtracking encourages inefficient algorithms, conceals what is happening from the user, and misleads him with primitives having powerful names whose power is only superficial. An alternative, a programming language called CONNIVER which avoids these problems, is presented from the point of view of this critique. | en_US |
| dc.format.extent | 32 p. | en_US |
| dc.format.extent | 12163426 bytes | |
| dc.format.extent | 901800 bytes | |
| dc.language.iso | en_US | |
| dc.title | Why Conniving is Better than Plannng | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| AIM-255a.pdf | 901.8Kb | application/pdf | View/ |
| AIM-255a.ps | 12.16Mb | application/postscript | View/ |