Notes 9: Inference in Firstorder logic - PowerPoint PPT Presentation

About This Presentation
Title:

Notes 9: Inference in Firstorder logic

Description:

Notes 9: Inference in First-order logic. ICS 171 Fall 2006 ... Appending two lists to produce a third: append([],Y,Y). append([X|L],Y,[X|Z]) :- append(L,Y,Z) ... – PowerPoint PPT presentation

Number of Views:41
Avg rating:3.0/5.0
Slides: 48
Provided by: vib3
Learn more at: https://ics.uci.edu
Category:

less

Transcript and Presenter's Notes

Title: Notes 9: Inference in Firstorder logic


1
Notes 9Inference in First-order logic
  • ICS 171 Fall 2006

2
(No Transcript)
3
(No Transcript)
4
(No Transcript)
5
(No Transcript)
6
(No Transcript)
7
(No Transcript)
8
(No Transcript)
9
(No Transcript)
10
(No Transcript)
11
(No Transcript)
12
(No Transcript)
13
(No Transcript)
14
(No Transcript)
15
Unification
  • To unify Knows(John,x) and Knows(y,z),
  • ? y/John, x/z or ? y/John, x/John,
    z/John
  • The first unifier is more general than the
    second.
  • There is a single most general unifier (MGU) that
    is unique up to renaming of variables.
  • MGU y/John, x/z

16
The unification algorithm
17
The unification algorithm
18
(No Transcript)
19
(No Transcript)
20
(No Transcript)
21
(No Transcript)
22
(No Transcript)
23
(No Transcript)
24
(No Transcript)
25
(No Transcript)
26
(No Transcript)
27
(No Transcript)
28
(No Transcript)
29
(No Transcript)
30
(No Transcript)
31
(No Transcript)
32
(No Transcript)
33
(No Transcript)
34
(No Transcript)
35
(No Transcript)
36
(No Transcript)
37
(No Transcript)
38
(No Transcript)
39
(No Transcript)
40
(No Transcript)
41
(No Transcript)
42
(No Transcript)
43
Logic programming Prolog
  • Algorithm Logic Control
  • Basis backward chaining with Horn clauses
    bells whistles
  • Widely used in Europe, Japan (basis of 5th
    Generation project)
  • Compilation techniques ? 60 million LIPS
  • Program set of clauses head - literal1,
    literaln.
  • criminal(X) - american(X), weapon(Y),
    sells(X,Y,Z), hostile(Z).
  • Depth-first, left-to-right backward chaining
  • Built-in predicates for arithmetic etc., e.g., X
    is YZ3
  • Built-in predicates that have side effects (e.g.,
    input and output
  • predicates, assert/retract predicates)
  • Closed-world assumption ("negation as failure")
  • e.g., given alive(X) - not dead(X).
  • alive(joe) succeeds if dead(joe) fails

44
Prolog
  • Appending two lists to produce a third
  • append(,Y,Y).
  • append(XL,Y,XZ) - append(L,Y,Z).
  • query append(A,B,1,2) ?
  • answers A B1,2
  • A1 B2
  • A1,2 B

45
(No Transcript)
46
(No Transcript)
47
(No Transcript)
48
(No Transcript)
Write a Comment
User Comments (0)
About PowerShow.com