Bibliographische Detailangaben

Beteilige Person:	Hasida, Kôiti (VerfasserIn)
Format:	Buch
Sprache:	Englisch
Veröffentlicht:	Tokyo, Japan 1990
Schriftenreihe:	Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 579
Schlagwörter:	Logic programming
Abstract:	Abstract: "In most practical rather than idealized problem domains, due to partiality of information, some sort of constraint programming is required, rather than merely preferable as widely deemed. That is, information processing in such domains should be regarded as transformation of constraints. A method, called Dependency Propagation (DP), of transforming logic program is accordingly proposed as a way of execution in constraint programming rather than compilation in procedural programming. As such, DP is meant to subsume various procedural methods as approximations DP may first be regarded as a special case of unfold/fold transformation of logic programs, but later is extended by introducing transclausal variables and some related operations for local transformation. Also discussed is a general strategy for choosing the right operation depending upon the local computational context. Sentence comprehension and production are hypothesized to be transformation of constraints by a general procedure, Standard algorithms for processing context free languages are demonstrated to emerge from sentence processing by DP under context-free grammars. It is also shown that compound structures are also dealt with efficiently along the same line.
Umfang:	17 S.