6 research outputs found
Anticipation and Risk – From the inverse problem to reverse computation
Abstract. Risk assessment is relevant only if it has predictive relevance. In this sense, the anticipatory perspective has yet to contribute to more adequate predictions. For purely physics-based phenomena, predictions are as good as the science describing such phenomena. For the dynamics of the living, the physics of the matter making up the living is only a partial description of their change over time. The space of possibilities is the missing component, complementary to physics and its associated predictions based on probabilistic methods. The inverse modeling problem, and moreover the reverse computation model guide anticipatory-based predictive methodologies. An experimental setting for the quantification of anticipation is advanced and structural measurement is suggested as a possible mathematics for anticipation-based risk assessment
Interval-valued soft constraint problems
Constraints and quantitative preferences, or costs, are very useful for
modelling many real-life problems. However, in many settings, it is difficult to specify
precise preference values, and it is much more reasonable to allow for preference
intervals. We define several notions of optimal solutions for such problems, providing
algorithms to find optimal solutions and also to test whether a solution is optimal.
Most of the time these algorithms just require the solution of soft constraint prob-
lems, which suggests that it may be possible to handle this form of uncertainty in
soft constraints without significantly increasing the computational effort needed to
reason with such problems. This is supported also by experimental results. We also
identify classes of problems where the same results hold if users are allowed to use
multiple disjoint intervals rather than a single one
Reasoning with incomplete and imprecise preferences
Preferences are present in many real life situations but it is often difficult to quantify them giving a precise value. Sometimes preference values may be missing because of privacy reasons or because they are expensive to obtain or to produce. In some other situations the user of an automated system may have a vague idea of whats he wants.
In this thesis we considered the general formalism of soft constraints, where preferences play a crucial role and we extended such a framework to handle both incomplete and imprecise preferences. In particular we provided new theoretical frameworks to handle such kinds of preferences.
By admitting missing or imprecise preferences, solving a soft constraint problem becomes a different task. In fact, the new goal is to find solutions which are the best ones independently of the precise value the each preference may have. With this in mind we defined two notions of optimality: the possibly optimal
solutions and the necessary optimal solutions, which are optimal no matter we assign a precise value to a missing or imprecise preference. We provided several algorithms, bases on both systematic and local search approaches, to find such kind of solutions.
Moreover, we also studied the impact of our techniques also in a specific class of problems (the stable marriage problems) where imprecision and incompleteness have a specific meaning and up to now have been tackled with different techniques.
In the context of the classical stable marriage problem we developed a fair method to randomly generate stable marriages of a given problem instance.
Furthermore, we adapted our techniques to solve stable marriage problems with ties and incomplete lists, which are known to be NP-hard, obtaining good results both in terms of size of the returned marriage and in terms of steps need to find a solution
Uncertainty in Soft Constraint Problems
none2noneM. S. Pini; F. RossiPini, MARIA SILVIA; Rossi, Francesc