Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
Real-life problems present several kinds of preferences. We focus on problems with both positive and negative preferences, that we call bipolar preference problems. Although seemin...
Stefano Bistarelli, Maria Silvia Pini, Francesca R...
In graph mining applications, there has been an increasingly strong urge for imposing user-specified constraints on the mining results. However, unlike most traditional itemset co...
Preferences and uncertainty occur in many real-life problems. The theory of possibility is one way of dealing with uncertainty, which allows for easy integration with fuzzy prefer...