# Past Exam for CS 4804 - Introduction to AI at Virginia Tech (VT)

## Exam Information

 Material Type: Mid-Term Professor: Staff Class: CS 4804 - Introduction to AI Subject: Computer Science University: Virginia Polytechnic Institute And State University Term: -- Keywords: PropositionalEither...orConjunctionContradictionInference RulesPropositional LogicModus PonensConstraints

## Sample Document Text

CS 4804 Midterm Exam Name: ID: 1. (10 points) What is the name of the search algorithm that uses f(n) = g(n) as the node evaluation function? Is this algorithm optimal? Is it complete? Assume path costs are non-decreasing as you go down a path. 2. (30 points) Give an example of a 4-node constraint graph that is arc-consistent but not 3- consistent. For ease of illustration, you can use a graph coloring example. Clearly label the nodes with the variables, identify the domains of each variable, and label the edges in the graph with the constraints. Explain why your graph is not 3-consistent. 3. (20 points) In the 'cute word puzzle,' the goal is to make up ve-letter words where four of them are vowels (i.e., 'a,' 'e,' 'i,' 'o,' 'u'). An example cute word is 'queue'; another is 'uigoa.' Even though only the rst word makes sense in English, both are considered valid answers to the puzzle. Pose the cute word puzzle as a boolean satis ability (SAT) problem in CNF form, i.e., the boolean expression ...

## Related Documents

Definite Truth Values Notes
Alcoholic Beverage Notes
Binding List Notes
Constructive Dilemma Notes
Either...or Exam
Propositional Logic Notes
Either...or Exam
Either...or Notes
Average Children Notes
Either...or Exam
Either...or Exam
Conjunction Notes
Constructive Dilemma Notes