PAZATN: A Linguistic Approach to Automatic Analysis of Elementary Programming Protocols
| dc.date.accessioned | 2004-10-04T14:47:45Z | |
| dc.date.accessioned | 2018-11-24T10:12:39Z | |
| dc.date.available | 2004-10-04T14:47:45Z | |
| dc.date.available | 2018-11-24T10:12:39Z | |
| dc.date.issued | 1976-12-01 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/6263 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/6263 | |
| dc.description.abstract | PATN is a design for a machine problem solver which uses an augmented transition network (ATN) to represent planning knowledge. In order to explore PATN's potential as a theory of human problem solving, a linguistic approach to protocol analysis is presented. An interpretation of a protocol is taken to be a parse tree supplemented by semantic and pragmatic annotation attached to various nodes. This paradigm has implications for constructing a cognitive model of the individual and designing computerized tutors. | en_US |
| dc.format.extent | 22902999 bytes | |
| dc.format.extent | 16771193 bytes | |
| dc.language.iso | en_US | |
| dc.title | PAZATN: A Linguistic Approach to Automatic Analysis of Elementary Programming Protocols | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| AIM-388.pdf | 16.77Mb | application/pdf | View/ |
| AIM-388.ps | 22.90Mb | application/postscript | View/ |