Sciweavers

174 search results - page 8 / 35
» Interval-valued soft constraint problems
Sort
View
ECAI
2006
Springer
15 years 1 months ago
Enhancing Constraints Manipulation in Semiring-Based Formalisms
Abstract. Many "semiring-like" structures are used in Soft Constraint Satisfaction Problems (SCSPs). We review a few properties of semirings that are useful for dealing w...
Stefano Bistarelli, Fabio Gadducci
AIPS
2006
14 years 11 months ago
Planning for PDDL3 - An OCSP Based Approach
Recent research in AI Planning is focused on improving the quality of the generated plans. PDDL3 incorporates hard and soft constraints on goals and the plan trajectory. Plan traj...
Bharat Ranjan Kavuluri, Naresh Babu Saladi, Deepak...
JETAI
2010
115views more  JETAI 2010»
14 years 8 months ago
From soft constraints to bipolar preferences: modelling framework and solving issues
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 seemi...
Stefano Bistarelli, Maria Silvia Pini, Francesca R...
IJIS
2010
110views more  IJIS 2010»
14 years 6 months ago
The ramification problem in temporal databases: Concurrent execution
In this paper we study the ramification problem in the setting of temporal databases. Standard solutions from the literature on reasoning about action are inadequate because they ...
Nikos Papadakis, Dimitris Plexousakis, Grigoris An...
CVPR
2008
IEEE
15 years 11 months ago
High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF)
LP relaxation approach to soft constraint optimisation (i.e. MAP-MRF) has been mostly considered only for binary problems. We present its generalisation to n-ary problems, includi...
Tomás Werner