| { | |
| "paper_id": "T75-2021", | |
| "header": { | |
| "generated_with": "S2ORC 1.0.0", | |
| "date_generated": "2023-01-19T07:43:04.869794Z" | |
| }, | |
| "title": "STEREOTYPES as an ACTOR Approach Towards Solving the .Problem. of Procedural Attachment in FRAME Theories", | |
| "authors": [ | |
| { | |
| "first": "Carl", | |
| "middle": [ | |
| "Hewitt" | |
| ], | |
| "last": "Abstrapt", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| } | |
| ], | |
| "year": "", | |
| "venue": null, | |
| "identifiers": {}, | |
| "abstract": "This paper is a spin-off of our work on actors. \u2022 We have worked out a dictionary for translating between what M.insky 'et. ah are saying about frames and what we are saying about actors. Using PT.ASIV[A [PLANNER-like System iV[odeled on Actors].we can demonstrate important rela.tionships between the Minsky-frames and the PLANNER-like form~.lisms. PLASMA does not .use the Q A-4 context mechanism (Rulifson et. al. 19'12): instead It uses explicit tags in assertions to keep track of the state of affairs m various situations. One problem with the.QA-'i context mechanism is that the problem solver is forced to attempt to propagate all changes in the situation immediately on a frame, shi(t since otherwise inconsistent information will be inherited from the previoussituation. Another problem with Q A-4 context meclhanism is that it is sometimes difficult to reason explicitly about various ~ituations using it because situations [frames] are not explicitly part of the assertions and goals. Events that are Viewed from several:different viewpoints [as in a murder mystery] are diffic01t to handle. Also It Is difficult to retrieve the appropriate prior sltuat!ons from memory to aid In recognition tasks using Q A-4 contexts. However, without the example of the Q A-,i contexts to guide us, we could never have realized holy to deal with these, problems using' tagged assertions. The context mechanism in' CONNIVER was modeled on the one i~n", | |
| "pdf_parse": { | |
| "paper_id": "T75-2021", | |
| "_pdf_hash": "", | |
| "abstract": [ | |
| { | |
| "text": "This paper is a spin-off of our work on actors. \u2022 We have worked out a dictionary for translating between what M.insky 'et. ah are saying about frames and what we are saying about actors. Using PT.ASIV[A [PLANNER-like System iV[odeled on Actors].we can demonstrate important rela.tionships between the Minsky-frames and the PLANNER-like form~.lisms. PLASMA does not .use the Q A-4 context mechanism (Rulifson et. al. 19'12): instead It uses explicit tags in assertions to keep track of the state of affairs m various situations. One problem with the.QA-'i context mechanism is that the problem solver is forced to attempt to propagate all changes in the situation immediately on a frame, shi(t since otherwise inconsistent information will be inherited from the previoussituation. Another problem with Q A-4 context meclhanism is that it is sometimes difficult to reason explicitly about various ~ituations using it because situations [frames] are not explicitly part of the assertions and goals. Events that are Viewed from several:different viewpoints [as in a murder mystery] are diffic01t to handle. Also It Is difficult to retrieve the appropriate prior sltuat!ons from memory to aid In recognition tasks using Q A-4 contexts. However, without the example of the Q A-,i contexts to guide us, we could never have realized holy to deal with these, problems using' tagged assertions. The context mechanism in' CONNIVER was modeled on the one i~n", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Abstract", | |
| "sec_num": null | |
| } | |
| ], | |
| "body_text": [ | |
| { | |
| "text": "Actors make a contribution to the \"dec[aratlve-procedure\" controversy in that they subsume both the behavior of pure procedures [functions] and pore declaratives [data structures] as special cases. In this paper we use actors to investigate the question of how to do procedural attachment to frames [McCarthy 1969 , \u2022 Minsky et. al. 1974 . Actors. provide an approach to solving to the problem of how to attach procedures to frames in such a way thai the appropriate procedure is invoked with the inherited knowledge of the frame within Which the procedure is incorporated, as well as newly introduced knowledge from other frames. Our approach also incorporates the insight gained from PLANNER-like formalisms [Hewitt 1969 [Hewitt , 1971 Rulifson 1972; .Davies: 197'2; Sussman and McDermott 1972, Hewitt et. al. 19\"/3 ] for the'procedural embedding of knowledge. We introduce stereotypes as an actor version of a frame theory. A stereotype consists of the following parts: FRAMES like ACTORS are difficult to define and motivate. Through the dint of much effort [C,reif and Hewitt 1975] actors are now becoming quite well defined [even axiomatized!] .. In this paper we make a stab at similarly starting to pin down and unify various notions of \"frames\". We have observed a tendency for people to get hung up on extraneous details as they attempt to understand these difficult concepts. The\u2022notion s of default values and expectations in particUlar are a cause of diff.iculty. For example expectation \u2022 is often confused with scientific' prediction. In attempting to sort all this out, we have found the methodology of CONJECTURES and REFUTATIONS as expounded by Karl Popper tobe of great value.", | |
| "cite_spans": [ | |
| { | |
| "start": 128, | |
| "end": 139, | |
| "text": "[functions]", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 299, | |
| "end": 313, | |
| "text": "[McCarthy 1969", | |
| "ref_id": "BIBREF18" | |
| }, | |
| { | |
| "start": 314, | |
| "end": 337, | |
| "text": ", \u2022 Minsky et. al. 1974", | |
| "ref_id": "BIBREF21" | |
| }, | |
| { | |
| "start": 710, | |
| "end": 722, | |
| "text": "[Hewitt 1969", | |
| "ref_id": "BIBREF14" | |
| }, | |
| { | |
| "start": 723, | |
| "end": 737, | |
| "text": "[Hewitt , 1971", | |
| "ref_id": "BIBREF15" | |
| }, | |
| { | |
| "start": 738, | |
| "end": 752, | |
| "text": "Rulifson 1972;", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 753, | |
| "end": 768, | |
| "text": ".Davies: 197'2;", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 769, | |
| "end": 817, | |
| "text": "Sussman and McDermott 1972, Hewitt et. al. 19\"/3", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 1062, | |
| "end": 1086, | |
| "text": "[C,reif and Hewitt 1975]", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 1130, | |
| "end": 1149, | |
| "text": "[even axiomatized!]", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "o_..A-4.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The relationships between the assertional frames of McCarthy and the object frames of Minsky are explored m this paper using PLASMA.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "o_..A-4.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "PLASMA allows us to demonstrate a kind or isomorphism between assertional frames and object frames. Using PLASMA accomplishes procedural attachment for both kinds of frames and shows how to move between object and as~ertional frames.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "o_..A-4.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Assertional Frames anc~ Semantic Nets.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "o_..A-4.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The example given \u2022below was originally used by Terry Winograd to illustrate the properties o( Semantic Nets in his. informal survey entitled \"Fiv.e Lectures on Artificial Intelligence'. Scott Fahlman is currently considering how to build a special purpose machine to solve such problems. We first give a formulation in terms of assertional frames. The addition of assertions of the form (... never-are ...) was inspired by Grossman [1975] . It is interesting to speculate whether the formulation in terms of assertiona[ frames is as plausible a psychological model for humans as the formulation in terms of semantic nets. Worlds have many of the behaviors attibuted to 0bject frames {Minsky 19\"H} and assertional frames {McCarthy and Hayes 1969}. In particular worlds exhibit a very flexible form of inheritance of attributes which is realized through the mechanism of message passing.", | |
| "cite_spans": [ | |
| { | |
| "start": 424, | |
| "end": 439, | |
| "text": "Grossman [1975]", | |
| "ref_id": "BIBREF12" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "o_..A-4.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Part of Minsky's birthday party frame includes a PLANNER-style general plan for getting ready for a birthday pal\"ty. It illustrates how PLANNER-style plans.are a natural component of frame systems. In PLASMA the general plan can be expressed as follows:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Refinement of Plans", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "qs\"", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Refinement of Plans", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "[echieve-guest-attends-birthday-party-for-guest-of-honor (to (achieve (=guest attends birthday-party [or =guest-of-honor)) (choose (-present is-~uitobie-present~[or guest-of-honor groin guest) (then: (achieve (^ (guest has present) (guest i,t,-dressed-[or birthday-party)) (then:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Refinement of Plans", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(achieve (luest is-pre~en't-rtt birtllday-porty ]'or guestoof-honor)))))))]", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Refinement of Plans", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "We use the above general plan as a template to write more particular plans tailored to special circumstance by progressive refinement of plans [Hewitt IJCAI-?I] of'the plan. This technique is an incremental glorified version of iqline substitution of procedure bodies for their invocations which has been ge.neralized to deal with pattern directed invocation. Cheatham and .Wegbreit [19\"/3] and Burstall and Darlington [1975] have studied the problems involved in the absence of pattern directed invocation.", | |
| "cite_spans": [ | |
| { | |
| "start": 143, | |
| "end": 160, | |
| "text": "[Hewitt IJCAI-?I]", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 360, | |
| "end": 390, | |
| "text": "Cheatham and .Wegbreit [19\"/3]", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 395, | |
| "end": 425, | |
| "text": "Burstall and Darlington [1975]", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Refinement of Plans", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "We will suppose that early one morning that Marvin has been told that there will be a birthday party for Seymour the next evening. at (time-of (birthd,ly-parly-ot Seymour)))))))))]", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Refinement of Plans", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The above plans were formulated between yawns as Marvin awakened the morning, of the party", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Refinement of Plans", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "in Assertional Frames \"/! situation s is the complete state of the universe at an instant of time. We denote by Sit the set of all situations. Since the universe is too large for complete description, we shall never completely describe a situation; we shall only give facts about situations. These facts will be used to deduce further facts about that situation, about future situations and about situations that persons can bring about from that situation, In addition to making the assumptions listed above McCarthy and Hayes also assume the existence of a functional which maps a global state in .to the \"nexC global state. Although.we shall use tags on assertions and goals to relativize them to particular situations, hypotheses, and contexts we do not want to make any of the global assumptions of McCarthy and Hayes. All of our situations will be local and completely consistent with relativity and. quantum mechanics. For a discussion of the issues involved in this decisiott for the actor model of computation see Greif and Hewitt [19'/5 ].", | |
| "cite_spans": [ | |
| { | |
| "start": 1023, | |
| "end": 1046, | |
| "text": "Greif and Hewitt [19'/5", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Attachment", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The Pattern Directed Invocation [Hewltt 1969 ] incorporated in PLANNER-like systems accomplishes proced~iral attachment for assertional frames [McCarthy 1969] . 'This procedural attachment is carried down to the level of the quantificatlonal calculus \u2022where we have shown [Hewitt 1975a ] how' the logical operators of the quantificational calculus {V, 3, implies, ^, v, -, etc.} can be behaviorally defined as actors. We use the following kinds of tags in assertions to relatlvlze the assertions in the desired manner:. :", | |
| "cite_spans": [ | |
| { | |
| "start": 32, | |
| "end": 44, | |
| "text": "[Hewltt 1969", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 143, | |
| "end": 158, | |
| "text": "[McCarthy 1969]", | |
| "ref_id": "BIBREF18" | |
| }, | |
| { | |
| "start": 272, | |
| "end": 285, | |
| "text": "[Hewitt 1975a", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Attachment", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "\u2022 physical states mental states logical hypotheticals hypotheses view points goal states predictions defaults", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Attachment", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "We introduce stereoty'pes as an actor version of a frame theory. Our notion' of a stereotype incorporates ideas from assertional frames [McCarthy 1969 ], act~ worlds [He'witt 1969 , world-directed invocation [Hewitt 1969; 1971, 19\"/3; Stansfield 1975] ; social frames [Goffman 197st] , and object frames [Minsky et. al. 19'/'t] .", | |
| "cite_spans": [ | |
| { | |
| "start": 136, | |
| "end": 150, | |
| "text": "[McCarthy 1969", | |
| "ref_id": "BIBREF18" | |
| }, | |
| { | |
| "start": 151, | |
| "end": 179, | |
| "text": "], act~ worlds [He'witt 1969", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 208, | |
| "end": 221, | |
| "text": "[Hewitt 1969;", | |
| "ref_id": "BIBREF14" | |
| }, | |
| { | |
| "start": 222, | |
| "end": 234, | |
| "text": "1971, 19\"/3;", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 235, | |
| "end": 251, | |
| "text": "Stansfield 1975]", | |
| "ref_id": "BIBREF26" | |
| }, | |
| { | |
| "start": 268, | |
| "end": 283, | |
| "text": "[Goffman 197st]", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 304, | |
| "end": 327, | |
| "text": "[Minsky et. al. 19'/'t]", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Stereotypes", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "A stereotype consists of a set of the following parts: a collection of characteristic objects characteristic relations for those objects a set of plans invoked by world directed invocation for transforming the objects and relations", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Stereotypes", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "It seems that many of the behaviors attributed to frames by Minsky can be realized by stereotypes. The characteristic objects of a stereotype correspond closely to the slots of a. Minsky frame and the characteristic relations of a stereotype correspond to the constraints of a Minsky frame. Minsky calls simp]e ,ma.ry characteristic relations markers. We instantiate stereotypes somewhat differently from the way in which Minsk? instantiates object frames. Our approach is to plug in definite candidates for all the characteristic objects of a stereotype that we can and use anonymous objects for the rest. Defaults are done as assertions tagged tO indicate that they are defaulted so that they can be easily displaced if an anomaly develops. Stereotypes communicate by making assertions in the data base and by world directed invocation which is a generalization of pattern directed \u2022invocation in which the invocation is done on the basis of a fragment Of a micro-world instead of a single assertion. Inheritance of attributes is done using the message passing of actor semantics. If a questions cannot be answered directly then parts of the job.are \" delegated. PLANNING into problem solving using \"islands\" [Minsky 1963] as stepping Stones. The utopia of one problem solving situation is taken as the reality of another. Nested continuation control structure gives us the ability to influence or control any decision to the extent we desire. For example, in case of the apartment finder above, we can explicitly communicate complaints as to why a particular apartment is unacceptable in order to try to infiuence the selection of further proposed apartments. Use of nested continuation control structure enables us to have the ability to control all o.f the decisio.ns made while still retaining the high level goat oriented, nature:of PLANNER. PLASMA is able to accomplish this by basing its semantics on actor message passing and slightly changing the syntax ofPLANNER-?I, The change in syntax provides us with natural places to incorporate the (:ontrol information and enables us to avoid the gratuitous side effects !n PLANNER-?L", | |
| "cite_spans": [ | |
| { | |
| "start": 1211, | |
| "end": 1224, | |
| "text": "[Minsky 1963]", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "%\u2022", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "We do not want to have .to explicitly \u2022store every piece of knowledge .which we have but would like to be able to derive conclusions from what is already\u2022 known using procedures. Using the distinguished symbol when with the syntax (when trigger consider-trying b.ody) or completely equivalently using the distinguished symbol to with the syntax (to trigger consider-trylng body) creates a plan [high level goal-oriented procedure] that can be invoked by pattern directed invocation by a trigger Which matches trigger. The following are all special case plans which are defined in terms of the above general pattern directed invocation machinery.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Unification of Pattern-Directed Invocation", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(to (demonstrate hypothesis) consider-trying body) (when (assert statement.) cons(clef-trying body) (to (dlsrzchiew condition) consider-trying bo.dy) ' (when (deny statement) consider-trying body) (to (refute hypothesis) consider-trying body) (to (find description) consider-tr~ing body) (to (achieve condition) consider-tryhtg body)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Unification of Pattern-Directed Invocation", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Additional kinds of plans can be defined as they are needed.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Unification of Pattern-Directed Invocation", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The process of. invoking plans in worlds is controlled by recommendations made to the world when the plan is put in the world and by recommendations made at the site where a request is made of the world to achieve a particular goal. We envisage that problem solving would begin in a world with an initial class of plans. In many cases most of the plans that are used in. the ultimate solution of the problem need to be constructed by other plans during the problem solving process. This is ilTustrated in a limited way by the domain of logic which is given as an example in Hew \u2022 ;demonstrtite t.hat b is a subset of c (using: set-theory))) (using: set-theory)))] \"", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Unification of Pattern-Directed Invocation", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The problem is solved by \"wishful thinking'\u2022 i.e. reasoning within a hypothetical world. Unfortunatelywe do not have the fact (x \u00a2 z) explicitly given to us and so must do .some computation. We note that we have a plan whose trigger (=a c: --c) matches what we are trying to achieve and so turn control over to it to see what it can do. In order to find b_ such that (x C-b_) we let b_ be anon I which is a never before encountered individual which we wish to have certain properties. Then we note that anon I might be w. But we are unable to demonstrate [w \u00a2__ z) so we reconsider and see that anonl might be y. We successfully demonstrate\u2022 (y c_ z) and so the problem is solved..", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Unification of Pattern-Directed Invocation", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Our first example of\" a stereotype is a Per i simple one. It is an ordinary line. A line-segment has three characteristic objects: one edge and two vertices. There is not much that can be done with a line seg6~ent. However given one vertex, we of then need to be able \u2022 to get the oppos!te vertex. A plan for doing this is given below: grind-opposite-vertex (to (j'ind =v i is-opposile sv 2 alontr me) (find (^", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "\u2022 A,Line Stereot3~pe", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(v I is-a-verte~:-of e) (vl # v2))]", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "\u2022 A,Line Stereot3~pe", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Face. Stereotypes \"/'he following are two common stereotypes of faces of b|ocks:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "\u2022 A,Line Stereot3~pe", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "In the remainder of this paper, we shall frequent.ly refer back to the following stereotypes.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I I l~eotangle Triangle Two Common Face Stereotypes", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "A triangle stereotype contains ~three objects: all of which are ", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "A Triangle Stereotype", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The following are three common stereotypes of blocks: A ~vled~e Stereotype ", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Blook Stereotypes", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "A stereotype for a typical view. of a cube stereotype contains three sides, one Y vertex, three arrow vertices, and three L vertices.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Stereotyped Views of Models of Blocks", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "((side s is-a-vleu~-of lace s af block i) in the-view) ((side b is-a-view-el taceb, of block i ) in the-view) ((side c is-a-t, lew-of face c of block 1) in the-view) . ((side s i~-Ieft-helaw side c) in the-view) ((side b ia-rlgEt-kelou~ side c) in the-view) ((v e is-a-Y-retreat) [Kuipers 1974 ]. The reader is referred to KuIpers! paper for various kinds of discussion and background which will not be repeated here. The recognition problem Is to incrementally recognize the above three kinds of blocks. This kind of problem has been extensively investigated by.robot projects at the M.I.T. Artificial intelligence Laboratory, the Stanford Artificial Intelligence Laboratory, and the S.R.I. Robot Project. In order to facilitate comparison, we have fairly closely followe.d Kuiper's scenario. Our motivation in re-exploring the block recognition problem is to Investigate some techniques that have been developed by Marllyn McLennan for the very difficult. 'domain of understanding plant pictures. We wanted to investigate a technique that she is developing for resolving conflicts, between conflicting hypotheses recognition problems in another domain.", | |
| "cite_spans": [ | |
| { | |
| "start": 280, | |
| "end": 293, | |
| "text": "[Kuipers 1974", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [ | |
| { | |
| "start": 258, | |
| "end": 279, | |
| "text": "((v e is-a-Y-retreat)", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "I I I", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "We have modified Kulpers scenario of the recognition of a block using stereotypes by using three-dimension stereotypes Instead of the two-dimensional views which he used. These three-dimensional stereotypes are reminiscent of. some of the three-dimensional \"models\" used in the robot vision programs. We start the recognition with an initial vertex v I (see figure below) , which in this case happens to be an L-vertex. Our initial hypothesis h is that the drawing represents a cube as indicated by the dotted lines: Vertex I", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 358, | |
| "end": 371, | |
| "text": "figure below)", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "I I I", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "We have the following situation:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I I I", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "q~ (v i is-a-,,ertex-of e i) (v I is-a-vertex-of e 2) (v I i~-an-L-,,erte~) ((block| iS-~z cube) in b) ((v| correspo,ds-to vg) in h) e+ \"':'\" I \u00a2 I ! \" \u2022 \u2022 ~1 ~ Vertex", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I I I", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "We now have the following information:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I I I", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(v 2 is-an-arrow~vertex) (V 2 is-a-t~ertex-of \u00ael ) (V 2 is-a-tJerte~:-ol e3) (v 2 is-a-tJerte~:-o[ \u2022 4) ((v 2 correspondx-tO Vb).in h)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I I I", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The second vertex hypothesis h. ", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I I I", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(v 3 is-a-Uertex-a[ \u2022 2) \u2022 (v 3 is-a-verte~\u00a2-ol \u2022 5) (V 3 is-a-verte~-o[ \u2022 6 ) ((v 3 corresponds-to v() in h)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I I I", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "This vertex fits the hypothesis h of the cube stereotype, since it is the anticipated arrow vertex.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I I I", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": ". . ; \u00b0:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "v,", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "! \u00b0! V, eL v~ Vertex 4", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "v,", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "We assume that the visual primitives that we are using are region-oriented as well as being line.oriented so that we can directly detect and recognized the shape of certain kinds of regions. is-a-view-of face a of cube 1) ", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 191, | |
| "end": 221, | |
| "text": "is-a-view-of face a of cube 1)", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "v,", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "I (side I is-n-parallelogram) (v 4 is-a-Y-,sertex) (v 4 is-a-vertex-of \u2022 4) (v 4 is-a-vertez-of \u2022 5) (V 4 is-a-vertez-of e 7) ((v 4 corresponds-to V a) in h) ((side I", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "v,", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "i, h)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "v,", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The Y-vertex at the center of the figure also corresponds completely with the cube hypothesis h. A complete parallelogram face has now been observed and confirmed. \u2022 ' Vertex 5", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "v,", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(side 2 is-a-triangle)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "v,", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(v 5 is-a-arrow-vertex) (v \u00a7 is-a-vertex-of %) {v 5 is-a-~ertex-o[ e 7)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "v,", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Confrontation and l~efutation", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "v,", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "With this observation, the cube hypothesis h finally breaks i down. The anomaly occurs because the assertion that s.ide 2 is a II triangle conflicts with the characteristic relationof the cube s~ereotype that all of its faces are squares. Thus there Is .no easy to resolve the anomaly.by simply rotating the cube\u2022 However, the cube stereotype i is reluctant to give up completely so it Imagines one of its sides II shrunk down to an edge to fit the data. This reminds cube stereotype of the the wedge sterfotype, which it suggests. The triangular side, in effect, caused the recognition system to do a \"double-take\" creating i hypothes'is h' that the block isa wedge since the wed|e stereotype Is Since there is no further input data to be considered and .thus further processing yields no.refutations, hypothesis h' temporarily survives.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I I I I I I I I", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "In this section we shall consider ,an example due to Mlnsky from the point of view of stereotypes. We assume.that the result of looking at the cube pictured below", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "T_racking the Image of a, Cube", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Of course the situation of the cube has not changed but we have the following additional information:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "((C has-color white) in situation 1) (C is-a-view-o j\" facef o [ cube l) . .", | |
| "cite_spans": [ | |
| { | |
| "start": 63, | |
| "end": 72, | |
| "text": "[ cube l)", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "How if we imagine moving back to [he left, we can hypothesize the view without any perceptual computation at all. We simply imagine that the new view view 3 is the same as view i.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "((view 3 = view 1) in hypothesis l)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "However, moving back to the left we are surprised to find that in the new view [view 3 ] that A has changed color to while! Thus hypothesis ! is rejected. We also notice that ((floor has flecks-of-white-paint) in view3)\" which causes us to construct another hypothesis\" (situation 2 = (pain! A white in situationl)) ((view 3 is-a-IJiew-o[ situation 2) in hYpothesis2) .", | |
| "cite_spans": [ | |
| { | |
| "start": 79, | |
| "end": 86, | |
| "text": "[view 3", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Further careful observation and testing.does not refute hypothesis 2, so situation 2 can inherit suitably transformed attributes from situation I using the hypothesized paint transition.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The \"frame\" problem of McCarthy for assertional frames corresponds closely to the problems of \"inheritance of attributes\" and view I I \" \"default values\" for object frames. For example the fable quoted by is the following symbolic description:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "More .\u00b0n Inheritan,ce ofAttributes", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Minsky about the wolf and the lamb is very close to the frame problems of McCarthy. Note that some attributes in siluation 4 such as the color of A are inherited directly from one of the cubes in situationl: ' On the other hand the mass of block I is inherited as the sum.of the masses of cube I and cube 2.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "More .\u00b0n Inheritan,ce ofAttributes", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The principal reason why vision programs at present perform so poorly is that the amount of knowledge they can bring to bear on the seeing process is so limited. For example, Waltz's program [Waltz 1972 ] is the latest in a line of development called scene analys, which was originated by Guzman [1968] , and pursued by Huff man [1970] and Clowes [1971] . The usefulness' of this appro;ich is called into question by the difficulty of extracting, from information about intensity and color, the near perfect line drawing that such programs require; and by the restricted nature of the line drawing represeniation itself~ Waltz has demonstrated\" that when a more detailed categorization of the kinds of labels is made that the number of ambiguous line drawings decreases dramatically. \"", | |
| "cite_spans": [ | |
| { | |
| "start": 191, | |
| "end": 202, | |
| "text": "[Waltz 1972", | |
| "ref_id": "BIBREF27" | |
| }, | |
| { | |
| "start": 289, | |
| "end": 302, | |
| "text": "Guzman [1968]", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 329, | |
| "end": 335, | |
| "text": "[1970]", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 347, | |
| "end": 353, | |
| "text": "[1971]", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Real World l~eoognition", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "We greatly admire Waltz's program, .but we f~l that the apprOach that it embodies is open to several criticisms. The first is that the knowledge that it uses is in a certain sense not explicit enough. Although it contains a great deal of. information about the appearance of line drawings, this information is essentially, in a compiled form: one reflection of this ts that the structure of Waitz's program makes it inherently unable to use either explicit information about the three-dimensional form of what is being viewed, orthe many pieces of special and general knowledge that we surely bring to bear on the process of seeing.' Essentially, the only way one.can attempt to influence the program is by adding or deleting junctions from a large table of \"legal\" labellings. There is no way in which pieces of its knowledge can be pulled out and examined while tt tries to create an interpretation of, for example, a scene in which several lines are missing. Unless such knowledge, suitably embedded in a hypothetico-deductive system, can play a large part in the operation ofa vision program, we see no prospect of such a program being able to interpret the incomplete information that is the diet of daily life.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Real World l~eoognition", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The basic trouble with the labelling approach of scene analysis is that it is too limiting and stultifying a paradigm for vision, in much. the same way that resolution is for deduction. The fundamental \u2022 principle of resolution, that (-A) and {A v B,) together imply B, is occasionally useful, But attempting to make a uniform resolution proof procedure, to mechanize deduction in a way that cannot be very sensitive to hints, hunches, and a wide variety or higher level knowledge about the particular domain in question, is a cul-de-sac. Similarly, the line and vertex labels are local, predicates that are occasionally useful, and are of \u2022some mathematical interest in their own right: but the problem of creating a uniform procedure to label arbitrary line drawing is not a central one for vision. Hence, we believe that the kind of knowledge contained in Waltz's program is probably relatively unimportant; and that the way in which it is made available there is certainly too restricting.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Real World l~eoognition", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The proper endeavor of vision research is to decide what k.nowledge should be used to help a vision system to see, and to discover methods that make it possible to use such knowledge. How can one pursue this goal more effectively? There are several kinds of answers. The first is to abandon the restrictive format of line drawings, so that programs can use information about visual features that are not coded in this form. There is a large gain to be had by loosening up our formalisms to incorporate the many .pieces of special and general knowledge that are necessary for purposeful vision in the real world. Vision is primarily a.util tarian functmn in order to see properly it is necessary to know what kind of information is sought.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Real World l~eoognition", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "We believe that progress in particular domains of recognition on the following problems will pay. large dividends:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Real World l~eoognition", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Getting Started: How to proceed from a set of feature clues to more global hypotheses. How to incorporate parallelism into this process:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Real World l~eoognition", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Keeping Going: How to recognize and mechanize confrontations between cohflicting hypotheses~ How to retain and use valid information that was incorporated in. hypotheses that have been refuted.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Real World l~eoognition", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The PLASMA system described in this paper is currently being implemented at the MIT Artificial lntell!gence Laboratory. Thebest version which currently runs was coded by Howle.Shrobe. A better' humanly engineered version has been designed and coded by Carl Hewitt In PLASMA with the extensive aid of Marilyn McLennan, At the time of this writing [March. 1975] the new implementation is being translated into LISP by the MIT laboratory course 6.89'3: \"Implementation and Application of Actor Systems'. A rough draft of a primer by Brian Smith and Carl Hewittfor the new implementation exists.", | |
| "cite_spans": [ | |
| { | |
| "start": 346, | |
| "end": 359, | |
| "text": "[March. 1975]", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Furthe~ .Work", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The research reported in this.paper was sponsored by the MIT Artificial Intelligence and Laboratory and Project MAC under the sponsorship of the Office of Naval Research.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "A. _ ck .nowledgements", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The\" main example in this paper is\u2022adapted from a very niece. piece of work by Ben Kulpers. The major change we made in his scenario was to introduce three-dimensional models and to try to reason as much as possible in three-dimenslonaJ terms. Marilyn McLennan, Ben Kuipers, and Candy Bullwinkle made helpful comments and criticisms which considerably improved the intelligibility and content of this paper. The progress we havemade on actors would have been completely impossible without the contributions and questions of numerous MIT students\u2022 Ben Kulpers, Howie Shrobe, Keith Nishihara, Brian Smith, Akl Yonezawa, Richard Steiger, and Peter Bishop, and Irene Greif have done much of the work in making actors intelligible and relevant to the problems of constructing knowledge-based systems. Irene Grelf is doing exciting work in extending behavioral semantics to the area of inter-process communication, and puttingsemantics on a more social foundation\u2022 Ho.wie Shrobe, Brian Smith, Todd Matsun,. Roger Hale, and Peter Bishop have contributed to the multitude of \"throw-away\" implementations through which \u2022have we debugged many. Of our ideas. l I I I I I I I I I I I I I I I l I I I I I I ", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 1148, | |
| "end": 1216, | |
| "text": "l I I I I I I I I I I I I I I I l I I I I I I", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "A. _ ck .nowledgements", | |
| "sec_num": null | |
| } | |
| ], | |
| "back_matter": [ | |
| { | |
| "text": "((A has-color red) in view I ) I((B has-color while)in view|) ..Recently Keith Nishihara has reconsidered the problem of ((E hr=s-eelor white)in view I ) gluing blocks together from t.he point of inheritance of.attributes.((A is-lej't-below E)in'view 1)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "annex", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Suppose that there actually we:re two cubes In the first situation ((B is-riEht-Eelow E) in view i \u2022 (E in-a-view-of face s of cube 1) so we have the following additional assertions: When we move to the right, face A disappears fromview, Iwhile the new face decorated with C is now seen.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "\"", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The new view has the following symbolic description: ", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I I view 2 I", | |
| "sec_num": null | |
| } | |
| ], | |
| "bib_entries": { | |
| "BIBREF0": { | |
| "ref_id": "b0", | |
| "title": "Our notion ot ~ a stereotype is strongly reminiscent of the the logical notion of a formal system. However, stereotypes are used quite differently. Putting tags on assertions as advocated in this .paper to record the state of affairs in various' local situations seems more powerful and flexible than the context mechanism invented by Rulifson for Q A-~ and later adopted by CONNIVER. Tags .on assertions have previously been used to a limited extent in PLANNER-69 [MICRO-PLANNER] by Charniak and Biss to record situations. They are closely related to the global ~ituations [frames]of McCarthy. The criticism of the line-labelling approach to vision comes from Marr and Hewitt 1973. Many of the ideas have emerged from the M IT course 6.893: \"implementation and Application of Actor Systems\" given in the spring of 1975 with the following participants", | |
| "authors": [ | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Hypotheses Done B.Y Fahlman", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Hewitt", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Kuhn", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Kuipers", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Mccarthy", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Minsky", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Nishihara", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Popper", | |
| "middle": [], | |
| "last": "Polya", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Winograd", | |
| "middle": [], | |
| "last": "", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": null, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "paper builds on ex{ensive previous work on frames, paradigms, and hypotheses done b.y Fahlman, Hewitt, Kuhn, Kuipers, McCarthy, Minsky, Nishihara, Polya, Popper, and Winograd. Our notion ot ~ a stereotype is strongly reminiscent of the the logical notion of a formal system. However, stereotypes are used quite differently. Putting tags on assertions as advocated in this .paper to record the state of affairs in various' local situations seems more powerful and flexible than the context mechanism invented by Rulifson for Q A-~ and later adopted by CONNIVER. Tags .on assertions have previously been used to a limited extent in PLANNER-69 [MICRO-PLANNER] by Charniak and Biss to record situations. They are closely related to the global ~ituations [frames]of McCarthy. The criticism of the line-labelling approach to vision comes from Marr and Hewitt 1973. Many of the ideas have emerged from the M IT course 6.893: \"implementation and Application of Actor Systems\" given in the spring of 1975 with the following participants: Russ Atkinson, Mike Freiling, Kenneth Kahn, Keith Nlshihara,Marilyn McLennan, Howie Shrobe, Kathy Van Sant, and Aki Yonezawa.", | |
| "links": null | |
| }, | |
| "BIBREF1": { | |
| "ref_id": "b1", | |
| "title": "Protection and Synchronization i.n Actor Systems\" M.I.T. working paper", | |
| "authors": [ | |
| { | |
| "first": "C", | |
| "middle": [], | |
| "last": "Hewitt", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1974, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Hewitt, C. \"Protection and Synchronization i.n Actor Systems\" M.I.T. working paper. November, 1974.", | |
| "links": null | |
| }, | |
| "BIBREF2": { | |
| "ref_id": "b2", | |
| "title": "The Semantics of ACTIONS and the Semantics of TRUTH\" IJCAI-75. Tiblisi, USSR", | |
| "authors": [ | |
| { | |
| "first": "Hewitt", | |
| "middle": [], | |
| "last": "Kuipers", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "C", | |
| "middle": [], | |
| "last": "", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": null, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Kuipers, Hewitt, C. \"The Semantics of ACTIONS and the Semantics of TRUTH\" IJCAI-75. Tiblisi, USSR. Sept. 3-8, 19\"/5.", | |
| "links": null | |
| }, | |
| "BIBREF3": { | |
| "ref_id": "b3", | |
| "title": "The Structure of Scientific Revolutions Univ of Chicago Press\u2022 (2nd", | |
| "authors": [ | |
| { | |
| "first": "T", | |
| "middle": [], | |
| "last": "Kuhn", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1970, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Kuhn, T. The Structure of Scientific Revolutions Univ of Chicago Press\u2022 (2nd. Ed.) 1970.", | |
| "links": null | |
| }, | |
| "BIBREF4": { | |
| "ref_id": "b4", | |
| "title": "An Hypothesis-Driven Recognition Sysiem for the Blocks World\" MIT-AI Working Paper 83", | |
| "authors": [ | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Ben", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": null, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Ben. \"An Hypothesis-Driven Recognition Sysiem for the Blocks World\" MIT-AI Working Paper 83. March, 197't.", | |
| "links": null | |
| }, | |
| "BIBREF5": { | |
| "ref_id": "b5", | |
| "title": "VIDEO ERGO SC[O: Anessay on some thing we would like a vision system to know\" M.I.T.A.I. Lab Working Paper 60", | |
| "authors": [ | |
| { | |
| "first": "D", | |
| "middle": [], | |
| "last": "Marr", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "C", | |
| "middle": [], | |
| "last": "Hewitt", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1973, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Marr, D. and Hewitt, C. \"VIDEO ERGO SC[O: Anessay on some thing we would like a vision system to know\" M.I.T.A.I. Lab Working Paper 60. November, 1973.", | |
| "links": null | |
| }, | |
| "BIBREF6": { | |
| "ref_id": "b6", | |
| "title": "Semantic Modeling for Deductive Question-Answering", | |
| "authors": [ | |
| { | |
| "first": "K", | |
| "middle": [], | |
| "last": "Biss", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "R", | |
| "middle": [], | |
| "last": "Chien~", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "F", | |
| "middle": [], | |
| "last": "Stahl", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "S", | |
| "middle": [], | |
| "last": "Weissman", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": null, | |
| "venue": "Proceedings of. IJCAI-73. \u2022August [973. Stanford", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "356--363", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Biss, K.; Chien~ R.; Stahl, F.; and Weissman, S. \"Semantic Modeling for Deductive Question-Answering\" Proceedings of. IJCAI-73. \u2022August [973. Stanford. pp. 356-363.", | |
| "links": null | |
| }, | |
| "BIBREF7": { | |
| "ref_id": "b7", | |
| "title": "Some T ran'fformations for Developing Recursive Programs\" International Conference on Reliable Software. Los Angeles. April,'lg\"lS", | |
| "authors": [ | |
| { | |
| "first": "R", | |
| "middle": [ | |
| "M" | |
| ], | |
| "last": "Burstall", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "J", | |
| "middle": [], | |
| "last": "Darlington", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": null, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Burstall, R. M. and Darlington, j. \"Some T ran'fformations for Developing Recursive Programs\" International Conference on Reliable Software. Los Angeles. April,'lg\"lS.", | |
| "links": null | |
| }, | |
| "BIBREF8": { | |
| "ref_id": "b8", | |
| "title": "A Laboratory for the Study of Automating Programming", | |
| "authors": [ | |
| { | |
| "first": "T", | |
| "middle": [], | |
| "last": "Cheatham", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "B", | |
| "middle": [], | |
| "last": "Wegbreit", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1972, | |
| "venue": "SIGSAM Bulletin", | |
| "volume": "21", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Cheatham, T. and B. Wegbreit, \"A Laboratory for the Study of Automating Programming\" SIGSAM Bulletin, Vol. 21, \u2022 January, 1972.", | |
| "links": null | |
| }, | |
| "BIBREF9": { | |
| "ref_id": "b9", | |
| "title": "POPLER: A POP-2 PLANNER'.MIP-89", | |
| "authors": [ | |
| { | |
| "first": "D", | |
| "middle": [ | |
| "J" | |
| ], | |
| "last": "Davies", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": null, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Davies, D. J. M. \"POPLER: A POP-2 PLANNER'.MIP-89. School of A-I. University of Edinburgh.", | |
| "links": null | |
| }, | |
| "BIBREF10": { | |
| "ref_id": "b10", | |
| "title": "Representing Negation in a PLANNER System ~ Proceedings of AISB Conference\u2022 july", | |
| "authors": [ | |
| { | |
| "first": "D", | |
| "middle": [ | |
| "J" | |
| ], | |
| "last": "Davies", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1974, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Davies, D. J. M. \"Representing Negation in a PLANNER System ~ Proceedings of AISB Conference\u2022 july, 1974. University of Sussex.", | |
| "links": null | |
| }, | |
| "BIBREF11": { | |
| "ref_id": "b11", | |
| "title": "Actor Semantics of .PLANNER-73", | |
| "authors": [ | |
| { | |
| "first": "I", | |
| "middle": [], | |
| "last": "Greif", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "C", | |
| "middle": [], | |
| "last": "Hewitt", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1975, | |
| "venue": "Proceedings of ACM SIGPLAN-SIGACT Conference", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Greif, I. and Hewitt, C. \"Actor Semantics of .PLANNER-73\" Proceedings of ACM SIGPLAN-SIGACT Conference. Palo Alto, California. January, 1975.", | |
| "links": null | |
| }, | |
| "BIBREF12": { | |
| "ref_id": "b12", | |
| "title": "Representing theSemantics of Natural Language as Constraint Expressions\" MIT Artifl<:|al Intelligence Working Paper 87", | |
| "authors": [ | |
| { | |
| "first": "R", | |
| "middle": [ | |
| "W" | |
| ], | |
| "last": "Grossman", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1975, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Grossman, R. W. \"Representing theSemantics of Natural Language as Constraint Expressions\" MIT Artifl<:|al Intelligence Working Paper 87. January, 1975.", | |
| "links": null | |
| }, | |
| "BIBREF13": { | |
| "ref_id": "b13", | |
| "title": "Some .Problems and Non-Problems !n Representation Theory", | |
| "authors": [ | |
| { | |
| "first": "P", | |
| "middle": [ | |
| "J" | |
| ], | |
| "last": "Hayes", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1974, | |
| "venue": "Proceedings of AISB. Sussex", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Hayes, P. J. \"Some .Problems and Non-Problems !n Representation Theory\" Proceedings of AISB. Sussex July, 1974~", | |
| "links": null | |
| }, | |
| "BIBREF14": { | |
| "ref_id": "b14", | |
| "title": "PLANNER: A Language for Manipulating Models and Proving Theorems in a Rqbot", | |
| "authors": [ | |
| { | |
| "first": "C", | |
| "middle": [], | |
| "last": "Hewitt", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1969, | |
| "venue": "IJCAI-69", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Hewitt, C. \"PLANNER: A Language for Manipulating Models and Proving Theorems in a Rqbot\" IJCAI-69, Washington, D\u2022 C. May 1969~ ..", | |
| "links": null | |
| }, | |
| "BIBREF15": { | |
| "ref_id": "b15", | |
| "title": "Procedural Embedding of Knowledge in PLANNER", | |
| "authors": [ | |
| { | |
| "first": "C", | |
| "middle": [], | |
| "last": "Hewitt", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1971, | |
| "venue": "IJCAI-71. London. Sept", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Hewitt, C. \"Procedural Embedding of Knowledge in PLANNER\" IJCAI-71. London. Sept, 1971\u2022", | |
| "links": null | |
| }, | |
| "BIBREF16": { | |
| "ref_id": "b16", | |
| "title": "Procedural Semantics", | |
| "authors": [ | |
| { | |
| "first": "C", | |
| "middle": [], | |
| "last": "Hewttt", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1971, | |
| "venue": "Naiural Language Processing Courant Compu'ter Science Symposium", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Hewttt, C. \"Procedural Semantics\" in Naiural Language Processing Courant Compu'ter Science Symposium 8. Randall Rustln, editor. Algorithmics Press. 1971.", | |
| "links": null | |
| }, | |
| "BIBREF17": { | |
| "ref_id": "b17", | |
| "title": "Actor Induction and Meta-evaluation", | |
| "authors": [ | |
| { | |
| "first": "Carl", | |
| "middle": [ | |
| "Et" | |
| ], | |
| "last": "Hewltt", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1975, | |
| "venue": "Conference Record of ACM Symposium on Principles of Programming Languages", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Hewltt, Carl et..al. \"Actor Induction and Meta-evaluation\" Conference Record of ACM Symposium on Principles of Programming Languages. Boston. Oct, 1975. \"", | |
| "links": null | |
| }, | |
| "BIBREF18": { | |
| "ref_id": "b18", | |
| "title": "SomePhilosophical Problems From the Standpoint of Artificial Intelligence", | |
| "authors": [ | |
| { | |
| "first": "J", | |
| "middle": [], | |
| "last": "Mccarthy", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "P", | |
| "middle": [], | |
| "last": "Hayes", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1969, | |
| "venue": "Machine lntel!igence", | |
| "volume": "4", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "McCarthy, J. and P. Hayes, \"SomePhilosophical Problems From the Standpoint of Artificial Intelligence\" Machine lntel!igence Vol. 4. American Elsevier Publishing .Company. New York. 1969.", | |
| "links": null | |
| }, | |
| "BIBREF19": { | |
| "ref_id": "b19", | |
| "title": "Assimilation of New Information by a Natural Language Understanding System'\u2022 MIT AI Memo 298", | |
| "authors": [ | |
| { | |
| "first": "D", | |
| "middle": [], | |
| "last": "Mcdermott", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1974, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "McDermott, D. \"Assimilation of New Information by a Natural Language Understanding System'\u2022 MIT AI Memo 298. March, 1974.", | |
| "links": null | |
| }, | |
| "BIBREF20": { | |
| "ref_id": "b20", | |
| "title": "Hypothesis Formation as a Method of Understanding Plant Pictures\" Thesis Progress Report for Fall 197'L Private Communication", | |
| "authors": [ | |
| { | |
| "first": "M", | |
| "middle": [], | |
| "last": "Mclennan", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": null, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "McLennan, M, \"Hypothesis Formation as a Method of Understanding Plant Pictures\" Thesis Progress Report for Fall 197'L Private Communication.", | |
| "links": null | |
| }, | |
| "BIBREF21": { | |
| "ref_id": "b21", | |
| "title": "A Framework for Representing.Knowledge\" MIT AI Memo 306", | |
| "authors": [ | |
| { | |
| "first": "Marvin", | |
| "middle": [], | |
| "last": "Minsky", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1974, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Minsky, Marvin. \"A Framework for Representing.Knowledge\" MIT AI Memo 306. June 1974.", | |
| "links": null | |
| }, | |
| "BIBREF22": { | |
| "ref_id": "b22", | |
| "title": "How can MERLIN understand", | |
| "authors": [ | |
| { | |
| "first": "J", | |
| "middle": [], | |
| "last": "Moore", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "A", | |
| "middle": [], | |
| "last": "Newell", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1973, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Moore, J\u2022 and Newell, A. \"How can MERLIN understand?' Department of Computer. Science. Carnegie-Mellon University. 1973.", | |
| "links": null | |
| }, | |
| "BIBREF23": { | |
| "ref_id": "b23", | |
| "title": "Con jectures and Refutations Basic Books", | |
| "authors": [ | |
| { | |
| "first": "K", | |
| "middle": [], | |
| "last": "Popper", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1962, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Popper, K. Con jectures and Refutations Basic Books. 1962.'", | |
| "links": null | |
| }, | |
| "BIBREF24": { | |
| "ref_id": "b24", | |
| "title": "QA4: A Procedural Calculus for Intuitive Reasoning", | |
| "authors": [ | |
| { | |
| "first": "Rulifson", | |
| "middle": [], | |
| "last": "Johns", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "F", | |
| "middle": [], | |
| "last": "Derksen", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "J", | |
| "middle": [ | |
| "A" | |
| ], | |
| "last": "Waldinger", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "R", | |
| "middle": [ | |
| "J" | |
| ], | |
| "last": "", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": null, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Rulifson Johns F., Derksen J. A., and Waldinger R. J. \"QA4: A Procedural Calculus for Intuitive Reasoning\" Ph. D. Stanford. November 197~..", | |
| "links": null | |
| }, | |
| "BIBREF25": { | |
| "ref_id": "b25", | |
| "title": "Towards a Programming Apprentice", | |
| "authors": [ | |
| { | |
| "first": "B", | |
| "middle": [ | |
| "C" | |
| ], | |
| "last": "Smith", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "C", | |
| "middle": [], | |
| "last": "Hewitt", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": null, | |
| "venue": "Proceedings of AISB. Sussex", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "\u2022 Smith, B. C. and Hewitt, C. \"Towards a Programming Apprentice\" Proceedings of AISB. Sussex. July, 19\"/4.", | |
| "links": null | |
| }, | |
| "BIBREF26": { | |
| "ref_id": "b26", | |
| "title": "Programming a Dialogue Teaching Situation", | |
| "authors": [ | |
| { | |
| "first": "J", | |
| "middle": [], | |
| "last": "Stansfield", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1975, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Stansfield, J. L. \"Programming a Dialogue Teaching Situation\" Ph.D. Thesis, Edinburgh: University of Edinburgh\u2022 January, 1975.", | |
| "links": null | |
| }, | |
| "BIBREF27": { | |
| "ref_id": "b27", | |
| "title": "Generating Semantic Descriptions from Drawings Of Scenes with Shadows", | |
| "authors": [ | |
| { | |
| "first": "D", | |
| "middle": [ | |
| "L" | |
| ], | |
| "last": "Waltz", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1972, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Waltz, D. L. \"Generating Semantic Descriptions from Drawings Of Scenes with Shadows\" M.I.T. Technical Report' TR-271. November, 1972.", | |
| "links": null | |
| } | |
| }, | |
| "ref_entries": { | |
| "FIGREF0": { | |
| "type_str": "figure", | |
| "num": null, | |
| "uris": null, | |
| "text": "[unacceptable-apartment-if-too-expensive B (to (refute (rapt is-an-acceptable-apartment) (with-c.omplaint-dept: =the-comptain-dept)) ' [if ([rent apt) ~; S300) (then: (the-complaint-dept <= (rent-of apt is-too-high)))))] [unaccept able-apartment -if-doesn't-have-dishwasher \u2022 (to [refute (taps is-an-neeeptoble-ttpnrtment) (wlth-complalnt-dept: ,the-complain-dept)) (if (apt has-a dishwasher) (else: (the-complaint-dept <-(apt doesn't-have-a dishwasher)))))] ." | |
| }, | |
| "FIGREF1": { | |
| "type_str": "figure", | |
| "num": null, | |
| "uris": null, | |
| "text": "(st [IJCA]-75].Pattern Directed Invocation Using AnonymousObjects One important way in which plans can communicate is through making assertions, erasures, denials using worlds which they share in common\u2022 Another important means of communication is through pattern directed invocation. An important technical problem in implementing pattern directed invocation is how to solve the problem of matching the invoking pattern with the pattern in the trigger of the \u2022pattern of the plan being invokecl..PLASMA uses anonymous objects to solve the .problem. We assume the existence of a generator capable of generating new anonymous individuals anon I, anon 2, etc. which have never before been encountered. To show the utility of such a generator consider the problem of proving (x c_. z) [x is a subset of z] where we have a world which Contains: plan'demonstrate-c_ to be (to (demonstrate (=a~ =c)) try;to demonstrQte that a is a subset o'[ e try (demonst#ate (a C-fib);to demonstrate ihata is a subset of another set[eall'~t b/" | |
| }, | |
| "FIGREF2": { | |
| "type_str": "figure", | |
| "num": null, | |
| "uris": null, | |
| "text": "is-a-ver#e~:-of edge s) \u2022 (vertexb is-n-t,erter-of.edge a) (edge s is-the-edge-of the-line)" | |
| }, | |
| "FIGREF3": { | |
| "type_str": "figure", | |
| "num": null, | |
| "uris": null, | |
| "text": "relation in the triangle stereotype is the relationship of that all three lines join each other. (the-triangle E convex-polygons) i\u00a2{a ... c} 1implies (line i is-an-line-of the~lriangla) (line a joints line b) (line s joinls line c) (line b joints line b) rectangle (convex-polygons) \u2022 i({a ... d} implies (line i i*-a-ilne-o$ the-re.ctangle) (line e joins line b) (line b joi~, llne\u00a2) (line c joins llne d) (line d joins line s ) (line a is-lmrailel-to line c) ' (l|ne b ia-parnUel-to line d) (line s is-opposite line c) (line b is-opposite line d)" | |
| }, | |
| "FIGREF4": { | |
| "type_str": "figure", | |
| "num": null, | |
| "uris": null, | |
| "text": "A wedge stereotype contains five objects [called faces], three of which are rectangles and two of which are triangles. The two triangular faces are opposite each other. wedlze (convex-polyhedrs) i({a ... e} iml)lles (face i is-a-fae~-oJ\" the-wedge) (face n i~-tda,~ular) (face b is-tdan~ular) (face s is-opposile faceb) A Square-Pyramid Stereotyp-A square-pyramid stereotype contains six objects: four of which are triangular faces, one tsa square face, and one Is a vertex. square-pyramid (convex-polyhedra) i([e ... e} implins (face i is-a-face-of the-squire-pyramid ) i({s ... d} implies (face i ia-Ifiangular)(face e is-th~,-baso) (the-vertex is-oppodlo fncee)" | |
| }, | |
| "FIGREF5": { | |
| "type_str": "figure", | |
| "num": null, | |
| "uris": null, | |
| "text": "in the-view) ((v b i~-an-arrow-t,r, rte:r) in the-view) . ((v c i~-nn-I.-vertox) i, the-view) ((v d is-an-arrouH,erteJ:) in the-view) ((v e is-an-l,-T~erte~c) in the-view) ((vf is-an-nrrow-t,~,rto=] in the-view) ((vg is-an-l,-v~rtex) in the-view) Stereotype for Typical View of a Cube Reoognitior~ of Stereotypes ~'e make proRresl if, and only if. w~. are prepared I0 learn from our mistakes. Karl R. Popper Philosophically, this section builds on some work by Karl Popper on Conjectures and Refutations as a scientific methodology. More concretely it builds on a fine piece of work Ben Kuipers did on recognition of kinds of blocks" | |
| }, | |
| "FIGREF6": { | |
| "type_str": "figure", | |
| "num": null, | |
| "uris": null, | |
| "text": "" | |
| }, | |
| "FIGREF7": { | |
| "type_str": "figure", | |
| "num": null, | |
| "uris": null, | |
| "text": "in completely with the {v 3 is-nn-arrow-~ertex)" | |
| }, | |
| "FIGREF9": { | |
| "type_str": "figure", | |
| "num": null, | |
| "uris": null, | |
| "text": "happy with the situation.(h' obtained-by-refutation-of h) I ((block I is-a wedge) in b') | ((side I is-a-view-of face c ofwedge 1) inh') ((side 2 is-a-dew-of fKo a of wedge 1) i~i h') At this point, with. the wedge stereotype directing the exploration, there is only one remaining edge. Unfortunately it. refutes the hypothesis h' i,-a-~rtez-of \u2022 3) (side 3 im-a-trlangle)The observation that side 3 is a triangle conflicts with the" | |
| }, | |
| "FIGREF10": { | |
| "type_str": "figure", | |
| "num": null, | |
| "uris": null, | |
| "text": "populationsituation4 blocks) = i (situation 4 re.~ults-frorn (glue C to A ~, in situation l)) ((block I (blocks) in situations,) ' face a o,r cube i ) i.~-a-/ace.-o[ block/) in situation4) (((face a o,r cube i ) he~-coior red) in situation4)" | |
| }, | |
| "TABREF0": { | |
| "type_str": "table", | |
| "content": "<table><tr><td/><td>\"</td></tr><tr><td>Marvin Minsky i~74</td><td>~</td></tr></table>", | |
| "text": "a collection of eharaoterist;io objects characteristic x:elations for those objects plans invoked bY world directed invocation for transforming the objects and relations qa Overview /]pologyt. The schemes proposed herein are incomplete in many respects. First, I often propose representations without speci[yi.g the. processes that will use them. Sometimes I only describe properties the structures should exhibit. [ talk about markers and assignments as though it were obvious how they are attached and linked; it is not,", | |
| "html": null, | |
| "num": null | |
| }, | |
| "TABREF1": { | |
| "type_str": "table", | |
| "content": "<table><tr><td/><td/><td/><td>I</td></tr><tr><td>Formulated</td><td>in Semantic Nets</td><td/><td>I</td></tr><tr><td/><td/><td/><td>I</td></tr><tr><td/><td/><td/><td>I</td></tr><tr><td/><td/><td/><td>I</td></tr><tr><td/><td/><td/><td>I</td></tr><tr><td/><td/><td/><td>I</td></tr><tr><td/><td/><td/><td>I</td></tr><tr><td/><td/><td/><td>I</td></tr><tr><td/><td/><td/><td>I</td></tr><tr><td/><td/><td/><td>I</td></tr><tr><td/><td/><td/><td>I</td></tr><tr><td/><td/><td/><td>I</td></tr><tr><td/><td>(Kazuo ~ people) ((Kazuo owns Fido) in s O) (Fido (dogs) (dogs eat meat) (cows give meat) (dogs never-are people) \u2022 (cows nether-are people) (dogs never-ar~ cows) (people c animals) (dogs \u00a2 animals) (cows c animals)</td><td>;Kazuo is )]</td><td>I I I I I</td></tr><tr><td/><td/><td/><td>I</td></tr></table>", | |
| "text": "Next we formulate the example in semantic networks.", | |
| "html": null, | |
| "num": null | |
| }, | |
| "TABREF5": { | |
| "type_str": "table", | |
| "content": "<table><tr><td/><td/><td>I</td></tr><tr><td/><td/><td>I</td></tr><tr><td/><td/><td>I</td></tr><tr><td/><td>\"Their [Sussman and McDermott] sohttion, to give the</td><td/></tr><tr><td>I</td><td>user access to the implementation primitives of PI,/INNER, is however, something of a retrograde.step (what are CONNIVER's semantics?), although pragmatically useful and important in the short term, t}</td><td>I</td></tr><tr><td>I</td><td>better solution is to give the user access to a meaningful set of primitive control abilities in a~t explicit \u2022 representational scheme concerned with deductive cqntroi.\" Pat llayes 1'974</td><td>I</td></tr><tr><td>I</td><td/><td>I</td></tr><tr><td>I</td><td/><td>I</td></tr><tr><td>I</td><td/><td>I</td></tr><tr><td>I</td><td/><td>l</td></tr><tr><td>I</td><td/><td>I</td></tr><tr><td>I</td><td>Marvin Minsky 1963</td><td>I</td></tr><tr><td>I I</td><td>Nested Instead Simple retrieval can be done using fragments of micro-worlds that Continuation Control. Structure of CONNIVER-style Possibility Lists consist of single patterns [pattern-directed retrleval]{Hewltt 1969}. For example (find (=apt is-an-apartment-i*n Cambridge)</td><td>I I</td></tr><tr><td>I I I</td><td>;find an al~rtment in Cambrid~re ;then (refute (apt is-nn-acceptoble-apartmenr) (then\" ;find something wren I with tee proposed apartmen! (else: ;else (move-irdo apt)i)) ;move into tee apartment (else: ;~Ite (move-to Arlington)}} ;move to flrlinKton</td><td>I I I</td></tr><tr><td>I</td><td/><td>I</td></tr><tr><td>I</td><td/><td>I</td></tr><tr><td>I</td><td/><td>I</td></tr></table>", | |
| "text": "The use of \"then:\" and \"else:\" continuations seemsto solve the scoping control problem which had been plaguing PLANNER-like languages for some time. CONNIVER attempted to solving the scoping control ' problem by introducing possibility lists and Landln-style non-hierarchical gotos. However possibility lists proved to \u2022have several deficiencies\u2022 They introduced side-effects into the. basic communication mechanisms in CONNIVER which, made it difficult for users to debug their programs since doing a try-next operation to print the next possibility destructively interferes with the operation of the programs being debugged. The other, basic communicatioll mechanisms of CONNIVER similarly have intrinsic'~ide-effects built into their very structure.", | |
| "html": null, | |
| "num": null | |
| }, | |
| "TABREF6": { | |
| "type_str": "table", | |
| "content": "<table><tr><td>I</td><td/><td/><td/></tr><tr><td colspan=\"2\">I Two important characteristic I (face a is-Ol~l)o~ile facef)</td><td>1</td><td>'</td></tr><tr><td/><td>(face s is-adjacent-to faceb)</td><td/><td/></tr><tr><td/><td>(face s is-adjacent-to facet)</td><td/><td/></tr><tr><td>i</td><td>(face b is-adjacent-In faCec)</td><td/><td/></tr><tr><td/><td/><td/><td/><td>I</td></tr><tr><td/><td/><td/><td/><td>I</td></tr><tr><td/><td/><td/><td/><td>I</td></tr><tr><td/><td/><td/><td/><td>I</td></tr><tr><td/><td/><td/><td/><td>I</td></tr><tr><td/><td/><td/><td>Cube</td><td>Wedge</td><td>Square-Pyramid</td></tr><tr><td/><td/><td/><td/><td>Three Common\u2022 Block Stereot~vpes</td><td>I</td></tr><tr><td/><td/><td/><td colspan=\"2\">A Cube Stereotype</td><td>.</td><td>\" \" '</td><td>I</td></tr><tr><td/><td/><td/><td colspan=\"2\">A cube stereotype contains six objects [called faces] which are</td><td>J</td></tr><tr><td/><td/><td/><td>squares.</td></tr><tr><td/><td/><td/><td/><td>\u2022</td><td>~.E b</td><td>I</td></tr><tr><td/><td/><td/><td/><td>I</td></tr></table>", | |
| "text": "relations in the cube stereotype are the l relationship of two faces being adjacent two each other and the relationship of two faces being opposite each other.(the-cube (convex-polyhedra) i~{a .., f'} imldif, s (face i i~-a-faee-of the-cube)i({a ... f} iml~liox (face i is-square)", | |
| "html": null, | |
| "num": null | |
| }, | |
| "TABREF7": { | |
| "type_str": "table", | |
| "content": "<table><tr><td>(h\" ohtnlnr, d-hy-refulatinn-o/\" h')</td></tr><tr><td>((block i is-tz square-pyramid) in h\")</td></tr><tr><td>((side I is-n-i~i~w-o[ face eo[ square-pyramid 1) in h\")</td></tr><tr><td>((side?. is-a-t;iew-o[ face a af square-pyramid[) in h\")</td></tr><tr><td>((side 3 is-~z-f,iew-o[ face b o J\" squareopyramid I ) in h\").</td></tr></table>", | |
| "text": "characteristic relation of the wedge stereotypetheir a wedge does not have two triangular faces Which are adjacent. Again no amount of rotation will help at all. However the triangular face side 3 suggests squeezing the edge of the wedge down to a point suggesting a pyramid. The pyramid stereotype takes a look at side I and decides that the square-pyramid stereotype should be invoked,", | |
| "html": null, | |
| "num": null | |
| } | |
| } | |
| } | |
| } |