Declarative Programming D
Aalto University
<p>The course covers selected mainstream approaches to declarative programming with constraint solvers, such as Boolean satisfiability (SAT), constraint satisfaction problems (CSP) and satisfiability modulo theories (SMT), as well as some of their most important applications in computer-aided verification and validation of software and hardware systems.</p><p>In addition to some of the algorithmic technologies for constraint programming, the course acts as an introduction to declarative and model-based solution of hard computational problems. Application problems are solved by first representing the problem declaratively (as opposed to procedurally) in a high-level modeling language, and then finding one or more solutions by using a general-purpose solver for the high-level modeling language. The declarative models have a semantics separate from the solver algorithms, and the models can be used for multiple purposes and with different types of solver technologies. For example, the same model could be used for control and decision-making, diagnosis, and monitoring.</p><p>Specific contents are given on the MyCourses page of the course instance.</p><p> </p>
Back
|
Course dates
03 September 2025 - 08 December 2025
|
Course organizer
Tommi Junttila, Jussi Rintanen
|
Place/Venue
School of Science / Department of Computer Science
|
City
|
Country
Finland
|
Workload
5
|
Link
https://mycourses.aalto.fi/course/search.php?...
|
|
