Journalartikel

Jahr der Veröffentlichung: 2004

Seiten: 1-8

Zeitschrift: Journal of Mathematical Psychology

Bandnummer: 48

Heftnummer: 1

ISSN: 0022-2496

DOI Link: https://doi.org/10.1016/j.jmp.2003.10.003

Verlag: Elsevier

Abstract: 
Algorithmic procedures have been devised for constructing a knowledge space by querying experts. The queries submitted to the expert consist of assertions that are to be accepted or rejected. The present paper provides a characterization of the algorithms that may be used to draw inferences from previously collected answers. It is based on the notion of a closure on the set of all assertions, and its extension to a set containing for each assertion a positive and a negative instance, representing acceptance and rejection, respectively. The developed characterization emphasizes the significance of the well-known QUERY and PS-QUERY procedures. Potential applications of the presented results in contexts other than knowledge space theory are pointed out. (C) 2003 Elsevier Inc. All rights reserved.

Harvard-Zitierstil: Heller, J. (2004) A formal framework for characterizing querying algorithms, Journal of Mathematical Psychology, 48(1), pp. 1-8. https://doi.org/10.1016/j.jmp.2003.10.003

APA-Zitierstil: Heller, J. (2004). A formal framework for characterizing querying algorithms. Journal of Mathematical Psychology. 48(1), 1-8. https://doi.org/10.1016/j.jmp.2003.10.003