Changes: Paul Thagard

Back to page

Paul Thagard is Professor of Philosophy, with cross appointment to Psychology and Computer Science, and Director of the Cognitive Science Program, at the University of Waterloo. He is a graduate of the Universities of Saskatchewan, Cambridge, Toronto (Ph.D. in philosophy, 1977) and Michigan (M.S. in computer science, 1985). He is the author of:

And co-author of:

• Mental Leaps: Analogy in Creative Thought (MIT Press, 1995, ISBN 0-262-08233-0)
• Induction: Processes of Inference, Learning, and Discovery (MIT Press, 1986, Bardford Book, 1989, ISBN 0-262-58096-9)

He is also editor of:

• Philosophy of Psychology and Cognitive Science (North-Holland, 2006, ISBN 0-444-51540-2).

He was Chair of the Governing Board of the Cognitive Science Society [1], 1998-1999, and President of the Society for Machines and Mentality [2], 1997-1998. He has held a Canada Council Killam fellowship, and in 1999 was elected a fellow of the Royal Society of Canada. In 2003, he received a University of Waterloo Award for Excellence in Research, and in 2005 he was named a University Research Chair.

Coherence Edit

Paul Thagard has proposed that many cognitive functions, including perception, analogy, explanation, decision-making, planning etc., can be understood as a form of (maximum) coherence computation.

Thagard (together with Karsten Verbeurgt) put forth a particular formalization of the concept of coherence as a constraint satisfaction problem. The model posits that coherence operates over a set of representational elements (e.g., propositions, images, etc.) which can either fit together (cohere) or resist fitting together (incohere).

If two elements p and q cohere they are connected by a positive constraint $(p,q) \in C^+$, and if two elements $p$ and $q$ incohere they are connected by a negative constraint $(p,q) \in C^-$. Furthermore, constraints are weighted, i.e., for each constraint $(p,q) \in C^+ \cup C^-$ there is a positive weight $w(p,q)$.

According to Thagard, coherence maximization involves the partitioning of elements into accepted ($A$) and rejected ($R$) elements in such a way that maximum number (or maximum weight) of constraints is satisfied. Here a positive constraint $(p, q)$ is said to be satisfied if either both $p$ and $q$ are accepted ($p, q \in A$) or both $p$ and $q$ are rejected ($p, q \in R$). A negative constraint $(p,q)$ is satisfied if one element is accepted(say $p \in A$), and the other rejected ($q \in R$).

ReferencesEdit

• Thagard, P. and Verbeurgt, K. (1998). Coherence as constraint satisfaction. Cognitive Science, 22: 1-24.
• Thagard, P. (2000). Coherence in Thought and Action. MIT Press.
• Thaghard, P (1978). The best explanation. Criteria for theory choice. Journal of philosophy, 75, 76-92
• Thaghard, P (1992). Conceptual revolutions. NJ. Princeton University Press.

Many of Thagard's coherence articles are available online at http://cogsci.uwaterloo.ca/Articles/Pages/Coherence.html

 This page uses Creative Commons Licensed content from Wikipedia (view authors).