• Student home
• Things to know this week
• Student news
• Student events
• New students' welcome
• Studying at York
  • Semesters
  • Teaching hours
  • Enrolment
  • Manage your studies
    • Enrol or re-enrol
    • e:Vision and your student record
    • Your timetable
    • Change your plan
    • Programmes and modules
      • Programme specifications
      • Studying beyond your department
      • Module catalogue
    • University study spaces
  • Student Visa holders
  • Study skills
  • Assessment and examination
  • Academic progress issues
  • Graduation
• York Online students
• Support and advice
• Health and wellbeing
• Work, volunteering and career planning
• Study Abroad
• Accommodation
• IT and online services
• Finance
• Student life in York
• If things go wrong

AI Problem Solving with Search and Logic - COM00050H

« Back to module search

• Department: Computer Science
• Credit value: 20 credits
• Credit level: H
• Academic year of delivery: 2024-25

Related modules

Module will run

Occurrence	Teaching period
A	Semester 2 2024-25

Module aims

This module will introduce key approaches in Artificial Intelligence for tasks such as: finding a sequence of actions to achieve a goal; playing adversarial games; and solving discrete optimization problems such as configuration and scheduling. Students will learn the theory and practice of AI search, logic, and constraint-based approaches. The module aims to equip students with a wide range of problem-solving tools, how to design effective heuristics for them, and enable comparison of methods to determine which are best suited to a given problem. Some of the tools covered are state-space search algorithms (i.e. A* Search, IDA*, and Greedy Best-First Search), game-tree search algorithms (i.e. Minimax and Monte-Carlo Tree Search), local search methods for solving discrete optimization problems, constraint programming, and the satisfiability (SAT) problem in knowledge representation and reasoning.

Module learning outcomes

1. Represent a given search problem in terms of states, actions, and a goal, and identify a suitable heuristic.

2. Represent a given scenario using propositional logic to enable logical inference (for example, using a SAT solver).

3. Model (represent) and solve discrete optimization problems using a modern constraint programming system.

4. Select and apply an appropriate AI state-space search algorithm for a given problem, identifying reasons for the choice of algorithm in comparison to others.

5. Select and apply an appropriate adversarial (game-tree) search method to solve a given game, including design of a suitable heuristic if required.

6. Describe the algorithms commonly used in SAT (propositional satisfiability) solvers, local search solvers, and constraint solvers, and apply them to small examples.

Indicative assessment

Task	% of module mark
Closed/in-person Exam (Centrally scheduled)	100

Special assessment rules

None

Indicative reassessment

Task	% of module mark
Closed/in-person Exam (Centrally scheduled)	100

Module feedback

Feedback is provided throughout the sessions, and after the assessment as per normal University guidelines.

Indicative reading

PLACEHOLDER