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 52
Page 1275
... node ( N ) then if N is a node then this is a success node . is - a - success - node ( nd ( _ , true , nil , no - wait ) ) . suspended # 2 : suspended ( F , V ) then If F is a partial and / or tree then all the non success leaves of F ...
... node ( N ) then if N is a node then this is a success node . is - a - success - node ( nd ( _ , true , nil , no - wait ) ) . suspended # 2 : suspended ( F , V ) then If F is a partial and / or tree then all the non success leaves of F ...
Page 1276
... node - on - var # 2 : suspended - node - on - var ( N , V ) then if N is a node then N is suspended on the list of variables V. suspended - node - on - var ( nd__ , _ , V , _ ) , V ) = not equal ( V , nil ) . is - a - failure - node # 1 ...
... node - on - var # 2 : suspended - node - on - var ( N , V ) then if N is a node then N is suspended on the list of variables V. suspended - node - on - var ( nd__ , _ , V , _ ) , V ) = not equal ( V , nil ) . is - a - failure - node # 1 ...
Page 1279
... node # 3 : Instantiate - node ( N , S , M ) then if N is a node and Sa substitution then M is the node obtained after instantiation with S. instantiate - node ( N , S , M ) ← node N is nd ( I , A , V , W ) , L - update ( V , S , V1 ) ...
... node # 3 : Instantiate - node ( N , S , M ) then if N is a node and Sa substitution then M is the node obtained after instantiation with S. instantiate - node ( N , S , M ) ← node N is nd ( I , A , V , W ) , L - update ( V , S , V1 ) ...
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