* *

* *

* *1.

* *1.1 AristotleLeibnitzGottlob Frege (1848-1925),2030

* *1.2

* *

()

* *

* * (consistent)AAA ()

* * (domain)LILII I I I I I I I ()

* *(reliable)II I (complete) Gdel

* *(decidable) A A(undecidable)

* * - / : --

* *1.3 Bolle: :(A (B A))((A (B C)) ((A B) (A C)))(((A))(B) (B A)):(modus ponensMP)

* *1.4 ()Frege: ():(A (B A))((A (B C)) ((A B) (A C)))(((A)(B)) (B A))vA Atv (tAv)v(A B) (vA vB)A vA (vA):

* *

()

* *2. ()HornProlog

* *2.1 C1 = PQR C2 = PQC1C2QR

S()S S A iff S A

* *2.2 Horn()()P, Q, RPQRHornL1L2 LnHornHornP Q1 Q2 QnP Q1, Q2, , Qn

* *Horn P Q1, Q2, , Qn P Q1, Q2, , Qn : AT(dog, x) AT(Zhang, x) AT(Zhang, train) AT(dog, train) AT(dog, train)AT(dog, x){train/x}AT(Zhang, x) AT(Zhang, train)

* *2.3 PrologProlog(Programming in logic)Horn1972Alain. ColmerauerProlog1975Prolog

* *Prologstudent(john)married(tom,mary)B: AABbird(x) : animal(x)has(x, feather)? student(john)? married(maryx)

* *Prolog

()

* *PrologProlog(term)0221586Johnstudentlikessister-ofFOLPrologX, Y, Answer, _value()likes(john, X)married(mary, jack)

* *(1) likes(bell, sports)(2) likes(mary, smith)(3) likes(mary, sports)(4) likes(jones, smith)(5) friend(john, X) : likes(X, sports), likes(X, smith) ()(6) ? friends(john, Y) ()()(7)? likes(X, sports), likes(X, smith)(8)? likes(bell, smith) (bell / X)(7)? likes(X, sports), likes(X, smith)(8)? likes(mary, smith) (mary / X)

* *PrologHornPrologPrologPrologPrologPrologPrologProlog

* *3.

* *3.1 AAB B

(1) Th( )(2) 1 2 Th(1) Th(2)(3) Th(Th( )) Th( ) ()

* *3.2

(4) P ()

* *4. 1980Reiter(Default Logic)

* *4.1 (x):i(x): (x):Mi(x)

* *4.2 DW D DS(S)(1) W (S)(2) Th((S)) = (S)Th((S)) = {A|(S) A}(3) D

(S)1, , m S (S)

* *4.3 E(E) = EED(fixpoint)E (extension) E Th({B, F})

* *2D { }

W {B, CFA, AC E} E1 Th(W{A, C})E2 Th(W{A, E})E3 Th(W{C, E, G})

* *5.1980McCarthy(Circumscription)APP

* * CIRC,

2.1 L0p1,p2L0 p1p2 p1 p2, x, p1(x) = l, p2(x) = l

* * 2.2 A ApAp' p' p , p1 p2p1p2 2.3 M A, BA M B BA

* * 2.4 A P = {p1,p2,... , pn} Ap Z-App p, p1, p2 p1 Z- p2 z Z,

p1 (Z) = l, p2 (Z)= l

* * 2.5 P CIRC(A,P)A A P A p-

2.1 A p A P

* * 2.6 LTLM[T] M*[T]TM*[T]M[T], M*[T] M[T]

(1) MM*

(2) TMM*

(3) M*M

* * TMTM'M' M

2.7 Mm

M Mm , M = Mm

* * D={1,2} T=xy(P(y)Q(x,y)) =[(P(1) Q(1,1)) (P(2) Q(1,2))] [(P(1) Q(2,1)) (P(2) Q(2,2))]

M: P(1) P(2) Q(1,1) Q(1,2) Q(2,1) Q(2,2) T T F T F TM*: P(1) P(2) Q(1,1) Q(1,2) Q(2,1) Q(2,2) F T F T F T

* *6.TMS1979Doyle(Truth Maintenance System)(belief)

* *:

* *6.1 IN-OUT- SLCP

* *(SL()())IN-IN-;OUT-OUT-1:(1) (SL( )( ))(2) (SL(1)( ))(1),;(2)(1).,TMS,.1SL

* *2:(1) (SL( )( ))(2) (SL(1)(3))(3) (1)IN,(3)OUT,(2)IN.(3),(2)OUT,.(2),OUTSL.OUT(3)(2).(3),.TMS,,.

* *(CP )IN-,:(1) ININ-;(2) OUT-OUT-.CP.,OUT-.TMS,.IN-IN,OUT-OUT,IN.2CP

* *6.2 {F1, F2, , Fn},G,G{F1, , Fn}.Node(Fi):(SL(G)(F1, , Fi-1 , Fi+1, , Fn))Fi.FiFiIN,Fj(i j)OUT.Fj,FjIN,FiOUT.

* *6.3 ,TMS,.:(1) ,,.(2) .(3) SA(),OUT-.

* *(4) (SL(1,3)( ))(14:00)3:(1) (SL( )(2))(2) (3) 14:00(SL(32,40,61)())(5) (CP4 (1,3)( ))(2) (SL(5)( ))(2)(5)IN,(1)OUT,(1)(2)OUT.(4)OUT..

* *7 S0do(, s)s do(put(A, B), s)sAB do(putdown(A)), do(walk(L)), do(pickup(A))[pickup(A), walk(L), putdown(A)]

* *1 LsitcalcDD = Dss Dap Duna DSo DapDssDuna DSo

* * Do(a, s, s) Poss(a[s], s) s = do(a[s], s) Do(?, s, s) [s] s = s Do([1, 2], s, s) (s* ). Do([1], s, s* ) Do([2], s*, s) defdefdef

* * Do((1 | 2), s, s) (s* ). Do(1, s, s) Do(2, s, s)def Do((x) (x), s, s) (x). Do((x), s, s) def Do(*, s, s) (P). {(s1)P(s1, s1) (s1, s2, s3)[P(s1, s2) Do(, s2, s3) P(s1, s3)]} P(s, s) def

* * MaCarthy Reiter Fangzhen LinPirriaLifschitz LevesqueReiter Golog / ConGolog Baral A-Prolog

* *200620001989

*8888