Constraint Programming by Inversion of Functional Programs
- Date
- Dec 19, 2012
- Time
- 12:00 PM - 1:00 PM
- Speaker
- Alexander Bau
- Language
- en
- Main Topic
- Informatik
- Other Topics
- Informatik
- Description
- Constraint Programming is a declarative programming paradigm of specifying a constraint system in predicate logic over a certain domain. A well researched domain are existential quantified Boolean formulas (SAT). A problem-independent SAT solver is used to find a satisfying assignment of all quantified variables, so that the formula evaluates to the truth value True. One drawback is the manual encoding of the constraint system as Boolean formula. By regarding the constraint system as characteristic function over assignments, this work presents an automatically transformation of a constraint system written in a subset of Haskell into the set of Boolean formulas. This allows to write sophisticated though readable constraint systems using an established, general purpose, functional programming language. The resulting constraint compiler is applied to problems of termination analysis.
Last modified: Dec 19, 2012, 8:49:59 AM
Location
TUD Andreas-Pfitzmann-Bau (Computer Science) (INF 3027)Nöthnitzer Straße4601069Dresden
- Homepage
- https://navigator.tu-dresden.de/etplan/apb/00
Organizer
TUD InformatikNöthnitzer Straße4601069Dresden
- Phone
- +49 (0) 351 463-38465
- Fax
- +49 (0) 351 463-38221
- Homepage
- http://www.inf.tu-dresden.de
Scan this code with your smartphone and get directly this event in your calendar. Increase the image size by clicking on the QR-Code if you have problems to scan it.
Legend
- Biology
- Chemistry
- Civil Eng., Architecture
- Computer Science
- Economics
- Electrical and Computer Eng.
- Environmental Sciences
- for Pupils
- Law
- Linguistics, Literature and Culture
- Materials
- Mathematics
- Mechanical Engineering
- Medicine
- Physics
- Psychology
- Society, Philosophy, Education
- Spin-off/Transfer
- Traffic
- Training
- Welcome