Piccione and Rubinstein argue that a seemingly paradoxical form of time inconsistency can arise in games of imperfect recall. Their argument depends on calculating the expected value of a game from the standpoint of a player in the middle of play. We claim that this concept is not well deened in games with ab-sentmindedness (where two nodes on a path can be in the same information set) without ...

This article shows an extended work of [Kleinberg and Oren 2014]. It gives more properties of the graph time-inconsistency model raised in [Kleinberg and Oren 2014] by solving three open problems proposed in [Kleinberg and Oren 2014]. Generally speaking, it gives a tight upper bound for the ratio of actual cost due to time-inconsistency to minimum theoretic cost, and shows the hardness of motiv...

This article shows an extended work of [Kleinberg and Oren 2014]. It gives more properties of the graph time-inconsistency model raised in [Kleinberg and Oren 2014] by solving three open problems proposed in [Kleinberg and Oren 2014]. Generally speaking, it gives a tight upper bound for the ratio of actual cost due to time-inconsistency to minimum theoretic cost, and shows the hardness of motiv...

There are relatively few proposals for inconsistency measures for propositional belief bases. However inconsistency measures are potentially as important as information measures for artificial intelligence, and more generally for computer science. In particular, they can be useful to define various operators for belief revision, belief merging, and negotiation. The measures that have been propo...

In this paper, we present an approach for measuring inconsistency in a knowledge base. We first define the degree of inconsistency using a four-valued semantics for the description logicALC. Then an ordering over knowledge bases is given by considering their inconsistency degrees. Our measure of inconsistency can provide important information for inconsistency handling.

Distributed applications and web services, such as online stores or social networks, are expected to be scalable, available, responsive, and fault-tolerant. To meet these steep requirements in the face of high round-trip latencies, network partitions, server failures, and load spikes, applications use eventually consistent datastores that allow them to weaken the consistency of some data. Howev...

For interactive theorem provers a very desirable property is consistency : it should not be possible to prove false theorems. However, this is not enough: it also should not be possible to think that a theorem that actually is false has been proved. More precisely: the user should be able to know what it is that the interactive theorem prover is proving. To make these issues concrete we introdu...

Human-to-human interaction across distributed applications requires that sufficient consistency be maintained among participants in the face of network characteristics such as latency and limited bandwidth. The level of inconsistency arising from the network is proportional to the network delay, and thus a function of bandwidth consumption. Distributed simulation has often used a bandwidth redu...

Two descriptions are inconsistent if there is no way to satisfy them altogether. Inconsistencies may arise under many circumstances in the software lifecycle. They are often inevitable, for instance, when the descriptions are produced or evolve independently from each other. Sometimes they may even be desirable, for instance, to allow further elicitation of requirements descriptions being acqui...