In this study, we introduce and examine the Egalitarian property for some power indices on the class of simple games. This property means that after intersecting a game with a symmetric or anonymous game the difference between the values of two comparable players does not increase. We prove that the Shapley–Shubik index, the absolute Banzhaf index, and the Johnston score satisfy this property. ...

Bound Founded Answer Set Programming (BFASP) is an extension of Answer Set Programming (ASP) that extends stable model semantics to numeric variables. While the theory of BFASP is defined on ground rules in practice BFASP programs are written as complex non-ground expressions. Flattening of BFASP is a technique used to simplify arbitrary expressions of the language to a small and well defined s...

The Multi-Context System Inconsistency Explainer allows for evaluation of semantics and explanation of inconsistencies in systems where heterogeneous knowledge bases are linked via nonmonotonic rules. The implementation is based on the dlvhex tool, which is an extension of answer set programming with external atoms and higher order features.

In this paper, we aim to study how the performance of modern answer set programming (ASP) solvers is influenced by the treewidth of the input program and to investigate the consequences of this relationship. We first perform an experimental evaluation that shows that the solving performance is heavily influenced by the treewidth, given ground input programs that are otherwise uniform, both in s...

The set of competitive allocations in an exchange economy with indivisible goods of Shapley and Scarf (1974) is an important solution concept in the literature. In this paper, we consider a farsighted version of the von Neumann and Morgenstern stable set by using the farsighted approach of Chwe (1994) and by modifying the domination relation defined by Wako (1999) to incorporate farsightedness....

The development of tools for the simulation of virtual landscapes is an important issue for the study of the relationships between landscape, biophysical processes and their actors. We are interested in simulating realistic colocalizations of cultures. We formalize the simulation process as a generic problem of decomposition of a graph by subgraphs (“structures”). This problem is highly combina...

State-of-the-art learning algorithms, such as random forests or neural networks, are often qualified “black-boxes” because of the high number and complexity operations involved in their prediction mechanism. This lack interpretability is a strong limitation for applications involving critical decisions, typically analysis production processes manufacturing industry. In contexts, models have to ...