Analysis of Cognitive Models in Constraint Handling Rules

Front Cover
BoD – Books on Demand, Oct 11, 2021 - Computers - 270 pages
0 Reviews
Reviews aren't verified, but Google checks for and removes fake content when it's identified
Computational cognitive modeling explores cognition by building computational models for cognitive processes, mechanisms and representations. Currently, implementations of cognitive models lack a formal foundation. This inhibits analysis. In this thesis, the cognitive architecture Adaptive Control of Thought - Rational (ACT-R) is formalized and embedded into the rule-based programming language Constraint Handling Rules (CHR). The powerful analytical methods of CHR, particularly confluence analysis, are extended by reasoning modulo equivalence relations. The results are applied to the domain of cognitive modeling.

What people are saying - Write a review

We haven't found any reviews in the usual places.


basic notions
constraint handling rules
adaptive control of thought rational
analysis of actr models
embedding actr models into chr
confluence criterion for actr
future work
list of figures
list of publications

Other editions - View all

Common terms and phrases

About the author (2021)

Daniel Gall studied computer science at the University of Ulm where he soon developed an interest in programming paradigms, logic programming and theoretical foundations of computer science. He pursued his PhD at the Institute of Software Engineering and Programming Languages in Ulm, where he focused on the interdisciplinary field of computational cognitive modeling and program analysis of rule-based languages. Currently, he works as a software engineer and team leader of a cloud backend development team.

The editor Thom Frühwirth is a professor of Computer Science at the University of Ulm, Germany. He is the designer of the programming language Constraint Handling Rules (CHR) and author of the book by the same name. He has also co-authored two leading textbooks on constraint programming and reasoning.

The editor Uwe Schöning is a professor of Theoretical Computer Science at the University of Ulm, Germany. He introduced the low and high hierarchies to structural complexity theory to describe the internal structure of the complexity class NP. Later, he invented a much-cited SAT-Algorithm. He has also authored several popular textbooks on Logic in Computer Science.

Bibliographic information