Propositional and First Order Logic Questions and Answers

Q: Why is logic attractive as a representation for an agent?

Adding a sentence extends what the agent knows without any code being written, which is the declarative promise that motivated the whole approach. Speed is generally poor, every logic makes an ontological commitment, and first order questions are not answerable in bounded time. The ability to extend a system by stating facts rather than by programming is the property that justified the cost, and it is worth naming precisely.

Q: What is the main practical objection to logical agents?

Almost everything an agent believes is probable rather than certain and admits exceptions, which classical logic handles badly and probability theory handles naturally. That objection drove the field's shift towards probabilistic methods. Storage, soundness and relations are not the difficulty. An approach whose limitation lies in the character of the knowledge rather than in the machinery is one that must be supplemented rather than optimised.

Q: How did the field respond to the defeasibility of real knowledge?

Bayesian networks and the non-monotonic logics were both developed to handle knowledge that is uncertain or defeasible, and the probabilistic branch has proved by far the more influential. Restriction to certain domains would exclude almost everything interesting, and adding rules to a monotonic logic cannot make it non-monotonic. Two distinct responses to the same limitation, one of which prospered, is a piece of the field's history worth knowing when reading older literature.

Q: What remains valuable about the logical tradition?

Where a conclusion must be justified, audited or guaranteed, an explicit derivation from stated premises is exactly what is required, and no learned model supplies it. Speed, learning and coverage are where the alternatives are stronger. Judging a tradition by the properties it uniquely supplies, rather than by whether it won, is what allows it to be combined sensibly with the approaches that displaced it.

Q: What is a proposition symbol?

In propositional logic each symbol stands for a whole statement with no internal structure, so nothing can be said about the objects the statement concerns. Object denotation, connectives and bindable variables belong to first order syntax. That the smallest unit is a whole fact, rather than an object or a property, is exactly the limitation that first order logic removes, and stating it precisely explains why the step upward was needed.

Q: What are the standard propositional connectives?

The five connectives build compound sentences from simpler ones, and each has a truth table fixing exactly when the compound is true. Quantifiers belong to first order logic, and the other lists are arithmetic and programming constructs. That every connective is truth functional, so the truth of a compound depends only on the truth of its parts, is what makes truth tables a complete account of the semantics.

Q: What does truth functional mean?

Truth functionality means a connective's behaviour is fully described by a table, so no further information about the parts is needed. Natural language connectives such as because are not truth functional, which is one reason translating English into logic loses content. Return types, applicability and evaluation cost are different matters. A property that makes a complete tabular semantics possible is what separates the connectives of logic from those of ordinary speech.

Q: Why is material implication an imperfect rendering of if then?

If the moon is made of cheese then two plus two is five counts as true, because a false antecedent makes the material conditional true whatever the consequent says. Everyday conditionals carry a suggestion of relevance the truth table cannot express. Truth tables exist, the direction is preserved, and the last option describes conjunction. Knowing exactly where a formalisation departs from the idiom it renders is what allows the departure to be lived with rather than stumbled over.

Q: What practical consequence does vacuous truth have?

A rule whose conditions are never satisfied is trivially true and contributes nothing, which is why an existential claim written with implication says almost nothing. It is the same phenomenon as a universal restriction satisfied by an individual with no such role. Conditionals are essential, converses are separate claims, and conjunction changes the meaning. One phenomenon appearing in three different formalisms, each time catching people out, is worth recognising once and for all.

Q: What is a well formed formula?

Well formedness is purely syntactic, decided by whether the expression can be built from atoms by the formation rules, and it says nothing about truth. Sentences are the well formed formulas without free variables, and normal forms are particular shapes. Truth and provability are semantic and proof theoretic notions respectively. Being able to say whether an expression is even a candidate for having a truth value is the first thing a syntax must settle.

91.

Why is logic attractive as a representation for an agent?

A.Knowledge can be added without changing the reasoning machinery
B.Logical inference is faster than any alternative method
C.Logic requires no commitment about what the world contains
D.Every question can be answered in bounded time

Answer: A

Adding a sentence extends what the agent knows without any code being written, which is the declarative promise that motivated the whole approach. Speed is generally poor, every logic makes an ontological commitment, and first order questions are not answerable in bounded time. The ability to extend a system by stating facts rather than by programming is the property that justified the cost, and it is worth naming precisely.

Discuss in Forum

92.

What is the main practical objection to logical agents?

A.Logic cannot represent relations between several objects
B.Real knowledge is uncertain and defeasible rather than categorical
C.Logical formulas cannot be stored in a computer efficiently
D.No sound inference procedure exists for any useful logic

Answer: B

Almost everything an agent believes is probable rather than certain and admits exceptions, which classical logic handles badly and probability theory handles naturally. That objection drove the field's shift towards probabilistic methods. Storage, soundness and relations are not the difficulty. An approach whose limitation lies in the character of the knowledge rather than in the machinery is one that must be supplemented rather than optimised.

Discuss in Forum

93.

How did the field respond to the defeasibility of real knowledge?

A.By restricting attention to domains with certain knowledge
B.By adding more inference rules to classical logic
C.By developing probabilistic and non-monotonic formalisms
D.By abandoning knowledge representation altogether

Answer: C

Bayesian networks and the non-monotonic logics were both developed to handle knowledge that is uncertain or defeasible, and the probabilistic branch has proved by far the more influential. Restriction to certain domains would exclude almost everything interesting, and adding rules to a monotonic logic cannot make it non-monotonic. Two distinct responses to the same limitation, one of which prospered, is a piece of the field's history worth knowing when reading older literature.

Discuss in Forum

94.

What remains valuable about the logical tradition?

A.The speed of logical inference on large knowledge bases
B.Its ability to learn representations directly from data
C.The completeness of its coverage of commonsense knowledge
D.Precise semantics, auditable inference and clear guarantees

Answer: D

Where a conclusion must be justified, audited or guaranteed, an explicit derivation from stated premises is exactly what is required, and no learned model supplies it. Speed, learning and coverage are where the alternatives are stronger. Judging a tradition by the properties it uniquely supplies, rather than by whether it won, is what allows it to be combined sensibly with the approaches that displaced it.

Discuss in Forum

95.

What is a proposition symbol?

A.An atomic statement that is either true or false
B.A symbol denoting an object in the domain of discourse
C.A connective joining two sentences into a compound one
D.A variable that a quantifier may bind in a formula

Answer: A

In propositional logic each symbol stands for a whole statement with no internal structure, so nothing can be said about the objects the statement concerns. Object denotation, connectives and bindable variables belong to first order syntax. That the smallest unit is a whole fact, rather than an object or a property, is exactly the limitation that first order logic removes, and stating it precisely explains why the step upward was needed.

Discuss in Forum

96.

What are the standard propositional connectives?

A.Assignment, comparison, iteration and selection of statements
B.Negation, conjunction, disjunction, implication and equivalence
C.Universal and existential quantification over objects
D.Addition, subtraction, multiplication and division of values

Answer: B

The five connectives build compound sentences from simpler ones, and each has a truth table fixing exactly when the compound is true. Quantifiers belong to first order logic, and the other lists are arithmetic and programming constructs. That every connective is truth functional, so the truth of a compound depends only on the truth of its parts, is what makes truth tables a complete account of the semantics.

Discuss in Forum

97.

What does truth functional mean?

A.The connectives may be applied to any expression whatever
B.The truth of a sentence may be computed in constant time
C.The truth of a compound depends only on the truth of its parts
D.Every function in the language returns a truth value

Answer: C

Truth functionality means a connective's behaviour is fully described by a table, so no further information about the parts is needed. Natural language connectives such as because are not truth functional, which is one reason translating English into logic loses content. Return types, applicability and evaluation cost are different matters. A property that makes a complete tabular semantics possible is what separates the connectives of logic from those of ordinary speech.

Discuss in Forum

98.

Why is material implication an imperfect rendering of if then?

A.It cannot be given a truth table in propositional logic
B.It reverses the direction of the everyday conditional
C.It requires both parts to be true for the whole to be true
D.It is true whenever the antecedent is false, regardless of relevance

Answer: D

If the moon is made of cheese then two plus two is five counts as true, because a false antecedent makes the material conditional true whatever the consequent says. Everyday conditionals carry a suggestion of relevance the truth table cannot express. Truth tables exist, the direction is preserved, and the last option describes conjunction. Knowing exactly where a formalisation departs from the idiom it renders is what allows the departure to be lived with rather than stumbled over.

Discuss in Forum

99.

What practical consequence does vacuous truth have?

A.A conditional with a false antecedent asserts nothing useful
B.Conditionals cannot be used in knowledge bases at all
C.Every conditional must be accompanied by its converse
D.Implications must be replaced by conjunctions in practice

Answer: A

A rule whose conditions are never satisfied is trivially true and contributes nothing, which is why an existential claim written with implication says almost nothing. It is the same phenomenon as a universal restriction satisfied by an individual with no such role. Conditionals are essential, converses are separate claims, and conjunction changes the meaning. One phenomenon appearing in three different formalisms, each time catching people out, is worth recognising once and for all.

Discuss in Forum

100.

What is a well formed formula?

A.A formula written in conjunctive normal form
B.An expression built according to the syntax rules of the logic
C.A formula that has been proved to be true in every model
D.A formula containing no free variables whatever

Answer: B

Well formedness is purely syntactic, decided by whether the expression can be built from atoms by the formation rules, and it says nothing about truth. Sentences are the well formed formulas without free variables, and normal forms are particular shapes. Truth and provability are semantic and proof theoretic notions respectively. Being able to say whether an expression is even a candidate for having a truth value is the first thing a syntax must settle.

Discuss in Forum

Loading…

Topics

Other Subjects

Tags: Propositional and First Order Logic Questions and Answers || Propositional and First Order Logic MCQ Questions and Answers || Propositional and First Order Logic GK Questions and Answers || Propositional and First Order Logic GK MCQ Questions || Propositional and First Order Logic Multiple Choice Questions and Answers || Propositional and First Order Logic GK || GK on Propositional and First Order Logic || Artificial Intelligence Questions and Answers || Artificial Intelligence MCQ Questions and Answers || Artificial Intelligence GK Questions and Answers || GK on Artificial Intelligence

Propositional and First Order Logic Questions and Answers

Topics

Other Subjects

About Us

Stay informed about all important Dates & Notifications