121

APPENDIX ONE

DATA BASE FOR THE PROBLEM IN CHAPTER THREE

1.. THE!STYa < POPULATION, 740CXH NATION, TWODOR; POSITION, [ 18, 23J>

2 •• OTHER!POSSIBLE def !IN.2=C'"'C Xa"'E Y a Y ! IN.I ? C""E i'H'IaWt'4 = C"CI ill (("E ZaZ CURRENT!SIGHTINGS lAND SUB<Z>=Y ?I~=[[POSITIONCZ>J,[ JJ > !OR <"E ZaZ !ISIN lAND SUBCZ>=Y ?<""E VaV=POSITIONCZ> Ra[V.I,R,V.2l !ISIN NEXT!POINTS ?l'l=[R,[!UN V.l,!UN V.2J JJ)))) ?X=<SUB,Y;POSITION,fl~l>))

I I SIN !ISIN

!IN.3 ?"'E [! UN

3.. HERRINGa < TYPE, SUBMARINE; NAME, HERRING; NATION, FORDOR>

4.. SMFISHa < TYPE, SUBMARINE; NAME, SMFISH; NATION, DH>DOR>

5 •• ADJACENT def r""E Ya Y !ISIN ADJ!VECTOR 1 "E UtU=!IN.I.I+Y.I !AND 0 !LEQ U lAND U !LEQ 60? "'E Vt V= !IN.I.2 + Y.2 !AND 0 !LEQ V !AND V !LEQ 80 1 !IN.2=[U,VJ >

6.. FLOUNDERa < TYPE, SUBMARINE; NAME, FLOUNDER; NATION, FORDOR>

7 •• POSSIBLE def !IN.2=C"'C Xt"'E YaY !ISIN !IN.3 ?"'E Wt[!IN.I-DAYCY>,POSITIONCY>,W,[ JJ !ISIN POS ITI ONER ?X= <SU 8, SUB CY); POSITION, W>)

8.. Plt [ < SUB, HERRINGI POSITION, [ [ [38, 201 J, [ J] > 1

9 •• S3t [ < DAY, 31 SU3, FLOUNDER; TYPE, AT! SEA; POSITION, [34, 571>, < DAY, 51 SUB, GUPPY; TYPE, AT!SEA; POSITION, [45, 691>, < DAY, 2; SUB, HERRINGI TYPE, AT!SEAI POSITION, [8, IBJ>l

10 •• THE!WATER def -E LLa LL = ("'Cl Za Z !ISIN THE!I'IETWORK ? !IN.2 !GEQ Z.l !AND !IN.2 !LEQ Z.2 !AND r""E Wa W=!IN.I+CZ.3>* C<!IN.2)/2) ? W !GEQ Z.4 lAND W !LEQ Z.5))

122

I 1 • • FS a [ HERRING l

12 •• THE!PITTSa <NATION, FORDORI POPULATION, 812961 POSITION, [26, 601>

13.. SIGHTINGSa [ < DAY 1 21 SUB, HER!HNG I TYPE, AT!SEAJ POSITION, [20, 8]> 1 < DAY, 41 SUB, GUPPY; TYPE, IN!PORTI POSITION, [44, 681> 1 < DAY, 31 SUB, FLOUNDER' TYPE, AT!SEAI POSITION, [34, 571>1

1 4 • • ADJ ! VECTOR I [ [ 0 t 2 ] t [ -1 t 1 ] I [ -1 t -I ] t ( 0 t

-21, [1, -11, [1, 1]]

15 •• NUM def !IN.2 =c·c xa•E Y• Y !ISIN !IN.1 ?X=[Y, CPOSITIONCY).1).0, CCPOSITIONCY>.1>.0>+ C CPOSITIONCY>.2>.0>J>

16 •• LLORNAD<X>Na <NATION, TWODORI POPULATION, 362501 POSITION, [44, I l>

17.. ICTHYOSAURa < NATION, TI'40DOR' NAME, ICTHYOSAURI TYPE, SUBMARINE>

18 •• POSITIONER def !IN.t !LEQ 0 !AND !IN.3 = ! IN.2 !OR ! IN.1 !GTR 0 !AND c•E UaU= <"'Cl Xa [!IN.2, X,!IN.4l !ISIN NEXT!POINTS > !AND .... E Wa [!IN.t-I,U,rl,[!UN !IN.2,!UN !IN.41l !ISIN POSITIONER? [!UN ri,!UN !IN.2l = !IN.3»

19 •• FORDOR!SUBS• lFLOUNDER, GUPPY, HERRINGJ

20 •• UNDP def !IN.2=C.,.C Xa X !ISIN !IN.I ?c-E YI!IN.I.Y =X ?!NOT <X !ISIN !IN.t !FROII CY+1> !TO !INF>>>

21.. FORDOR!PORTI < POSITION, [44 1 681>

22 •• THE!WETWORKa [ [12, 44, I, 40 1 741, [60, 80 1

-I, O, 701, [0, I 2, 1, 40, 64 J, [44, 48, -I, -4, 561, [48, 56, I, 50, 801, [56, 60, I, 50, 941, [6, 10, 1 1 21,441, [10, 16, -t, 23,311, [58, 60, I, 44, 1101, [38, 44, -1, 30,361, [50, 60, I, 104, 1101, [40, 50, I, 78, IOOJ, [30, 34, -1, 2, tOll

23.. SUBSa [SAWFISH, ICTHYOSAUR, SEA!CUCUMBcR, FLOUNDER, GUPPY, HERRING l

24.. NEXT!~>INTS def !IN.2=c·c Z•~E Y• Y !ISIN

123

!IN.J ? lY,ZJ !lSIN ADJACENT? !NOT lZ,[!UN !IN.3, !UN ! IN.I 11 ! ISIN INSET lAND !NOT Z ! ISIN MARKER lAND Z !ISIN THE!~ATER>

25.. TWODOR!SUBS• [SAWFISH, ICTHYOSAUR, SEA !CUCUMBER 1

26 •• TWODOR!PORTI <POSITION, [6, 13))0

27.. SEAICUCUMBER• < TYPE, SUBMARINE; NAME, SEA!CUCUMBER; NATION, TWODOR>

28 •• WITHIN!RANGE def "'E U• U=!IN.1.1-!IN.2.1? ""'E Va V= !IN.I.2-!IN.2.2 1 3*U*U+4*V*V ILEQ 4*! IN.3*! IN.3

29.. MERGE def ""'E Y• Y !ISIN !IN.I 1 !IN.2= (~Cl Xa(""'E Wa W !ISIN CURRENTISIGHTINGS 1 SUB<~)=Y lAND X=W) IOR ("'E Wa W !ISIN SIGHTINGS ?SUB<W> = Y !AND X=i'f))

30.. T~ODOR !CTIES• [MINASITRONEY, LLORNADOON, THE!STY 1

31.. UNDIP def IN.2=<"'C Xa""'E Y•AE Za!IN.I.Y=Z? !NOT< <"'E Wa!IN.I.W=Z? W !LSS Y)))

32.. MINAS!TRONEY• <NATION, TWODORI POPULATION, 55000 I POSITION, [6, 18 1>

33 •• INSET def !IN.I !ISIN !IN.2

34.. UNDUP def !IN.2=<""'C xa~E Ya""'E Z•!IN.I.Y • Z lAND <!NOT <Z !ISIN !IN.I !FROM 1 !TO <Y-1 ))) ? X=Z>

35.. GUPPY• < TYPE, SUBMARINE; NAME, GUPPY; NATION, FORDOR>

36.. FORDOR!CITIES• [THE!PITTS, CHICKEN!NCX>DUL, BARDAHLJ

37.. CITIES• [MINAS!TRONEY, THE !PITTS, LLORNADOON, THE!STY, CHICKEN!N<X>DUL, BARDAHLJ

38.. BARDAHLI < POSITION, [28, 7411 NATION, FORDOR I POPULATION, 42 000 >

39.. CHICKEN!NOODULI <NATION, FORDORI POPULATION,

124

556001 POSITION, [4 9 721>

40 •• REV!DUP def !IN.2=C'"'C X•"'E Y• Y !ISIN IIN.I ? ""E ZaZ =<""Cl ;~a[POSITIONCY>.I,r4J !ISIN UNDUP>?X = <SUB, SUB <Y) 1 POSITION, [Z, POSITION <Y). 2 l >)

125

APPENDIX T~O

A SAMPLE RUN

*REVERSER def !IN.I.O=I lAND !IN.2=liN.I !ORC"'E YHliN.I !FROM 2 !TO !INF,Yl !ISIN REVERSER. !AND ! IN. 2 = [ ! UN Y, ! IN. I • I J > $

*LAST• [2, LISTl$

*LI ST I [ I , 2 , [ LI STJ 1 $

*LOST: [ [LISTJ, 2, I 1$

*EOUAL def !IN !ISIN SUBSEf lAND [llN.2,liN.IJ ! I SIN SUBSETS

*SUBSET def !ALL X: X !ISIN !IN.I ? X !ISIN !IN.2$

*!MODE$ INDICATE OPTIONSCCURRENTLY XG XJ F - _ W> XGJ*

*LUST:"CI XHLIST,Xl !ISIN REVERSER$

** AN INVOCATION OF REVERSER ~ITH [LIST, XCvar> 1

**** AN INVOCATION OF REVERSER VIITH [ 2 , [ LI ST 1l , Y <var > 1

****** AN INVOCATION OF REVERSER !'IlTH Y <var > 1

-----VALUE=---<3-3-3; 0,64)-----> [ [L!STJJ

****** REVERSER HAS BEEN FOUND TRUE

**** Rt:VERSER HAS BEEN FOUND HUE

----V.&.LUE=---<1-2-3; 0,2>-----> [ [LISTJ, 2, I 1

[LISTJ J,

126

** RJ::VERSER HAS BEEN FOUND TRUE

*LUST$ [ [LlS'fl, 2, 11

*LUST=LOSTS true

*LSSTI[!UN LUST,2,21S

*!MODE$ INDICATE OPTIONSCCURRENTLY XG XJ F - _ wO

* SYMBOLS-21 C22) SPACE--18<18) OVHD-0 CODE--0 TIME CCPU>- .177/ .213 <CONSOLE>- 9.979 <DUTYl- .021

*LSSr'[ LSST• [ [LlSTJ, 2, 1, 2, 21$

SYMBOLS--21 < 22 > SPACE-1 8 CIB > OVHD-0 CODE--I TIME CCPU>- .216/ .230 CCONSOLE>- 9.033 <DUTY>- .025

*[LSST,LISTJ !ISIN SUBSETS

** AN INVOCATION OF SUBSET rHTH [LSST, LIST)

-----ITEM--<1-1-1; 17,7>-----> [LISTJ

-----ITEM---<1-1-1; 1,7>-----> 2

-----ITEM--- (J-1-1; I, 7 >---->

-----ITEM---<1-1-1; 1,7>-----> 2

-----ITEM---<1-t-1; 1,7>----> 2

** SUBSET HAS BEEN FOUND TRUE

true

127

SYMBOLS-21(22) SPACE--18<18) OVHD-2 CODE--14 TIME <CPU>- 1.236/ 1.305 CCONSOLE>- 16.150 <DUTY>- .081

*LI ST=LSST$

fal se

SY)!.ßOLS-21 (22> SPACE--18< 18) OVHD--0 CODE--2 TIME CCPU>- .125/ .141 CCONSOLE>- 1.'397 <DUTY>- .074

*[LIST,LSSTl !ISIN EQUALS

** AN INVOCATION OF EQUAL t'IITH [LIST, LSSTl

**** AN INVOCATION OF SUBSET WITH [LIST, LSSTl

----ITEM---<2-1-1; 3, 22> ---->

----ITEM---<2-1-1; I ,22>-----> 2

----ITEM--<2-1-1; I ,22>-----> [L!STl

**** SUBSET HAS SEEN FOUND TRUE

**** AN INVOCATION OF SUBSET I'HTH [LSST, LI STl

--- ITEM-- C2-l-2; I 7, 33 > ---- > [LI STl

----ITEM---<2-1-2; 2,33>-----> 2

---ITEM---<2-J-2; 2, 33>----->

---ITEM---<2-1-2; 2,33>----> 2

---ITEM--(2-J-2; 2, 33>-----> 2

**** SUBSET HAS BEEN FOUND TRUE

** J::QUAL HAS BEEN FOUND TRUE

true

SYMBOLS--21 (22) SPACE-18C18) OVHD--4 CODE-34

128

TIME CCPU>- 3.024/ 3.153 CCONSOLE>- 18.380 CDUTY>- .172

*!MODES

*

INDICATE OPTIONSCCURRENTLY XG XJ F -**- W>

5Y'~BOLS-21C22> SPACE--18(18> OVHD--0 CODE-0 TIME CCPU>- .143/.173 CCONSOLE>- 3.873 CDUTY>- .045

*[LSST,LISTJ !ISIN EQUALS

true SYM30LS--21 C22) SPACE-18( I 8) OVHD-4 CODE--34 TIME CCPU>- 1.149/ 1.255 CCONSOLE>- 6.601 CDUTY>- .190

*PATH !DEF !IN.I !ISIN PREDSC!IN.2> !AND !IN.3=[!1N.I,!IN.2J !OR

c~E YaY IISIN PREDSCIIN.2> ? c-t Za(!IN.I,Y,ZJ !ISIN PATH? IIN.3=t!IN.I,IUN Zl>>s

SYMBOLS--23( 22 > SPACE-1 8 Cl8 > OVHD-0 CODE--I TIME CCPU>- .222/ .248 <CONSOLE>- 31.956 CDUTY>- .008

*D• <PREDS,(CJ>S

SYMBOLS--27 <24 > SPACE-20 (18} OVHD-0 CODE-6 TIME CCPU>- .428/ • 444 CCONSOLE>- 39.230 CDUTY >- .01 I

*C•<PREDS,(B,Al>S

SYMBOLS-30 <28) SPACE--23<20 > OVHD-0 CODE--7 TIME CCPU>- .277/ .323 CCONSOLE>- 17.848 <DUTY>- .018

*BI <PREDS' (A] >$

SYMBOLS-31(31> SPACE-25<23) OVHD--0 CODE--6 TIME (CPU>- .314/ .340 CCONSOLE>- 31.413 CDUTY>- .Oll

* !MODE$

129

INDICATE OPTIONS( CURRENTLY XG XJ F -**- i'O

SYMBOLS-31 (32) SPACE--25<25) OVHD-0 CODE--0 TI ME ( CPU >- • 205/ • 243 < CONSOLE >- 19. 628 CDUTY >- • 0 I 2

*"'Cl Xa[A,D,Xl !ISIN PATH$

** AN INVOCATION OF PATH ~'IlTH IA, 0, X <var> l

---ITEM---Cl-2-21 42,30)----> Cr < PREDS, [8, Al>

****AN INVOCATION OF PATH WITH [A, C, Z<var>J

----VALUE=--<2-3-3; 0,35>-----> [A, Cl

**** PATH HAS BEEN FOUND TRUE

-----VALUE=---( 1-3-3; 0,1 >----> IA,• C, DJ

** PATH HAS BEEN FOUND TRUE

IA, c, Dl

SYMBOLS-32<32> SPACE--25(25) OVHD-8 CODE--86 TIME CCPU>- 4.123/ 4.208 CCONSOLE>- 280.931 <DUTY>- .015

*PATHSr ~c Xr[A,D,Xl !ISIN PATHS

** AN INVOCATION OF PATH WITH [A, D, XCvar> J

·---ITEM---(1-2-2; 42,31>----> Cr < PREDS, [B, Al>

**** AN INVOCATION OF PATH WITH [A, C, ZCvar> J

-----VALUE=---<2-3-3; 0,36)----> [A, CJ

**** PATH HAS SEEN FOUND TRUE

----VALUE=--<1-3-3; 0,2>-----> [A, C, Dl

130

** PATH HAS SEEN FOUND TRUE

-----ITEM---(2-4-4; 45,100)-----> aa < PREDS, [AJ>

****** AN INVOCATION OF PATii WITH [A, B, ZC var > J

-----VALUE=---<3-5-5; 0,105>-----> [A, 81

****** PATH HAS BEEN FOUND TRUE

-----VALUE=---<2-5-5; 0,36>-----> [A, B, CJ

**** PATH HAS BEEN FOUND TRUE*

-----VALUE=--C 1-3-3; 0,2>----> [A, B, C, DJ

** PATH HAS SEEN FOUND TRUE

-----ITEM--<3-6-6; 44,147>-----> A

******** AN INVOCATION OF PATH (HTH [A, A, Z Cvar> J

******** PATH HAS BEEN FOUND FALSE

****** PATri HAS BEEN FOUND TRUE*

-----ITEM--<2-4-4; 4,100>----> A

****** AN INVOCATION OF PATH ~ITH [ A, A, ZC var > J

******** AN INVOCATION OF PATH i'IITH CA, undefined, ZCvar>l

******** PATH HAS BEEN FOUND FALSt BY DEFAULT

****** PATH HAS BEEN FOUND FALSE

**** PATH HAS BEEN FOUNO TRUE*

** PATH HAS BEEN FOUND F ALSE

PATHSI [ PATHS.I, PATHS.2J

SYMBOLS--35 C 33 > SPACE-34 C25 > OVHD-24 CODE-165 TIME CCPU>- 12.485/ 12.799 CCONSOLE>- 692.137 CDUTY>- .018

131

*PATHSS

PATHSa ( lA, C, Dl, tA, B, C, Oll

SYMBOLS--35(36) SPACE--34(34) OVHD--0 CODE--I TIME CCPU>- .1971 .212 CCONSOLE>- 4.925 CDUTY>- .043

*lEXITS DL STAR SLOWLY

INTO THE SUNSET

5 I

N K s

** ********

************ ************** ************

******** **

132

BIBLIOGRAPHY

[11 Winograd, Terry, Erocedures as ~ Representation fgr ~ 1o ä Computer Program tar Understandine Natural Languaqe, Memo TR-84, Project MAC <February 1971)

[21 Banerji, Ranan B. , "A Language for the Description ot Concepts", General Systems, 9, 1964, < pp 135-141 >

[31 Beard, H. N and Kenney, D. c. , Bored ot the Rings, New American LibraryCSeptember 1969}

[41 VanLehn, Kurt A. Ced.> , ~~Manual, Stanford Al Labaratory Memo AIM-204CJuly 1973)

[51 Sussman, G.J. and Winograd, Terry , ~ Planner Reference Manual , Al Memo 203a, MIT Project MACCJuly 1970)

[61 Sussman, Gerald J. and McDermott, Drew Vincent , aDy Conniving ~ ßetter ~ Planning, Al Memo 255a, MIT Project MAC <April 1972>

[71 Rulifson, J.L. et. al. , QA=i• Calculus ~r Intuitive Reason1n1 Technical Note 73 <November 1973

A procedur al SRI AI Center

[81 Teitleman,w. et. al. , lnterlisp Reterence Manual , Xerox Palo Alto Research Center <1973>

[91 Feldman J.A. and Rovner, P.D. Associative Language ", CoiTIII. , PP 439-449)

, "An Algol Based ACM, 12,8 <August 1969

[101 Bobrow, D.G. and Raphael, B. , New Programmlog Languages for Al Research, SRI Technical Note 82,CAugust 1973}

133

AUTHOR INDEX

Banerji, Ranan, 4 Beard, H. N.

and Kenney, D. c., 82 Bobrow, D. G.

and Raphae1, B. 105 Fe1dman, J. A.

and Rovner, P. D., 105 Kenney, o. c.

and Beard, H. N., 82 McDerrnott, o. V., 105 Raphae1, B.

and Bobrow, D. G., 105 Rovner, P. o. ·

and Fe1dman, J. A., 105 Ru1ifson, J. L., 105 Sussman, G. J.

and Winograd, Terry and McDermott, D. v., 105

Teit1eman, w. (et a1), 105 Van Lehn, Kurt A. (ed.), 103 Winograd, Terry

and Sussman, G. J., 105

134

StJBJECT INDEX

"all"1 251 29 "and" 1 l61 24

simultaneousl 109 <A-op> 1 151 41 attribute1 12-141 106 <attribute-name> 1 11 Available space1 74, 107

Back tracking 1 37-40, 108-111 example of1 39-40

"base" 1 69 <base-statement> 1 12 1 77 <basis-part>1 48

caveat 76 <ca.o~uaion-part>l 251 261 281 291 30 "cons" 1 25 1 31 <consone-statement>l 251 15 <construct-statement>l 251 15 "cons1•1 251 31

and backtrackingl 39-401 54 context mechanisml 1041 ll61 120

<declaration-statement> 1 41 "def" 1 41 1 43 1 54 <definition-body> 1 41 <definition-name>l 41 <definition-value>41 1 44 "defn"1 411 431 461 54

and loop checkingl 43 Dictionary (symbol table)l 731 106 <digit>l 12 <dump-statement>l 69

"edit"1 61-65 edit commands1 62-64 <E-expression> 1 121 l61 41 <E-form>l 12 Equality1 definition of1 21-23 Errors, 70-71

GLITCR 1 71 NONCE 1 71 RETRIEVAL I 71

<E-term>, 15 "exist:, 25, 29 <exist-statement>, 25 "exit", 69 <exit-statement>, 69 "execute", 119

135

<expression>, 16, 13, 41 Expressions, Arithmetic, 19-21

foreach loop, 110 Fordor, 82ff "from:, 15, 18

"geg", 16, 21 global (object or list), 13 "gtr", 16, 21

<I-constant>, 16 <I-expression>, 15, 41 "in", 41, 42, 44 "input", 57 input options, 58 <input-statement>, 57, 58 <induction-part>, 48 "inf", 15, 18-19, 77 <In-term>, 15 <invar>, 41 invocation (of a definition), 41, 16, 44 <I/0-statement>, 57 "isin", 16, 41, 44 <item>, 12 <I-term>, 15

"leg", 16, 21 <letter>, 12 list, 12, 17, 106 <list>, 12 <list-form>, 11 <list-list>, 11 local (object or list), 12, 107 loop checking (inrecursive definitions), 43

example, 49-56 "lss", 16, 21

"mod", 15, 19, 20 "mode", 65 <mode-statement>, 65-69

136

<name>, 11, 41 "neg", 16, 21 <non-local-valued-expression>, 11, 41 "not", 16, 24

in search scope, 28

object, 12, 17, 106 <object>, 12 <object-form>, 11 Operators, Arithmetic (definition of), 19-20 "or", 16, 24

and backtracking, 37-38 "outavsp", 69 "output", 57 <output-statement>, 57-58 "outsymb", 69

<pair>, 11 <pair-list>, 11 <parameter>, 41 <P-element>, 41 <P-list>, 41 <P-list-form>, 41 <P-object>, 41 <P-pair>, 41 <P-pair-list>, 41 <P-statement>, 15

<Q-statement>, 25, 41 <quantifier>, 25

Recursive definitions, 46-56 loop checking in, 46, 51

"remove", 59 <remove-statement>, 59-61 <R-op>, 16

"sand", 109, 119 "scratch", 57 <scratch-statement>, 57, 59 <search-part>, 25-26, 28-30 search scope, 26-27, 110 search space, 26ff

dimension of, 34ff, 75f segment variable, 111-112 "sexist", 109 simultaneous connectives, 109, 119

137

simultaneaus quantifiers, 109 "sor", 109, 119 <S-primary>, 16 <S-statement>, 16, 25, 41 <statement>, 25 Statement, inseparable, 33, 35-37 Statement, Primitive, 21-23 Statement, Quantified, 25-40 statement, separable, 33-35

strong1y, 34. Statement, Simple, 23-24

<temporary-local-list , 59-60 <term>, 15, 16-19 theorem

antecedent, 113 consequent, 113 erase, 114

"to", 15, 18 trace of definition ca1ls

examp1e of, 50-53 Twodor, 82ff "un", 11, 13, 41 <Upper-case-letter>, 12 value, 12, 106 <value>, 11 -value-, 16

of basic Statements and terms, 16-23 of quantified statements, 28-40 of formal parameters, 44-56 of definitions, 44-56

<variable>, 25, 26 <variable-name>, 41 warnings, 76-79

lnterdisciplinary Systems Research Birkhäuser Verlag, Basel und Stuttgart

ISR 1 Rene Hirsig Menschliches Konformitätsverhalten - am Computer simuliert Ein dynamisches Prozessmodell 1974, 165 Seiten, 43 Abbildungen, 3 Tabellen. ISBN 3-7643-0712-g

ISR 2 Werner Hugger Weltmodelle auf dem Prüfstand Anspruch und Leistung der Weltmodelle von J. W. Farre­ster und D. Meadows 1974, 178 Seiten, 51 Figuren, 2 Faltblätter. ISBN 3-7643-0749-8

ISR 3 Claus Schönebeck Der Beitrag komplexer Stadtsimulationsmodelle (vom Forrester- Typ) zur Analyse und Prognose großstädtischer Systeme 1975, 129 Seiten. ISBN 3-7643-0750-1

ISR 4 Christof W. Burckhardt (Editor) lndustrial Robots - Robots industriels -Industrieroboter Tagungsberichte der Journees de Microtechnique 1975, 224 Seiten. ISBN 3-7643-0765-X

ISR 5 Kuno Egle Entscheidungstheorie Eine strukturtheoretische Darstellung 1975, 246 Seiten. ISBN 3-7643-0776-5

ISR 6 Dieter Ru/off Konfliktlösung durch Vermittlung: Computersimulation zwischenstaatlicher Konflikte 1975, 228 Seiten. ISBN 3-7643-0777-3

ISR 7 Salomon Klaczko Systemanalyse der Selbstreflexion Eine inhaltliche Vorstudie zu einer Computersimulation mit einem Computerprogramm von Kari-Heinz Sirnon 1975, 358 Seiten. ISBN 3-7643-0778-1

ISR 8 John Craig Comfort A Flexible Efficient Computer System to Answer Human Questions The DL * Programming Language for Artificial lntelligence Applications 1975, 145 pages. ISBN 3-7643-0779-X

ISR 9 Richard Rickenbacher Lernen und Motivation als relevanzgesteuerte Datenverarbeitung Ein Computer-Simulationsmodell elementarer kognitiv-affektiver Prozesse 1975, 247 Seiten. ISBN 3-7643-0787-0

ISR 10 James Gips Shape Grammars and their Uses 1975, 252 pages. ISBN 3-7643-0794-3

1975

Wolfgang Rauschenberg: Computereinsatz bei der Planung von betrieblichen Layouts Kritische Analyse gegebener Algorithmen und Entwurf eines neuen dreidimensionalen Verfahrens

Helmut Maier: Computersimulation mit dem Dialogverfahren SIMA Konzeption, Dokumentation, Möglichkeiten und Grenzen des Einsatzes in der wirtschafts- und sozialwissenschaft­liehen Forschung, Planung und Planungspraxis mit zwei Anwendungsbeispielen

S. Klaczko: Vorlesungen über künstliche Intelligenz

Reinhold Siegel: Zur Anwendbarkeit von System Dynsmies in der Lager­haltung

Charles Dunning: Graph Theory and Games

Manfred Wett/er: Computersimulation des Verstehens von Sprache Ein Reader über neue Forschungen auf dem Gebiet der Computational Semantics

Salomon Klaczko (Hrsg.): Kybernetik und Psychologie Tagungsberichte eines Symposiums der Schweizerischen Vereinigung für Kybernetik und Systemwissenschaften an der Universität Zürich, Oktober 1974

Ulrich Maser: Formale Modelle und Computersimulation in der Psy­chologie Ein Reader mit Artikeln diverser Autoren zum affektiv-kog­nitiven Verhalten des Menschen

Rolf Kappe/: Überprüfung prozesspolitischer Strategien an einem Simulationsmodell Kybernetische Ansätze zur Steuerung von Volkswirtschaf­ten

G. Matthew Bonharn and Michael J. Shapiro: Thought and Action in Foreign Policy Proceedings of the London Conference on Cognitive Process Models of Foreign Policy, March 1974

C. V. Negoita and D.A. Ralescu: Applications of Fuzzy Sets to Systems Analysis

Jean Vuillemin: Syntaxe, Semantique et Axiomatique d'un Language de Programmation simple

Alexander van der Bellen: Formale Ansätze zur allgemeinen und kollektiven Präferenztheorie Pfad-Unabhängigkeit und andere Kriterien für Auswahl­funktionen, unter besonderer Berücksichtigung kollektiver Entscheidungsregeln

Dana Ballard: Hierarchie Recognition of Tumors in Chest Radiographs

George Stiny: Pictorial and Formal Aspsets of Shape, Shape Grammars and Aesthetic Systems

Richard Young: Seriation by Children

Hartmut Bosse/, Norbert Müller, Salomon Klaczko (Editors): System Theory for Social Science Applications Stochastic Systems, Pattern Recognition, Fuzzy Systems and Simulation