The goal of this paper is threefold. First, we trace the history of the development of answer set solvers, by accounting for more than a dozen of them. Second, we discuss development tools and environments that facilitate the use of answer set programming technology in practical applications. Last, we present the evolution of the answer set programming competitions, prime venues for tracking ad...

106 AI MAGAZINE RTS games — such as StarCraft by Blizzard Entertainment and Command and Conquer by Electronic Arts — are popular video games that can be described as real-time war simulations in which players delegate units under their command to gather resources, build structures, combat and support units, scout opponent locations, and attack. The winner of an RTS game usually is the player or...

We present an extensive statistical analysis of the results of all sports competitions in five major sports leagues in England and the United States. We characterize the parity among teams by the variance in the winning fraction from season-end standings data and quantify the predictability of games by the frequency of upsets from game results data. We introduce a novel mathematical model in wh...

The present study aims to improve medical systems by designing objective safety assessment criteria for rugby competitions. We evaluated 195 competitions between 2002 and 2011 using an original safety scale comprising the following sections: 1) competence of staff such as referees, medical attendants and match day doctor; 2) environment such as weather, wet bulb globe temperature and field cond...

The properties of solutions for a parabolic system with homogeneous Dirichlet boundary conditions, which arises in a cooperating three-species food chain model, are investigated. ‘It is shown that global solutions exist if the intraspecific competitions are strong whereas blowup solutions exist under certain conditions if the intra-specific competitions are weak. @ 2004 Elsevier Ltd. All rights...

is satisfiable is one of the most fundamental problems in computer science, known as the canonical NP-complete Boolean satisfiability (SAT) problem (Biere et al. 2009). In addition to its theoretical importance, major advances in the development of robust implementations of decision procedures for SAT, SAT solvers, have established SAT as an important declarative approach for attacking various ...