C90-2049 Search is partially equivalent to marker passing . While marker passing involves
J91-1002 Relationships were determined by marker passing along the arcs in a knowledge
E89-1010 several types of links . A guided marker passing scheme is employed for inference
C02-1047 complex narratives , using a BN and marker passing for plan recognition . It automatically
E89-1010 resolution in a massively parallel marker passing paradigm . Cost evaluation for
J88-4003 build such a system and use a marker passing algorithm ( Norvig 1987 ) to
M92-1040 memory based parsing , and ( 2 ) marker passing on semantic networks -LSB- 4
E89-1010 C-Markers are combined into the marker passing model . We have also dicussed
C92-2121 semantic network processing with marker passing . Particularly important is the
J88-4003 tested . Properly done , such a marker passing scheme would effect concretion
J91-1008 . Norvig , Peter ( 1989 ) . " Marker passing as a weak method for text inferencing
J88-4003 inferences that are performed by a marker passing mechanism . We are currently
M93-1025 static part of the knowledge base , marker passing is th e mechanism which changes
C88-2137 which a dumb 3 ( not guided ) marker passing mechanism inherently suffers
C92-2121 marker passing as well as unguided marker passing . This is done by specifying
E89-1010 UZZI1 ' . We omit the details of marker passing ( for A - , P - , and C-Markers
A88-1015 satisfaction ( -LSB- RICH87 -RSB- ) and marker passing ( -LSB- HIRS841 ) to deal with
M93-1022 in many other methods , such as marker passing in semantic networks . Consider
E89-1010 be aware that DMA is a guided marker passing algorithm in which markers are
C86-1080 same criticism can bc made of marker passing ( e.g. Quillian , 1968 ; Charniak
hide detail