Shier Ju

Rational evaluation in belief revision

We introduce a new operator, called rational evaluation, in belief change. The operator evaluates new information according to the agent’s core beliefs, and then exports the plausible part of the new information. It belongs to the decision module in belief change. We characterize rational evaluation by axiomatic postulates and propose two functional constructions for it, based on the well-known constructions of kernel sets and remainder sets, respectively. The main results of the paper are two representation theorems with respect to the two functional constructions. We also compare and connect the evaluation operator with some related operators in belief revision, including contraction, set contraction, and prioritized multiple revision.

Agent-oriented probabilistic logic programming

Currently, agent-based computing is an active research area, and great efforts have been made towards the agent-oriented programming both from a theoretical and practical view. However, most of them assume that there is no uncertainty in agents’ mental state and their environment. In other words, under this assumption agent developers are just allowed to specify how his agent acts when the agent is 100% sure about what is true/false. In this paper, this unrealistic assumption is removed and a new agent-oriented probabilistic logic programming language is proposed, which can deal with uncertain information about the world. The programming language is based on a combination of features of probabilistic logic programming and imperative programming.

Semantic games with chance moves revisited: from IF logic to partial logic

We associate the semantic game with chance moves conceived by Blinov with Blamey’s partial logic. We give some equivalent alternatives to the semantic game, some of which are with a third player, borrowing the idea of introducing the pseudo-player called Nature in game theory. We observe that IF propositional logic proposed by Sandu and Pietarinen can be equivalently translated to partial logic, which implies that imperfect information may not be necessary for IF propositional logic. We also indicate that some independent quantifiers can be regarded as dependent quantifiers of indeterminate sequence, using the interjunction connective in partial logic. We conclude our paper by indicating some further research in a more general setting.

A Method for Merging Cultural Logic Systems

This paper presents a merging approach to solve the logical conflicts in cross-cultural communication. We define each agent’s logic system as a tuple of the language and a binary relation over the language, which can well reflect different inference patterns in different cultures. Then based on the distance measure, merging different logic systems of this kind is a two-step process: (i) all the logic systems are expanded to be based on the same language; and (ii) the distance-based method is used to select a logic system, which is the nearest to the expanded logic systems. In this work, we define a kind of the Hamming distance to measure the distance between any two logic systems. Then based on the distance measure, we define our merging operator and we prove that the operator satisfies the properties of agreement, strong unanimity, groundedness and anonymity in social choice theory.

An n-Player Semantic Game for an n +1 -Valued Logic

First we show that the classical two-player semantic game actually corresponds to a three-valued logic. Then we generalize this result and give an n-player semantic game for an n + 1-valued logic with n binary connectives, each associated with a player. We prove that player i has a winning strategy in game

A clash in Dempster-Shafer theory

{G(\varphi, M)}

Argumentative Patterns in Chinese Medical Consultations

if and only if the truth value of