When more than one worker can access data simultaneously, they usually break data consistency. To enforce data consistency, a huge performance penalty must be paid. This divides system architecture into two directions. One direction considers data consistency less important than “greater goods”, such as availability or partition tolerance, and so sacrifices it. Dropping data consistency enforce...

Article history: Received 4 April 2013 Available online 27 November 2013 JEL classification: C70 D82

1 Abstract The most general notion of canonical model for a logic program with negation is the one of stable model 9]. In 7] the stable models of a logic program are characterized by the well-supported Herbrand models of the program, and a new xed point semantics that formalizes the bottom-up truth maintenance procedure of 4] is based on that characterization. Here we focus our attention on the...

Moulin (1999) characterizes the fixed-path rationing methods by efficiency, strategyproofness, consistency, and resource-monotonicity. In this note, we give a straightforward proof of his result.

5 Consistency Guarantees 5 5.1 Transactions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 5.2 Linearizability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 5.3 Sequential Consistency . . . . . . . . . . . . . . . . . . . . . . . . 6 5.4 Causal Consistency . . . . . . . . . . . . . . . . . . . . . . . . . . 6 5.5 release consistency . . . . . . . . . . . . . . . . . ....

Previous mining algorithms on high dimensional datasets, such as biological dataset, create very large patterns sets as a result which includes small and discontinuous sequential patterns. These patterns do not bear any useful information for usage. Mining sequential patterns in such sequences need to consider different forms of patterns, such as contiguous patterns, local patterns which appear...

Frege’s theory is inconsistent (Russell’s paradox). However, the predicative version of Frege’s system is consistent. This was proved by Richard Heck in 1996 using a model theoretic argument. In this paper, we give a finitistic proof of this consistency result. As a consequence, Heck’s predicative theory is rather weak (as was suspected). We also prove the finitistic consistency of the extensio...

We consider incomplete specifications of XML documents in the presence of schema information and integrity constraints. We show that integrity constraints such as keys and foreign keys affect consistency of such specifications. We prove that the consistency problem for incomplete specifications with keys and foreign keys can always be solved in NP. We then show a dichotomy result, classifying t...

In this paper, we study the union axiom of ZFC. After a brief introduction, we sketch a proof of the folklore result that union is independent of the other axioms of ZFC. In the third section, we prove some results in the theory T:= ZFC minus union. Finally, we show that the consistency of T plus the existence of an inaccessible cardinal proves the consistency of ZFC.