Sciweavers

115
Voted
AI
2006
Springer
15 years 3 months ago
The complexity of soft constraint satisfaction
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint type...
David A. Cohen, Martin C. Cooper, Peter Jeavons, A...
128
Voted
COR
2010
123views more  COR 2010»
15 years 3 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
125
Voted
ECAI
2010
Springer
15 years 4 months ago
ProbLog Technology for Inference in a Probabilistic First Order Logic
We introduce First Order ProbLog, an extension of first order logic with soft constraints where formulas are guarded by probabilistic facts. The paper defines a semantics for FOPro...
Maurice Bruynooghe, Theofrastos Mantadelis, Angeli...
137
Voted
IJCAI
2003
15 years 5 months ago
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques
Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all t...
Carmel Domshlak, Francesca Rossi, Kristen Brent Ve...
116
Voted
IJCAI
2003
15 years 5 months ago
A Maximal Tractable Class of Soft Constraints
Many optimization problems can be expressed us­ ing some form of soft constraints, where different measures of desirability arc associated with differ­ ent combinations of domai...
David A. Cohen, Martin C. Cooper, Peter Jeavons, A...
110
Voted
COLING
2008
15 years 5 months ago
Underspecified Modelling of Complex Discourse Constraints
We introduce a new type of discourse constraints for the interaction of discourse relations with the configuration of discourse segments. We examine corpus-extracted examples as s...
Markus Egg, Michaela Regneri
133
Voted
CPAIOR
2006
Springer
15 years 5 months ago
Conflict-Directed A* Search for Soft Constraints
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
Martin Sachenbacher, Brian C. Williams
105
Voted
CAISE
2008
Springer
15 years 5 months ago
A Work Allocation Language with Soft Constraints
Today's business process orchestration languages such as WS-BPEL and BPML have high-level constructs for specifying flow of control and data, but facilities for allocating ta...
Christian Stefansen, Sriram K. Rajamani, Parameswa...
113
Voted
ECAI
2006
Springer
15 years 7 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
125
Voted
CSCLP
2006
Springer
15 years 7 months ago
Bipolar Preference Problems: Framework, Properties and Solving Techniques
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...