9 papers
Distilling Models of Bounded-Rational Choice: A Constraint Programming Approach
Ãzgür Akgün, Georgios Gerasimou
We provide an analytical framework that allows for distilling the full explanatory and welfare-relevant content of influential yet computationally hard models of bounded-rational g…
Faster Symmetry Breaking Constraints for Abstract Structures
Ãzgür Akgün, Mun See Chang, Ian P. Gent +1
In constraint programming and related paradigms, a modeller specifies their problem in a modelling language for a solver to search and return its solution(s). Using high-level mode…
Solver-Aided Expansion of Loops to Avoid Generate-and-Test
Niklas Dewally, Ãzgür Akgün
Constraint modelling languages like MiniZinc and Essence rely on unrolling loops (in the form of quantified expressions and comprehensions) during compilation. Standard approaches…
Toward Cyclic A.I. Modelling of Self-Regulated Learning: A Case Study with E-Learning Trace Data
Andrew Schwabe, Ãzgür Akgün, Ella Haig
Many e-learning platforms assert their ability or potential to improve students' self-regulated learning (SRL), however the cyclical and undirected nature of SRL theoretical models…
TabID: Automatic Identification and Tabulation of Subproblems in Constraint Models
Ãzgür Akgün, Ian P. Gent, Christopher Jefferson +5
The performance of a constraint model can often be improved by converting a subproblem into a single table constraint (referred to as tabulation). Finding subproblems to tabulate i…
Breaking the Symmetries of Indistinguishable Objects
Ozgur Akgun, Mun See Chang, Ian P. Gent +1
Indistinguishable objects often occur when modelling problems in constraint programming, as well as in other related paradigms. They occur when objects can be viewed as being drawn…