Logik und Logische Programmierung EinfÃ¼hrung

More documents

Recommendations

Info

Prologʼs Datastructures! Constants:!human(socrates).! Integers, Reals:!fib(0,1).pi(3.141).!lower-case functor (Compo<strong>und</strong>) Terms:!left_of_tree(tree(L,R),L).!right_of_tree(tree(L,R),R).!?- left_of_tree(tree(leaf(2),leaf(3)),R).!
Lists in Prolog! Empty list:! [] ! (syntactic sugar for nil )! Non-Empty list with first element H and tail T:! [H|T] ! (syntactic sugar for .(H,T) )! Fixed-length list:! [a] ! (syntactic sugar for [a | [] ] = .(a,nil) )! [a,b,c] ! (syntactic sugar for [a | [b | [c | [] ] ] ] )!
Page 1 and 2: Logik und Logische ProgrammierungEi
Page 3 and 4: Teil 1:!(Mathematische)LogikGregor
Page 5 and 6: (Mathematische) Logik! Auch symboli
Page 8: Verschiedene Logiken! Aussagenlogik
Page 11 and 12: Syntax der Aussagenlogik Junktoren
Page 13 and 14: Darstellung in Aussagenlogik! (A_Ri
Page 15 and 16: Truth Tables! " ¬! ! # " ! $ " ! %
Page 17 and 18: Äquivalenz, Logische Folge! A und
Page 19 and 20: Aussagenlogik!Problemif(x==null) {s
Page 21 and 22: TheoremKurze Geschichte II!GödelsU
Page 23 and 24: Teil 2:Logische Programmierung &Pro
Page 25 and 26: Kurze Geschichte III!Predicate Logi
Page 27 and 28: Klassische vs Logische Programmieru
Page 29 and 30: OVERLOAD BREAKAGE - CHIP LOAD PER T
Page 31: Prologʼs Syntax! Facts!human(socra
Page 35 and 36: Practical Advantages! Automatic Mem
Page 37 and 38: Truth Table in Prolog! Prolog: 17 C
Page 39 and 40: TruthTable.javafor (Permutator p =
Page 41 and 42: IdCollector.javapackage de.jastram.
Page 43 and 44: But Prolog will not be as fastRight
Page 45 and 46: LIPS! Logical Inferences per Second
Page 47 and 48: Opening (25 May 2009)!TEN DECLARATI
Page 49 and 50: Background Material! Ulf Nilsson an
Page 51: Some Existing Prolog Systems! Prolo

Logik und Logische Programmierung EinfÃ¼hrung

Create successful ePaper yourself

Delete template?

Save as template?