World of Warcraft (WoW) artists, designers, engineers, producers, quality assurance (QA) testers and other game developers have unionized. The staff of more than 500 workers voted to unionize the Blizzard Entertainment studio with the Communications Workers of America (CWA) creating the World of Warcraft Gamemakers Guild, according to an X post from the union's official account. The Blizzard studio is the latest major game studio to form a union during uncertain times of layoffs and studio closures across the gaming industry. Bethesda Game Studios, the studio behind the Fallout and Elder Scrolls franchises, formed its union with the help of CWA last weekend that includes 241 workers. "What we've accomplished at World of Warcraft is just the beginning," said Eric Lanham, a test analyst and Wow Gamemakers Guild member, in a statement released by the CWA.

The workers at Bethesda Game Studios have joined the Communications Workers of America (CWA), and they say they're the first Microsoft video game studio to form a wall-to-wall union. A total of 241 workers have either signed an authorization card or have indicated that they wanted to join a union through an online portal. The "wall-to-wall" nature of their organization means the CWA will be representing workers across job descriptions and divisions -- and not just one type -- including artists, engineers, programmers and designers. Bethesda is the developer behind Starfield and the Elder Scrolls and Fallout games. Microsoft has already recognized the union, so workers at the studio's Maryland office have officially joined CWA Locals 2108, while those in its Texas office have become members of CWA Locals 6215.

The number of unionized workers for Microsoft's video game subsidiaries keeps growing, and the latest group to join the pool is the largest one yet. Approximately 600 quality assurance workers at Activision have joined the Communications Workers of America (CWA), making them the biggest certified union in the US video game industry. They're also the first Activision workers to organize under the agreement between Microsoft and the CWA. If you'll recall, Microsoft agreed to respect the right of Activision Blizzard workers to unionize as part of its efforts to secure regulatory approval for its 68.7 billion takeover of the video game developer. CWA President Claude Cummings Jr. said Microsoft kept its promise to let workers decide for themselves whether they want a union.

The $18 million settlement with the EEOC would be the second largest sexual harassment settlement the agency has ever negotiated. But to critics of the settlement, including the DFEH, a significant number of Activision Blizzard workers and their ally, media labor union Communications Workers of America (CWA), that sum is insufficient for potentially hundreds or more victims. In a letter addressed to the EEOC on Oct. 6, the CWA called $18 million "woefully inadequate" and said Activision Blizzard employees and the CWA had "grave concerns" over the settlement agreement.

OAKLAND, California – More than 225 Google engineers and other workers have formed a union, the group revealed Monday, capping years of growing activism at one of the world's largest companies and presenting a rare beachhead for labor organizers in staunchly anti-union Silicon Valley. The union's creation is highly unusual for the tech industry, which has long resisted efforts to organize its largely white-collar workforce. It follows increasing demands by employees at Google for policy overhauls on pay, harassment and ethics, and is likely to escalate tensions with top leadership. The new union, called the Alphabet Workers Union after Google's parent company, Alphabet, was organized in secret for the better part of a year and elected its leadership last month. The group is affiliated with the Communications Workers of America, a union that represents workers in telecommunications and media in the United States and Canada.

In commonsense knowledge representation, the Open World Assumption is adopted as a general standard strategy for the design, construction and use of ontologies, e.g. in OWL. This strategy limits the inferencing capabilities of any system using these ontologies because non-asserted statements could be assumed to be alternatively true or false in different interpretations. In this paper, we investigate the application of the Closed World Assumption to enable a better exploitation of the structural knowledge encoded in a SUMO-based ontology. To that end, we explore three different Closed World Assumption formulations for subclass and disjoint relations in order to reduce the ambiguity of the knowledge encoded in first-order logic ontologies. We evaluate these formulations on a practical experimentation using a very large commonsense benchmark automatically obtained from the knowledge encoded in WordNet through its mapping to SUMO. The results show that the competency of the ontology improves more than 47 % when reasoning under the Closed World Assumption. As conclusion, applying the Closed World Assumption automatically to first-order logic ontologies reduces their expressed ambiguity and more commonsense questions can be answered.

ABSTRACT Deductive question-answering systems generally evaluate queries under one of two possible assumptions which we in this paper refer to as the open and closed world assumptions. The open world assumption corresponds to the usual first order approach to query evaluation: Given a data base DB and a query Q, the only answers to Q are those which obtain from proofs of Q given DB as hypotheses. Under the closed world assumption, certain answers are admitted as a result of failure to find a proof. More specifically, if no proof of a positive ground literal exists, then the negation of that literal is assumed true. In this paper, we show that closed world evaluation of an arbitrary query may be reduced to open world evaluation of socalled atomic queries. We then show that the closed world assumption can lead to inconsistencies, but for Horn data bases no such inconsistencies can arise. Finally, we show how for Horn data bases under the closed world assumption purely negative clauses are irrelevant for deductive retrieval and function instead as integrity constraints. INTRODUCTION Deductive question-answering systems generally evaluate queries under one of two possible assumptions which we in this paper refer to as the open and closed world assumptions.

We call A the database or base set of beliefs of the system. Consider, for example, the following sentence about birds: "All In this chapter, we explore three methods. These methods have several potential applications. We define the effects of the CWA in terms of customary logical notation. We call our belief set, A, the proper axioms of a theory. T[A] by adding a set, Aasm, of assumed beliefs. CWA adds'IQ (B), since A does not logically entail U(B). The CWA often is used with database systems. The following example shows that it does not. Let A contain only the clause P(A) V P(B) . THEOREM 6.1 CWA[A] is consistent if and only if, for every positive-- Proof CWA[A] can be inconsistent only if A U A,"m is.

We have introduced the notion of the closed world assumption for deductive question-answering. This says, in effect, "Every positive statement that you don't know to be true may be assumed false". We have then shown how query evaluation under the closed world assumption reduces to the usual first order proof theoretic approach to query evaluation as applied to atomic queries. Finally, we have shown that consistent Horn data bases remain consistent under the closed world assumption and that definite data bases are consistent with the closed world assumption. ACKNOWLEDGMENT This paper was written with the financial support of the National Research Council of Canada under grant A7642. Much of this research was done while the author was visiting at Bolt, Beranek and Newman, Inc., Cambridge, Mass. I wish to thank Craig Bishop for his careful criticism of an earlier draft of this paper.