Premium
Problem‐Solving Restructuration: Elimination of Implicit Constraints
Author(s) -
Richard JeanFrançois,
Poitrenaud Sébastien,
Tijus Charles
Publication year - 1993
Publication title -
cognitive science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.498
H-Index - 114
eISSN - 1551-6709
pISSN - 0364-0213
DOI - 10.1207/s15516709cog1704_2
Subject(s) - constraint (computer aided design) , computer science , set (abstract data type) , action (physics) , mathematical optimization , state space , mathematics , physics , geometry , quantum mechanics , programming language , statistics
A general model of problem‐solving processes based on misconception elimination is presented to simulate both impasses and solving processes. The model operates on goal‐related rules and a set of constraint rules in the form of “if (state or goal), do not (Action)” for the explicit constraints in the instructions and the implicit constraints that come from misconceptions of legal moves. When impasses occur, a constraint elimination mechanism is applied. Because successive eliminations of implicit constraints enlarge the problem space and have an effect on planning, the model integrates “plan‐based” and “constraint‐based” approaches to problem‐solving behavior. Simulating individual protocols of Tower of Hanoi situations shows that the model, which has a proper set of constraints, predicts a single move with no alternative on about 61% of the movements and that protocols are quite successfully simulated movement by movement. Finally, it is shown that many features of previous models are embedded in the constraint elimination model.