Logic programming has generally been developed in a Classical two-valued setting; there are no “degrees of truth”. What we propose here is the introduction of more general spaces of truth values, reading truth values as “evidence factors”. Then conventional logic programming may be seen as the special case in which only total evidence is acceptable, and so the space of evidences degenerates to ...

We develop a tool akin to the revelation principle for dynamic mechanism‐selection games in which designer can only commit short‐term mechanisms. identify canonical class of mechanisms rich enough replicate outcomes any equilibrium game between an uninformed and privately informed agent. A cornerstone our methodology is idea that mechanism should encode not rules determine allocation, but also ...

The present paper focuses on the Mandarin Intransitive keflexive Verbs. These verbs, such as zi-sha 'to commit suicide', and zi fen 'to burn oneself, are formed with a reflexive morpheme zi-'self' and a root verb. Take the verb zi-sha 'to commit suicide' for example, the reflexive morpheme contributes the reflexive meaning and the root verb sha 'to kill' contributes the meaning`to kill'; hence,...

One single code change can significantly influence a wide range of software systems and their users. For example, 1) adding a new feature can spread defects in several modules, while 2) changing an API method can improve the performance of all client programs. Developers often may not clearly know whether their or others’ changes are influential at commit time. Rather, it turns out to be influe...

Extensive research has been carried out in search for an ef cient atomic commit protocol and many optimizations have been sug gested to improve the basic two phase commit protocol either for the normal or failure case Of these optimizations the read only optimiza tion is the best known and most widely used whereas the attening of the commit tree optimization is the most recent one proposed for ...

Atomic Commit Problem (ACP) is a single-shot agreement problem similar to consensus, meant model the properties of transaction commit protocols in fault-prone distributed systems. We argue that ACP too restrictive capture complexities modern transactional data stores, where are integrated with concurrency control, and their executions for different transactions interdependent. As an alternative...