ESPRIT '88: Putting the Technology to Use : Proceedings of the 5th Annual ESPRIT Conference, Brussels, November 14-17, 1988, Part 2North-Holland, 1988 - 1759 pages |
From inside the book
Results 1-3 of 23
Page 1262
... interpreter on X. A = p ( f ( X ) , X , 1 ) H = p ( f ( 1 ) , Z , 2 ) : suspension on X for the same preceding reasons . A = p ( f ( X ) , X , 1 ) H = p ( f ( 1 ) ... interpreter . d ) properties of the PARLOG interpreter correctness : it 1262.
... interpreter on X. A = p ( f ( X ) , X , 1 ) H = p ( f ( 1 ) , Z , 2 ) : suspension on X for the same preceding reasons . A = p ( f ( X ) , X , 1 ) H = p ( f ( 1 ) ... interpreter . d ) properties of the PARLOG interpreter correctness : it 1262.
Page 1263
... interpreter correctness : it is clear that a PARLOG interpreter is correct in the sense that any solution it produces is a logical answer . This directly derives from the fact that a PARLOG interpreter is based on the SLD resolution ...
... interpreter correctness : it is clear that a PARLOG interpreter is correct in the sense that any solution it produces is a logical answer . This directly derives from the fact that a PARLOG interpreter is based on the SLD resolution ...
Page 1265
... interpreter to which we submit a couple program - goal as a construction of a subtree of the preceding and / or tree ... interpreter does not give the same solution at different executions of a given couple program - goal . However , if ...
... interpreter to which we submit a couple program - goal as a construction of a subtree of the preceding and / or tree ... interpreter does not give the same solution at different executions of a given couple program - goal . However , if ...
Contents
Client Design for the MULTOS Multimedia Office Filing System | 893 |
Speech Integration in an Office Demonstrator Project | 906 |
Natural Language Dialogue in an Office Environment Project | 917 |
Copyright | |
56 other sections not shown
Common terms and phrases
abstract Abstract Syntax Notation activities algorithm allows analysis application architecture basic block CACTUS CCITT cell CFRV client CNMA COMANDOS communication complex components Computer concept configuration data base database defined definition demonstration described Directory Service distributed document domain dynamic ECMA entities environment ESPRIT Project evaluation FAOR Figure formal FTAM functions gateway graphical hardware identified implementation input integration interaction internal language layer layout logical machine Mailbox manufacturing messages method methodology module node object operating system PANGLOSS performance Petri nets phase planning procedure production protocol query QUIPU requirements robot schema selected semantics server SGML simulation slot specification standard structure subnetwork subsystem task techniques THORN UNIX uptake User Agent User Interface user organisation WLib workcells workstation