this paper aims at investigating evidentiality in contemporary persian from a typological point of view. first the category of evidentiality and its types in the languages of the world is introduced. gathering and analysing data of spoken and written form of this language as well as classic texts,  an attempt was made to see whether evidentiality exists in this language as a grammatical categor...

Moving beyond the dualistic view in AI where agent and environment are separated incurs new challenges for decision making, as calculation of expected utility is no longer straightforward. The non-dualistic decision theory literature is split between causal decision theory and evidential decision theory. We extend these decision algorithms to the sequential setting where the agent alternates be...

So far, most of the evidential distance and similarity measures proposed in the DempsterShafer theory literature have been based on the basic belief assignment function, so as the belief and plausibility functions as two main results of the theory are not directly used in this regard. In this paper, a new evidential distance measure is proposed based on these functions according to nearest neig...

Evidential atheism, as espoused by various philosophical atheists, recommends belief that God does not exist on the basis of not just the evidence of which we are aware, but also our overall available evidence. This article identifies a widely neglected problem from potential surprise evidence that undermines an attempt to give a cogent justification of such evidential atheism. In addition, it ...

This paper presents the evidential paradigm of computer-supported mathematical assistance in “doing” mathematics and in reasoning activity. At present, the evidential paradigm is implemented in the form of System for Automated Deduction (SAD). The system is based on the methods of automated theorem proving and is intended for intelligent mathematical text processing. It proves mathematical theo...

One of the difficulties that arises when using the K-nearest neighbor rule is that each of the labeled training samples is given equal importance in deciding the class of the query pattern to be classified, regardless of their typicality. In this paper, the theory of belief functions is introduced into the K-nearest neighbor rule to develop an evidential editing version of this algorithm. An ev...