Taming Strategy Logic: Non-Recurrent Fragments

Strategy Logic (SL for short) is one of the prominent languages for reasoning about the strategic abilities of agents in a multi-agent setting. This logic extends LTL with first-order quantifiers over the agent strategies and encompasses other formalisms, such as ATL* and CTL*. The model-checking problem for SL and several of its fragments have been extensively studied. On the other hand, the picture is much less clear on the satisfiability front, where the problem is undecidable for the full logic. In this work, we study two fragments of One-Goal SL, where the nesting of sentences within temporal operators is constrained. We show that the satisfiability problem for these logics, and for the corresponding fragments of ATL* and CTL*, is ExpSpace and PSpace-complete, respectively

Solving Mean-Payoff Games via Quasi Dominions

We propose a novel algorithm for the solution of mean-payoff games that merges together two seemingly unrelated concepts introduced in the context of parity games, small progress measures and quasi dominions. We show that the integration of the two notions can be highly beneficial and significantly speeds up convergence to the problem solution. Experiments show that the resulting algorithm performs orders of magnitude better than the asymptotically-best solution algorithm currently known, without sacrificing on the worst-case complexity

Alternating (In)Dependence-Friendly Logic

Hintikka and Sandu originally proposed Independence Friendly Logic ([Formula presented]) as a first-order logic of imperfect information to describe game-theoretic phenomena underlying the semantics of natural language. The logic allows for expressing independence constraints among quantified variables, in a similar vein to Henkin quantifiers, and has a nice game-theoretic semantics in terms of imperfect information games. However, the [Formula presented] semantics exhibits some limitations, at least from a purely logical perspective. It treats the players asymmetrically, considering only one of the two players as having imperfect information when evaluating truth, resp., falsity, of a sentence. In addition, truth and falsity of sentences coincide with the existence of a uniform winning strategy for one of the two players in the semantic imperfect information game. As a consequence, [Formula presented] does admit undetermined sentences, which are neither true nor false, thus failing the law of excluded middle. These idiosyncrasies limit its expressive power to the existential fragment of Second Order Logic ([Formula presented]). In this paper, we investigate an extension of [Formula presented], called Alternating Dependence/Independence Friendly Logic ([Formula presented]), tailored to overcome these limitations. To this end, we introduce a novel compositional semantics, generalising the one based on trumps proposed by Hodges for [Formula presented]. The new semantics (i) allows for meaningfully restricting both players at the same time, (ii) enjoys the property of game-theoretic determinacy, (iii) recovers the law of excluded middle for sentences, and (iv) grants [Formula presented] the full descriptive power of [Formula presented]. We also provide an equivalent Herbrand-Skolem semantics and a game-theoretic semantics for the prenex fragment of [Formula presented], the latter being defined in terms of a determined infinite-duration game that precisely captures the other two semantics on finite structures

Oink: an Implementation and Evaluation of Modern Parity Game Solvers

Parity games have important practical applications in formal verification and synthesis, especially to solve the model-checking problem of the modal mu-calculus. They are also interesting from the theory perspective, as they are widely believed to admit a polynomial solution, but so far no such algorithm is known. In recent years, a number of new algorithms and improvements to existing algorithms have been proposed. We implement a new and easy to extend tool Oink, which is a high-performance implementation of modern parity game algorithms. We further present a comprehensive empirical evaluation of modern parity game algorithms and solvers, both on real world benchmarks and randomly generated games. Our experiments show that our new tool Oink outperforms the current state-of-the-art.Comment: Accepted at TACAS 201

Hierarchical Patterns of Global Human Y-Chromosome Diversity

We examined 43 biallelic polymorphisms on the nonrecombining portion of the Y chromosome (NRY) in 50 human populations encompassing a total of 2,858 males to study the geographic structure of Y-chromosome variation. Patterns of NRY diversity varied according to geographic region and method/level of comparison. For example, populations from Central Asia had the highest levels of heterozygosity, while African populations exhibited a higher level of mean pairwise differences among haplotypes. At the global level, 36% of the total variance of NRY haplotypes was attributable to differences among populations (i.e., Phi(ST) = 0.36). When a series of AMOVA analyses was performed on different groupings of the 50 populations, high levels of among-groups variance (Phi(CT)) were found between Africans, Native Americans, and a single group containing all 36 remaining populations. The same three population groupings formed distinct clusters in multidimensional scaling plots. A nested cladistic analysis (NCA) demonstrated that both population structure processes (recurrent gene flow restricted by isolation by distance and long-distance dispersals) and population history events (contiguous range expansions and long-distance colonizations) were instrumental in explaining this tripartite division of global NRY diversity. As in our previous analyses of smaller NRY data sets, the NCA detected a global contiguous range expansion out of Africa at the level of the total cladogram. Our new results support a general scenario in which, after an early out-of-Africa range expansion, global-scale patterns of NRY variation were mainly influenced by migrations out of Asia. Two other notable findings of the NCA were (1) Europe as a "receiver" of intercontinental signals primarily from Asia, and (2) the large number of intracontinental signals within Africa. Our AMOVA analyses also supported the hypothesis that patrilocality effects are evident at local and regional scales, rather than at intercontinental and global levels. Finally, our results underscore the importance of subdivision of the human paternal gene pool and imply that caution should be exercised when using models and experimental strategies based on the assumption of panmixia

Is Context-aware Reasoning = Case-based Reasoning?

The purpose of this paper is to explore the similarities and differences and then argue for the potential synergies between two methodologies, namely Context-aware Reasoning and Case-based Reasoning, that are amongst the tools which can be used for intelligent environment (IE) system development. Through a case study supported by a review of the literature, we argue that context awareness and case based reasoning are not equal and are complementary methodologies to solve a domain specific problem, rather, the IE development paradigm must build a cooperation between these two approaches to overcome the individual drawbacks and to maximise the success of the IE systems

Formal specification of multi-agent systems by using EUSMs

The behavior of e-commerce agents can be defined at different levels of abstraction. A formalism allowing to define them in terms of their economic activities, Utility State Machines, has been proposed. Due to its high level of abstraction, this formalism focuses on describing the economic goals rather on how they are achieved. Though this approach is suitable to specify the objectives of e-commerce agents, as well as to construct formal analysis methodologies, this framework is not suitable to define the strategic behavior of agents. In this paper we develop a new formalism to explicitly define the strategic behavior of agents in a modular way. In particular, we reinterpret the role of utility functions, already used in USMs in a more restrictive manner, so that they define strategic preferences and activities of agents. We apply the formalism to define the agents in a benchmark e-commerce agent environment, the Supply Chain Management Game. Since the strategic behavior of agents is located in a specific part of the formalism, different strategies can be easily considered, which enhances the reusability of the proposed specification

a direct encoding for nnc polyhedra

We present an alternative Double Description representation for the domain of NNC (not necessarily closed) polyhedra, together with the corresponding Chernikova-like conversion procedure. The representation uses no slack variable at all and provides a solution to a few technical issues caused by the encoding of an NNC polyhedron as a closed polyhedron in a higher dimension space. A preliminary experimental evaluation shows that the new conversion algorithm is able to achieve significant efficiency improvements