We investigate the relationship between the generalization of program completion defined in 1984 by Lloyd and Topor and the generalization of the stable model semantics introduced recently by Ferraris et al.

We present a new answer set solver nomore++. Distinguishing features include its treatment of heads and bodies equitably as computational objects and a new hybrid lookahead. nomore++ is close to being competitive with stateof-the-art answer set solvers, as demonstrated by selected experimental results.

The aim of this paper is to obtain the uncertain value set in the complex plane for systems with real and complex parameters that are known to lie inside a ball in a weighted l-norm. It generalizes previously available results and may be used to test the robust stability of polynomials whose coefficients lie in a weighted l ball.

In this editorial, we provide a brief introduction and summarize the 10 research articles included in this Special Issue on Applications of stable isotope analysis in mammalian ecology. The first three articles report correction and discrimination factors that can be used to more accurately estimate the diets of extinct and extant mammals using stable isotope analysis. The remaining seven appli...

We introduce cooperative TU-games on concept lattices, where a concept is a pair (S, S′) with S being a subset of players or objects, and S′ a subset of attributes. Any such game induces a game on the set of players/objects, which appears to be a TU-game whose collection of feasible coalitions is a lattice closed under intersection, and a game on the set of attributes. We propose a Shapley valu...

We propose to define new conciliation operators. Those operators are based on an iterative selection/weakening process of the beliefs/goals of the agents, until a consensus (agreement) is found between the agents. To define a particular operator, it just need to choose a choice function and a weakening function. In previous works the choice function was defined arbitrarily. We propose to take a...

This paper investigates the satisfaction of the Non-Contradiction Law (NC) within the domain of aggregation operators. It provides characterizations both for those aggregation operators that satisfy NC with respect to (w.r.t.) some given strong negation, as well as for those satisfying the law w.r.t. any strong negation. The results obtained are applied to some of the most important known class...

[This corrects the article on p. 537 in vol. 8, PMID: 28443069.].

This paper discusses weighted voting games and two methods of manipulating those games, called annexation and merging. These manipulations allow either an agent, called an annexer to take over the voting weights of some other agents in the game, or the coming together of some agents to form a bloc of manipulators to have more power over the outcomes of the games. We evaluate the extent of susce...