If it is possible to extend each pair of consistent variable instantiation to a third variable, a CSP is said to be ___________

  1. Home

Question:
 If it is possible to extend each pair of consistent variable instantiation to a third variable, a CSP is said to be ___________

1.arc consistent

2.i- consistent

3.path consistent.

4.2- consistent

Posted Date:-2022-06-26 22:59:50

More MCQS Questions and answers

  1. Backtracking is based on ____________
  2. First Order Logic is also known as ___________
  3. Frame problem in STRIPS Domain can be solved by _____________________
  4. If a logic produces only true statements and does not produce any false statement it shows which of the following property
  5. If it is possible to extend each pair of consistent variable instantiation to a third variable, a CSP is said to be ___________
  6. In a rule-based system, procedural domain knowledge is in the form of:____
  7. iv. Compound Logic"
  8. The statement comprising the limitations of FOL is/are ____________
  9. There exists two way to infer using semantic networks in which knowledge is represented as Frames.
  10. What can be viewed as a single lateral of disjunction?
  11. What is the nature of the sentence: ∀x ∀y (TeacherOf(x,y) ⊃ StudentOf(y,x))
  12. Which of the following algorithm is generally used CSP search algorithm?
  13. Which of the following are true for the algorithms Beam Stack Search (BSS)and Divide-and-Conquer Beam Stack Search (DCBSS).
  14. Which of the following combination of labels is not allowed for W joint in scene labelling is not allowed
  15. Which of the following conditions must hold for a solution to a CSP?
  16. Which of the following is a sound rule of inference?
  17. Which of the Following problems can be modeled as CSP?
  18. Which of the following statement(s) is true for Sparse-Memory Graph Search (SMGS)?
  19. Which search algorithm imposes a fixed depth limit on nodes?
  20. __ is/are the well known Expert System/s for medical diagnosis systems
  21. _______ algorithm keeps track of k states rather than just one.
  22. _______ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill.
  23. ___________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations.
  24. ____Graph is used to represent semantic network
  25. ____search regresses over goals and validate a plan before returning it.
  26. ____search regresses over goals and validate a plan before returning it.
  27. A _________ is used to demonstrate, on a purely syntactic basis, that one formula is a logical consequence of another formula.
  28. • is evaluated last.
  29. Choose the correct option.
  30. From which rule does the modus ponens are derived?
  31. Graph used to represent semantic network is ______
  32. In PDDL,the Language is based on ________
  33. Operator PUTDOWN has which of the following sequence of actions?
  34. PDDL stands for_____________________
  35. STRIPS operators are made up of which three components:
  36. STRIPS operators are made up of which three components:
  37. The __________algorithm explores the domain in a depth first manner.
  38. The formula or sentences that can be maid true by certain valuation function are called
  39. The inference engine goes through which cycle?
  40. The output of MATCH routine in Inference Engine is ______
  41. The performance of an agent can be improved by __________
  42. The working memory of the problem solver is like its _________________
  43. What among the following constitutes the representation of the knowledge in different forms?
  44. What are Semantic Networks?
  45. Which form is called as a conjunction of disjunction of literals?
  46. Which is the most straightforward approach for planning algorithm?
  47. Which is used to compute the truth of any sentence?
  48. Which of the following elements constitutes the frame structure?
  49. Which of the following is an extension of the semantic network?
  50. Which problem can frequently occur in backward chaining algorithm?
Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!