Answer set programming (ASP) has demonstrated its potential as an effective tool for concisely representing and reasoning about real-world problems. In this paper, we present an application in which ASP has been successfully used in the context of dynamic traffic distribution for urban networks, within a more general framework devised for solving such a real-world problem. In particular, ASP has been employed for the computation of the “optimal” routes for all the vehicles in the network. We also provide an empirical analysis of the performance of the whole framework, and of its part in which ASP is employed, on two European urban areas, which shows the viability of the framework and the contribution ASP can give.

Given a combinatorial search problem, it may be highly useful to enumerate its (all) solutions besides just finding one solution, or showing that none exists. The same can be stated about optimal solutions if an objective function is provided. This work goes beyond the bare enumeration of optimal solutions and addresses the computational task of solution enumeration by optimality (SEO). This task is studied in the context of answer set programming (ASP) where (optimal) solutions of a problem are captured with the answer sets of a logic program encoding the problem. Existing answer set solvers already support the enumeration of all (optimal) answer sets. However, in this work, we generalize the enumeration of optimal answer sets beyond strictly optimal ones, giving rise to the idea of answer set enumeration in the order of optimality (ASEO). This approach is applicable up to the best k answer sets or in an unlimited setting, which amounts to a process of sorting answer sets based on the objective function. As the main contribution of this work, we present the first general algorithms for the aforementioned tasks of answer set enumeration. Moreover, we illustrate the potential use cases of ASEO. First, we study how efficiently access to the next-best solutions can be achieved in a number of optimization problems that have been formalized and solved in ASP. Second, we show that ASEO provides us with an effective sampling technique for Bayesian networks.

The localization problem in mobile robotics can be defined as the search of the robot's coordinates in a known environment. If there is no information about the initial location, we are talking about global localization. In this work, we have developed an algorithm that solves this problem in a three-dimensional (3D) environment using evolutionary computation concepts. The method has been called RELF-3D and has many features that make it very robust and reliable: thresholding and discarding mechanisms, different cost functions, effective convergence criteria, and so on. The resulting global localization module has been tested in numerous experiments and the most important improvement obtained is the accuracy of the method, allowing its application in manipulation tasks.

Abduction, first proposed in the setting of classical logics, has been studied with growing interest in the logic programming area during the last years. In this paper we study abduction with penalization in the logic programming framework. This form of abductive reasoning, which has not been previously analyzed in logic programming, turns out to represent several relevant problems, including optimization problems, very naturally. We define a formal model for abduction with penalization over logic programs, which extends the abductive framework proposed by Kakas and Mancarella. We address knowledge representation issues, encoding a number of problems in our abductive framework. In particular, we consider some relevant problems, taken from different domains, ranging from optimization theory to diagnosis and planning; their encodings turn out to be simple and elegant in our formalism. We thoroughly analyze the computational complexity of the main problems arising in the context of abduction with penalization from logic programs. Finally, we implement a system supporting the proposed abductive framework on top of the DLV engine. To this end, we design a translation from abduction problems with penalties into logic programs with weak constraints. We prove that this approach is sound and complete.

We study the question of nonexistence of extremal functions for perturbations of some sharp inequalities such as those of Moser-Trudinger (1971) and Chang- Marshall (1985). We shall show that for each critically sharp (in a sense that will be precisely defined) inequality of the form

where is a collection of measurable functions on a finite measure space (I, μ) and O a nonnegative continuous function on [0, ∞), we have a continuous Ψ on [0, ∞) with 0 ≤ Ψ ≤ Φ, but with

not being attained even if the supremum in (1) is attained. We then apply our results to the Moser-Trudinger and Chang-Marshall inequalities. Our result is to be contrasted with the fact shown by Matheson and Pruss (1994) that if Ψ(t) = o(Φ(t) as t —> ∞ then the supremum in (2) is attained. In the present paper, we also give a converse to that fact.

This paper presents a state space and time discretization for the general average impulse control of piecewise deterministic Markov processes (PDPs). By combining several previous results we show that under some continuity, boundedness and compactness conditions on the parameters of the process, boundedness of the discretizations, and compactness of the state space, the discretized problem will converge uniformly to the original one. An application to optimal capacity expansion under uncertainty is given.