Artificial Intelligence and Computer Vision 2019
Exam topics for Artificial Intelligence
- Basic concepts: history, goals of AI, Turing test, early systems,
puzzles, "toy problems"
- State space representation
- Searching the state space: greedy methods (and their problems),
simulated annealing, tentative and irrevocable strategies
- Backtracking search, recursive implementation
- Graph searching
- "Blind" methods: breadth-first, depth-first, iterative
deepening search
- Cost-based methods: uniform-cost and best-first
- The A* algorithm, properties, variants
- Constructing heuristic functions
- Searching for two-person games: the minimax algorithm, alpha-beta
cuts
- Constraint satisfaction problems, local constraint checking, arc
consistency, constraint propagation
- Logic-based representation
- Propositional calculus
- Atomic propositions, logical connectives.
- Semantics of the propositional sentences. Interpretations.
Evaluating formulas.
- Prolog
- Simple facts. Facts with arguments. Rules.
- Answering questions. Variables and unification. Search. Recursion.
- Lists.
- Probabilistic representation
- Basic concepts: prior probability, probability axioms, random
variables, joint probability distribution, conditional probability,
Bayes' rule
- Probabilistic belief networks: construction, reasoning
- Making simple decisions: preferences and utility functions,
the MEU principle, the value of information
- Sequential decision problems: Markov decision processes, agent's
policy, state sequence utilities, discounting, policy evaluation,
the value iteration algorithm
- Action planning
- Classical action planning task
- Search and logic-based approaches
- STRIPS and ADL representation, the PDDL language
- Planning in the plan space, the POP algorithm
Monday, 28-Jan-2019 21:29:34 CET