Q 41. A _________ is used to demonstrate, on a purely syntactic basis, that one formula is a logical consequence of another formula.
Q 42. The formula or sentences that can be maid true by certain valuation function are called
Q 43. What is the nature of the sentence: ∀x ∀y (TeacherOf(x,y) ⊃ StudentOf(y,x))
Q 44. ______Graph is used to represent semantic network
Q 45. Is the following rule of inference valid one
Q 46. If a logic produces only true statements and does not produce any false statement it shows which of the following property
Q 47. Not only do formal logics allow representation of knowledge, but they also allow representation of knowledge Mechanisms for reasoning using a collection of well-defined manipulation rules Of Representations.
Q 48. _______ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill.
Q 49. The performance of an agent can be improved by ______
Q 50. Which of the following are true for the algorithms Beam Stack Search (BSS)and Divide-and-Conquer Beam Stack Search (DCBSS).