7 - Inference FOL Flashcards

1
Q

Datalog is a ________.

A

Datalog is a DECLARATIVE LOGIC PROGRAMMING LANGUAGE.

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

Backward Chaining

A

Depth-first recursive proof search

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

Disadvantages of Backward Chaining

A

Incompleteness (Infinite Loops) & Inefficiency (Repeated Subgoals)

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

Advantage of Backward Chaining

A

Uses less rules than forward chaining (Linear Space Efficiency)

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

Generalized Modus Ponens

A

Enables forward/backward chaining of Horn clauses in FOL

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

Propositionalization

A

Enables inference rules from prop. logic in FOL

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

Disadvantage of Forward Chaining

A

FC may not terminate (Peano Axiom for natural numbers)

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

Logic programming is based on ________.

A

BACKWARD CHAINING

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

PROLOG

A

Language based on BC with Horn clauses

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

Prolog: a => b

A

b:-a

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