9. Propositional Logic Flashcards

1
Q

What is logic?

A

A formal way to represent knowledge and reason about the world.

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

What are the key components of a formal logic system?

A

Syntax, semantics, and inference procedures.

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

What are the main types of logic?

A

Propositional logic, first-order logic, temporal logic, probability theory, fuzzy logic, and Markov logic.

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

What is propositional logic?

A

A type of logic where sentences represent facts that are either true or false.

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

What are the basic logical connectives?

A

AND (∧), OR (∨), IMPLIES (→), BICONDITIONAL (⇔), and NOT (¬).

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

What is a literal?

A

A symbol or its negation (e.g., 𝑝 or ¬p).

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

What is a clause?

A

A disjunction (OR) of literals (e.g., p∨q).

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

What is a unit clause?

A

A clause with only one literal (e.g., p).

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

What is a term?

A

A conjunction (AND) of literals (e.g., p∧q).

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

What is the operator precedence in propositional logic?

A

¬,∧,∨,→,⇔ (in order of decreasing precedence).

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

What is a tautology?

A

A sentence that is always true regardless of interpretation (e.g., p∨ ¬p).

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

What is a contradiction?

A

A sentence that is always false regardless of interpretation (e.g., p∧ ¬p).

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

What are De Morgan’s Laws?

A

¬(p∨q)≡¬p∧¬q and ¬(p∧q) ≡¬p∨¬q

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

What is entailment (⊨) in propositional logic?

A

Sentence p is entailed by s (s ⊨ p) if p is true whenever s is true.

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

What is a model in propositional logic?

A

A world (truth assignment) in which a sentence is true.

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

What is conjunctive normal form (CNF)?

A

A conjunction (AND) of disjunctions (OR) of literals (e.g., (p∨q)∧(¬p∨r)).

17
Q

What is proof by refutation?

A

A method of proving entailment by assuming the negation of the query and deriving a contradiction.

18
Q

How does proof by refutation work?

A

Convert knowledge base (KB) into CNF, add ¬p (negation of the query), and derive a contradiction.

19
Q

What is the difference between evaluation and satisfaction?

A

Evaluation determines the truth value of a sentence in a specific world, while satisfaction finds all models where a sentence is true.

20
Q

What is syntax in logic?

A

The set of symbols and rules used to express knowledge.

21
Q

What is semantics in logic?

A

The meaning of sentences and how they relate to the world.

22
Q

What are inference procedures?

A

Rules for deriving new sentences (facts) from existing ones.

23
Q

What is an example of a propositional sentence?

A

o∧h→r (hot AND humid IMPLIES it is raining).

24
Q

What is the identity law in logic?

A

p∧T=p, p∨F=p.

25
Q

What is the domination law?

A

p∨T=T, p∧F=F.

26
Q

What is the contrapositive equivalence?

A

p→q≡¬q→¬p.

27
Q

How can a non-CNF sentence be converted into CNF?

A

Using logical equivalences and transformation rules (e.g., distributing disjunctions over conjunctions).

28
Q

What is a knowledge base (KB)?

A

A set of sentences that lists all the rules an agent knows about the world.