Module 5 Flashcards

1
Q

What are knowledge based agents

A

Use process of reasoning to decide actions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is a knowledge base

A

Set of sentences in formal language

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What’s is the declarative approach to build KB agent

A

Tell what it needs to know
Ask itself what to do from KB
Operations involve inference

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Can single inference algorithm answer any solvable question

A

Yes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is inference engine and KB

A

KB - domain specific facts

Inference engine - generic code

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Describe the KB agent flow

A

Given percept, agent adds percept to KB and asks KB for best action, it communicates KB that it took action

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

List types of KB agents

A

Declarative - build KB by telling it what it needs to know

Procedural - Encode desired behaviours as program code

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

How do agents acquire knowledge

A

Through percept - (transition model and sensor model)

Can keep track of partially observable world

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is syntax

A

What sentences are allowed, defines well formed sentences

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is semantics

A

Meaning of sentence linked to the world, where it’s true / false

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is entailment

A

One thing logically follows another

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

When does KB entail a

A

Iff a is true in all worlds where KB is true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is a model

A

M is a model of a sentence a if a is true in m

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is M (a)

A

The set of all models of a

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What is inference

A

Allows new sentences to be derived from KB

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Inference notation

17
Q

What does KB |-I a mean

A

Sentence a can be derived from KB by using inference I

18
Q

What is the soundness of inference

A

Everything probable is true, no false positives, derived entailed sentences. KB |-i a true then KB |= a is true

19
Q

What is the completeness of inference

A

Everything true is possible, no false negatives. KB |= a true then KB |-I a is true

20
Q

KB transference into real world

A

If KB is true in real world, then any sentence a derived from KB by a sound inference is also true in real world

21
Q

Types of inference proofs

A

Model checking - for every possible world, if a is true make sure b true aswell

Theorem proving - search for a sequence of proof steps leading from a to b

22
Q

List the types of logic

A

Propositional
First order logic
Relational db

23
Q

What is propositions calculus and what does proposition help with

A

Proposition helps with inference and and propositional calculus is language of propzrisitons

24
Q

What is a well formed formula

25
What does PL deal with
Validate and unsatisfiability of a formula and derivation of new formulas
26
What is a tautology
Iff a is true in all interpretations
27
When is a formula valid
Valid iff tautology
28
When is formula consistent
If at least one interpretation true
29
When is formula inconsistent/unsatisfiable?
Iff a is always false in all interpretations
30
Truth table pros and cons
Pros - good for small number of clauses and good at representing survey Cons - n atoms lead to 2^n entries, all entries may not be relevant
31
Reasoning pattern for inference
And elimination Modus pones De Morgan’s law Monotonic, sound but not complete
32
Resolution refutation
Negation of goal is proved by showing empty set.
33
Conjunctive normal form
( V V V ) /\ ( V V V)
34
Conversion to CNF
eliminate -> and Eliminate ~~ Use de Morgan Use distributive
35
If two clauses contains complementary literals
Can be resolved | New clauses is resolvent to parent clauses
36
Another name for resolvent
Logical consequence