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 50
Page 1275
... is-a-failure-tree (F) - has-a-failure-node (F). success-leaves-only #1–3 success
-leaves-only (F) then if F is a and/or tree ... all-success-nodes(L). all-success-
modes#1– all-success-nodes(L) then if L is a list of nodes then all the nodes are
...
... is-a-failure-tree (F) - has-a-failure-node (F). success-leaves-only #1–3 success
-leaves-only (F) then if F is a and/or tree ... all-success-nodes(L). all-success-
modes#1– all-success-nodes(L) then if L is a list of nodes then all the nodes are
...
Page 1276
suspended-node-on-yarā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 (N) then if N is a node then it is a failure
...
suspended-node-on-yarā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 (N) then if N is a node then it is a failure
...
Page 1279
instantiate-node–H3 instantiate-node (N, S, M) then if N is a node and S a
substitution then M is the node obtained after instantiation with S. instantiate-
node(N. S. M.) e= node N is nq(I, A. V. W), L-update(V, S, V1), L-instance(A, S, A1
), node M ...
instantiate-node–H3 instantiate-node (N, S, M) then if N is a node and S a
substitution then M is the node obtained after instantiation with S. instantiate-
node(N. S. M.) e= node N is nq(I, A. V. W), L-update(V, S, V1), L-instance(A, S, A1
), node M ...
What people are saying - Write a review
We haven't found any reviews in the usual places.
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 | |
57 other sections not shown
Other editions - View all
Common terms and phrases
abstract activities algorithm allows analysis application architecture basic CCITT CFRV client CNMA COMANDOS communication complex components concept database defined described Directory Discrete Cosine Transform distributed document processing domain entities environment ESPRIT Project evaluation factors FAOR Figure format functions gateway graphical hardware implementation input integration interaction internal invocation kernel language layout logical LOTOS machine manufacturing mapped Mbit/s messages method methodology module node object oriented office information system operating system packet PANGLOSS performance Petri nets phase planning possible predicates procedure processors production programming protocol query QUIPU reference requirements ring robot scheme selection semantics server SGML slot specification standard structure subnetworks subsystem task techniques token ring UCOL UNIX uptake user interface workcells workstation X Window System