Complexity minimization in rule-based category learning: revising the catalog of Boolean concepts and evidence for non-minimal rules

DOI10.1016/j.jmp.2006.12.001zbMath1184.91184OpenAlexW2060197573MaRDI QIDQ882294

Daniel Lafond, Yves Lacouture, Guy Mineau

Publication date: 23 May 2007

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmp.2006.12.001

zbMATH Keywords

classificationcomplexityBoolean algebraconcept formationminimizationdecision treeconcept learninglogiccategorizationrule

Mathematics Subject Classification ID

Memory and learning in psychology (91E40) Structure theory of Boolean algebras (06E05) Physiological, cellular and medical topics (92C99)

Related Items

SAT-Based Formula Simplification ⋮ Modal similarity ⋮ Complexity measures and concept learning ⋮ An order-dependent transfer model in categorization

Cites Work

• Unnamed Item
• A note on the complexity of Boolean concepts
• A catalog of Boolean concepts.
• An extension of the exemplar-based random-walk model to separable-dimension stimuli.
• Factoring Boolean functions using graph partitioning
• An algebra of human concept learning
• Analyzing the RULEX model of category learning
• A Way to Simplify Truth Functions
• Factoring logic functions