Thom Frühwirth - Topics for practial work, Bachelor's theses, Master's theses, and dissertations

Current topics are listed here.

Below is a list of possible topics for practial work, Bachelor's theses, Master's theses, and dissertations in the field of constraint programming/constraint handling rules. A common starting point for the proposals below is the CHR Homepage.

Probabilistic/Randomized Constraint Handling Rules (CHR)
Soft Constraints (semiring constraints)
Linear Logic CHR (alternate semantics, for logical algorithms)
Distribution and Concurrency/Parallelism

Logical Algorithms (implementation, analysis, e.g. union-find, sorting)
Lexicographic Order Constraints
Global Constraints (scheduling, alldifferent...)

Automatic Ask/Entailment/Implication for Constraints
Reified/Meta-Constraints
Automatic Variable-Projection/Elimination for Constraints
Dynamic/rectractable/deletion Constraints (needs justifications)
Automatic Generation of Labeling Strategies
Automatic Generation of Rules for Constraint Solvers
Implementation, Adaptation and Combination of Constraint Solvers (concurrency, coordination)

Automatic Complexity Analysis (termination-based, also for refined semantics, indexing)
Source-to-source Transformation (to implement language extensions and analysis)
Inverse/Backwards Computation (for program analysis, cf. compositional semantics)
Program Transformation/Specialisation/Partial Evaluation (to optimize and analyse programs)

Constraint-Based Program Analysis in CHR
A Logical reconstruction of Indexicals in CHR

Compiler Optimizations, e.g. using RETE/TREAT algorithm, indexing...
Tools for Debugging, Tracing, for Termination and Confluence Analysis
Multiple Constraint Stores
Abduction and Negation for/in CHR