SearcharxivSearch

arXiv · 1808.10330

Reasoning with graded information: the case of diagnostic rating scales in healthcare

Abstract

In medicine one frequently deals with vague information. As a tool for reasoning in this area, fuzzy logic suggests itself. In this paper we explore the applicability of the basic ideas of fuzzy set theory in the context of medical assessment questionnaires, which are commonly used, for instance, to support the diagnosis of psychological disorders. The items of a questionnaire are answered in a graded form; patients are asked to choose an element on a linear scale. The derived diagnostic hypotheses are graded as well. This leads to the question whether there is a logical formalism that is suitable to capture the score calculation of medical assessment questionnaires and thereby provides a mathematical justification of the way in which the calculation is typically done. We elaborate two alternative approaches to this problem. First, we follow the lines of mathematical fuzzy logic. For the proposed logic, which can deal with the formation of mean values, we present a Hilbert-style deduction system. In addition, we consider a variant of the prototype approach to vagueness. In this case we are led to a framework for which to obtain a logical calculus turns out to be difficult, yet our gain is a model that is conceptually comparably well-justifiable.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas Vetterlein, Anna Zamansky. 2018-08-30. Reasoning with graded information: the case of diagnostic rating scales in healthcare. https://arxiv.org/abs/1808.10330

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO