Quiz Logic

Question 1

p -> q ==

Answer 1

-p v q

Question 2

Universal Quantification

Answer 2

“for all”, “for every”, “for each”

upsidedown A

Question 3

Existential Quantification

Answer 3

backwards E

“for some”, “there exists”, “there is one”

Question 4

Monotonic

Answer 4

in logic systems means can a truth ever be retracted

Question 5

Converse (of an implication)

Answer 5

is obtained by reversing the roles of the premise and conclusion. Example p -> q becomes q -> p.

Question 6

Inverse (of an implication)

Answer 6

is obtain by negating the premise and the conclusion. -p -> -q

Question 7

Contrapositive of p -> q

Answer 7

-q -> -p

Question 8

Converse, Inverse and Contrapositive of p -> q. Which are always equal?

Answer 8

Converse = q -> p
Inverse = -p -> -q
Contrapositive = -q -> -p
Contrapositive is equivalent to p -> q

Question 9

Statements that are always true or false under the same conditions are called?

Answer 9

tautologies. example p->q == -p v q

Question 10

Associative Law
(p v q) v r = ?
(p ^ q) ^ r = ?

Answer 10

(p v q) v r == p v (q v r) == p v (q v r)
or
(p ^ q) ^ r == p ^ (q ^ r)

Question 11

Distributive Laws
p v (q ^ r) = ?
p ^ (q v r) = ?

Answer 11

p v (q ^ r) == (p v q) ^ (p v r)
or
p ^ (q v r) == (p ^ q) v (p ^ r)

Question 12

De Morgan’s Laws

Answer 12

-(p ^ q) == -p v -q
or
-(p v q) == -p ^ - q

Question 13

p <> q ==

Answer 13

(p -> q) ^ (q -> p)
or
(-p v q) ^ (-q v p)

Question 14

Resolution and how it works?

Answer 14

method assumes that the premises are true and what we are trying to prove is false, and then try to find a contradiction. If we find a contradiction then the proof is true.

Question 15

An expression is in clausal form if there is no

Answer 15

implication ( -> )
conjunction ( ^ )
double negation - (-)

Question 16

Steps to convert to CNF?

Answer 16

1. Remove Biconditional a b == (a -> b) ^ (b -> a)
2. Remove Implication a -> b == -a v b
3. Move Negation Inwards -(a v b) == -a ^ -b
   or
   -(a ^ b) == -a v -b
   or
   -(-a) == a
4. Apply Distribution and/or communitive law
   a ^ (b v y) == (a ^ b) v (a ^ y)
   or
   a v (b ^ y) == (a v b) ^ (a v y)

Question 17

CNF Step 1

Answer 17

Remove Biconditional

Question 18

CNF Step 2

Answer 18

Remove Implication

Question 19

CNF Step 3

Answer 19

Move Negation Inwards

Question 20

CNF Step 4

Answer 20

Apply Distribution and/or Communitive Law

Question 21

Forward Chaining

Answer 21

Bottom Up approach. Data driven thru knowledge base to check assertion

Question 22

Backward Chaining

Answer 22

Top Down approach. Goal driven. Divide Goal into Sub goals. seems to use recursion

Question 23

closed world assumption

Answer 23

means that the database contains all knowledge there is

Question 24

monotonic vs non-monotonic

Answer 24

in a monotonic KB the conclusions can never be removed. in non-monotonic kb the assertions to be revooked

Question 25

resolution with predicate logic

Answer 25

derive a contradiction by finding clauses that resolve to the empty clause

Question 26

Aspects of a good knowledge base

Answer 26

transparent (easy to understand)
we can detect it (understand how it got to where it is, or what choice it is suggesting… etc.)
it should be easy to relate to the real world entities it represents knowledge of

Question 27

extentional

Answer 27

explicit and specific 1, 3, 5, 7

Question 28

intensional

Answer 28

implicit (implied) short compact Natural Odd Numbers < 9

Question 29

executability vs comprehensibility

Answer 29

program can do it but can we know how?

Question 30

Types of knowledge representations

Answer 30

graphical sketches
graphs
conceptual graphs
concept maps
search trees

logic
production systems

oo
frames
scripts

semantic networks

agents

Question 31

graphical sketchs

Answer 31

good for humans, suppress data detals

Question 32

graphs

Answer 32

bridges of Konigsberg and search trees

Question 33

decision tree

Answer 33

yes no type flow chart

Question 34

production system

Answer 34

require control system and a database

rule set

Question 35

What was the first OO Language? What tools does OO offer?

Answer 35

small talk first purely OO language 1969.

Inheritance, Encapsulation, Polymorphism, separation of interface and implementation

Question 36

frames

Answer 36

objects are the same but differ only in the specific details. Frames give a method to store this. Can be represent as networks of nodes and relations

Question 37

weakness of frames

Answer 37

world is messy, definitions are important and getting them right first is hard. Cancelling default values is harder than it looks. As changes must percolate through the system

Question 38

Semantic Networks are often used in

Answer 38

natural language processing and knowledge classification, and can allow capture of arbitrary or complex associations

Question 39

Concept Maps Smart Books

Answer 39

develop concept map via interviews with subject matter experts.
translate final concept map Hypercard/Toolbox
Implement Working prototype
test with students

Question 40

Agents

Answer 40

independent programs/systems that specialize in small tasks, that when work together can solve larger problems. Agent acts intelligently (AI) Agents remember what they did and what inputs caused them to do it. Used in P2P Financial Trading

Question 41

The Major Components Of An AI Production System

Answer 41

Global Database
Rule Set
Control System

Question 42

Characteristics of expert systems:

Answer 42

High performance
Highly responsive
Reliable
Understandable