OOPS
December 23, 2023Artificial-Intelligence
December 23, 2023Artificial-Intelligence
| Question 34 |
Which of the following statements are true?
A) A sentence ∝ entails another sentence ß if ß is true in few words where is true.
B) Forward chaining and backward chaining are very natural reasoning algorithms for knowledge bases in Horn form.
C) Sound inference algorithms derive all sentences that are entailed.
D) Propositional logic does not scale to environments of unbounded size.
Choose the correct answer from the options given below:
A) A sentence ∝ entails another sentence ß if ß is true in few words where is true.
B) Forward chaining and backward chaining are very natural reasoning algorithms for knowledge bases in Horn form.
C) Sound inference algorithms derive all sentences that are entailed.
D) Propositional logic does not scale to environments of unbounded size.
Choose the correct answer from the options given below:
| (A) and (B) only
| |
| (B) and (C) only | |
| (C) and (D) only | |
| (B) and (D) only |
Question 34 Explanation:
Statement A is false : The relationship of entailment between sentence is crucial to our understanding of reasoning. A sentence α entails another sentence β if β is true in all world where α is true. Equivalent definitions include the validity of the sentence α⇒β and the unsatisfiability of sentence α∧¬β.
Statement D is false:Propositional logic does not scale to environments of unbounded size because it lacks the expressive power to deal concisely with time, space and universal patterns of relationships among objects.
Statement B is true:
Refer the below link:
https://www.iiia.csic.es/~puyol/IAGA/Teoria/07-AgentsLogicsII.pdf
Statement C is true:
Sound/truth preserving: An inference algorithm that derives only entailed sentences. Soundness is a highly desirable property. (e.g. model checking is a sound procedure when it is applicable.)
Statement D is false:Propositional logic does not scale to environments of unbounded size because it lacks the expressive power to deal concisely with time, space and universal patterns of relationships among objects.
Statement B is true:
Refer the below link:
https://www.iiia.csic.es/~puyol/IAGA/Teoria/07-AgentsLogicsII.pdf
Statement C is true:
Sound/truth preserving: An inference algorithm that derives only entailed sentences. Soundness is a highly desirable property. (e.g. model checking is a sound procedure when it is applicable.)
Correct Answer: D
Question 34 Explanation:
Statement A is false : The relationship of entailment between sentence is crucial to our understanding of reasoning. A sentence α entails another sentence β if β is true in all world where α is true. Equivalent definitions include the validity of the sentence α⇒β and the unsatisfiability of sentence α∧¬β.
Statement D is false:Propositional logic does not scale to environments of unbounded size because it lacks the expressive power to deal concisely with time, space and universal patterns of relationships among objects.
Statement B is true:
Refer the below link:
https://www.iiia.csic.es/~puyol/IAGA/Teoria/07-AgentsLogicsII.pdf
Statement C is true:
Sound/truth preserving: An inference algorithm that derives only entailed sentences. Soundness is a highly desirable property. (e.g. model checking is a sound procedure when it is applicable.)
Statement D is false:Propositional logic does not scale to environments of unbounded size because it lacks the expressive power to deal concisely with time, space and universal patterns of relationships among objects.
Statement B is true:
Refer the below link:
https://www.iiia.csic.es/~puyol/IAGA/Teoria/07-AgentsLogicsII.pdf
Statement C is true:
Sound/truth preserving: An inference algorithm that derives only entailed sentences. Soundness is a highly desirable property. (e.g. model checking is a sound procedure when it is applicable.)