A formal framework for characterizing querying algorithms.

DOI10.1016/j.jmp.2003.10.003zbMath1076.91035OpenAlexW1983002279MaRDI QIDQ1431811

Jürgen Heller

Publication date: 11 June 2004

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

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

zbMATH Keywords

Extensions of a closureKnowledge space theoryQuestioning of experts

Mathematics Subject Classification ID

Memory and learning in psychology (91E40)

Related Items (4)

Well-graded polytomous knowledge structures ⋮ Knowledge structures delineated by fuzzy skill maps ⋮ A characterization of the concept of independence in knowledge structures ⋮ Assessment structures in psychological testing

Cites Work

• A practical procedure to build a knowledge structure.
• A note on the correspondence among entail relations, rough set dependencies, and logical consequence
• A simulation study concerning the effect of errors on the establishment of knowledge spaces by querying experts
• How to build a knowledge space by querying an expert
• Extracting human expertise for constructing knowledge spaces: An algorithm
• Applying the basis of a knowledge space for controlling the questioning of an expert
• On query procedures to build knowledge structures
• Spaces for the assessment of knowledge
• Rough sets
• Knowledge Spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A formal framework for characterizing querying algorithms.