Supplemental slides for CSE 327 Prof Jeff Heflin Syntax of FirstOrder Logic Sentence AtomicSentence ComplexSentence AtomicSentence PredicateTerm Term Term ComplexSentence ID: 343093
Download Presentation The PPT/PDF document "Ch. 8 – First Order Logic" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
Slide1
Ch. 8 – First Order Logic
Supplemental slides for CSE 327
Prof. Jeff HeflinSlide2
Syntax of First-Order Logic
Sentence
AtomicSentence | ComplexSentenceAtomicSentence Predicate(Term,…) | Term = TermComplexSentence (Sentence) | Sentence | Sentence Sentence | Sentence Sentence | Sentence Sentence | Sentence Sentence | Quantifier Variable,… SentenceTerm Function(Term,…) | Constant | VariableQuantifier |
From Figure 8.3, p. 293Slide3
Knowledge-Based Agent
function
KB-Agent
(percept) returns an action persistent: KB, a knowledge base t, a counter, initially 0 indicating time TELL(KB, Make-Percept-Sentence(percept, t)) action ASK(KB, Make-Action-Query(t)) TELL(KB, Make-Action-Sentence(action, t)) t t + 1 return actionFrom Figure 7.1, p. 236Slide4
Minesweeper PEAS Description
Performance Measure
percentage of mines found
EnvironmentNxM grid with random placement of minesActuatorschoose a squareSensorschosen square has x adjacent minesor uncover mine and lose gameSlide5
Minesweeper Predicates
Environment
Mine(s)
square s has a mine in itSensingNearbyMines(s,k)square s has k adjacent minesCleared(s)square s is safe (didn’t uncover a mine)Slide6
Minesweeper Axioms
s
Cleared(s) Mine(s) s,r NearbyMines(s,0) Adjacent(s,r) Mine(r) s NearbyMines(s,1) r Adjacent(s,r) Mine(r) (t Adjacent(s,t) Mine(t) r=t) also need 6 other rules for 1<k<8s,r NearbyMines(s,8) Adjacent(s,r) Mine(r) x,y,a,b Adjacent([x,y],[a,b]) (a=x+1 a=x a=x-1) (b=y b=y+1
b=y-1)
(a=x
a=y)
Legal([
x,y
])
Legal([
a,b
])
x,y
Legal([
x,y
])
x > 0
y > 0
x
N
y
M Slide7
Kinship Domain
A
1
: x Male(x) Female(x)A7: x,y Sibling(x,y) xy p Parent(p,x) Parent(p,y)A4: p,c Parent(p,c) Child(c,p)A
3
:
x
,
y
Spouse(
x
,
y
) Spouse(
y
,
x
)
A2: w,h Husband(h,w) Male(h) Spouse(h,w)
A5: x,y Parent(x,y) Ancestor(x,y)
A
6
:
x
,
y
,
z
Ancestor(
x
,
y
)
Parent(
y
,
z
)
Ancestor(
x
,
z
)