| { | |
| "paper_id": "T75-2033", | |
| "header": { | |
| "generated_with": "S2ORC 1.0.0", | |
| "date_generated": "2023-01-19T07:43:18.250460Z" | |
| }, | |
| "title": "AFTERTHOUGHTS ON ANALOGICAL REPRESENTATIONS", | |
| "authors": [ | |
| { | |
| "first": "Aaron", | |
| "middle": [], | |
| "last": "Sloman", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "University of Sussex", | |
| "location": { | |
| "settlement": "Brighton", | |
| "country": "England" | |
| } | |
| }, | |
| "email": "" | |
| } | |
| ], | |
| "year": "", | |
| "venue": null, | |
| "identifiers": {}, | |
| "abstract": "", | |
| "pdf_parse": { | |
| "paper_id": "T75-2033", | |
| "_pdf_hash": "", | |
| "abstract": [], | |
| "body_text": [ | |
| { | |
| "text": "In 19711 wrote a paper attempting to relate some old philosophical issues about representation and reasoning to problems in Artificial Intelligence.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "A major theme of the paper was the importance of distinguishing \"analogical\" from \"Fregean\" representations. I still think the distinction is important, though perhaps not as important for current problems in A.I. as I used to think. In this paper I'll try to explain why.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "I'll use the term \"representation\" to refer to a more or less complex structure which has addressable and significant parts, and which as a whole is used to denote or refer to something else. Thus maps, sentences, and phrases like \"The paternal grandfather of the present mayor of Brighton\" are representations. There is much that's puzzling and complex about the concept of using something to \"denote\" or \"refer to \" something else, but for the present I'll dodge that issue and rely on our intuitive understanding thereof. For instance, it enabled him to invent the logic of quantifiers and develop a notation which provided some of the essential ideas of Church's lambda-calculus, and thereby some of the goodies in programming languages like LISP, ALGOL and POP-2.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Throughout", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "I use the word \"Fregean\" not only to honour Frege but also because there is no unambiguous alternative. The most popular rivals -\"symbolic\" and \"verbal\" -are used in too many different ill-defined ways, and in addition the first seems too general, the second too narrow. \"above\", \"behind\", \"intersects\" in T. The conditions (a) and (b) do not hold for Fregean representations.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Throughout", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "A Fregean formula may be very complex, with many parts and relationships, but none of the parts or relationships need corresond to parts or relations within the thing denoted. The phrase \"the city 53 miles north of Brighton\" contains the symbol \"Brighton\" as a part, but the thing denoted does not contain the town Brighton as a part.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Throughout", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The thing denoted, London, has a complex structure of its own, which bears no relation whatsoever to the structure of the phrase.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Throughout", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Similarly \"the father of Fred\", \"63-24\", \"(CAR(CDR(CDR(CONS A (CONS B (CONS C NIL))))))\" have structures which Secondly I wrote as though anyone using a Fregean language, like predicate calculus, would not be interested in ~ the sets of assertions describing some world or problem.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Throughout", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(Minsky and Papert make the same mistake.)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Throughout", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "However, intelligent programmers do not devise theorem-provers which blindly store all axioms in whatever order they are read in, and always have to search the whole lot in order to find assertions relevant to any particular sub-problem or sub-goal.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Throughout", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "If the set of stored assertions is large it will obviously pay to have some kind of indexing scheme, or to store assertions in a network such that each one is associated with pointers to others which might possibly be relevant.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Throughout", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "In fact, Bob Kowalski has shown that one can intimately combine the indexing system with a \"resolution\" inference system so that making inferences by resolution becomes a process of modifying the index to the data-base of axioms. However, no resolution theorem-prover, to my knoweldge,", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Throughout", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "gives the user sufficient access In the case of a predicate calculus theorem-prover, this means that there must be ways of controlling the order in which assertions or inference steps are tried, so as to correspond to the structure of the problem. E.g. if you wish to know whether g comes between ~ and g in the order defined by ~, work through the set of assertions from ~ (or from g) in one direction at a time. A more complex illustration of all these points can be constructed by devising a scheme for storing predicate calculus assertions about family relationships with links which enable the data-base to be used like the usual kind of family tree, instead of an arbitrarily ordered list of facts. So questions like \"Who were all X's cousins?\" or \"Was X the grandfather of Y?\" can be answered with little or no searching, using the analogical properties of the data-base (i.e. relations represent relations). Even the best vision programs presently recognise and use only very few aspects of the 2-dimensional structure of the pictures (or TV-inputs) whichthey attempt to interpret.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Throughout", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The upshot of all this is that I now realise that although it may be interesting and important from a philosophical or psychological standpoint to analyse the analogical/Fregean distinction, and to explore the relative merits of the two sorts of representations, such theoretical discussions don't necessarily help anyone engaged in the task of designing intelligent programs.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Throughout", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The really hard work is finding out what factual and procedural knowledge is required for intelligent performance in each domain.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Throughout", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The most one can achieve by the philosophical analysis is the removal of prejudices.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Throughout", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "But I I I I I I I I I I I I I I I I I I i ", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 4, | |
| "end": 59, | |
| "text": "I I I I I I I I I I I I I I I I I I i", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Throughout", | |
| "sec_num": null | |
| } | |
| ], | |
| "back_matter": [], | |
| "bib_entries": {}, | |
| "ref_entries": {} | |
| } | |
| } |