Name
Title | ||
|---|---|---|
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques |
Abstract | ||
|---|---|---|
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 three kinds of information. We therefore propose a framework, based on both CP-nets and soft constraints, that handles both hard and soft constraints as well as conditional preferences efficiently and uniformly. We study the complexity of testing the consistency of preference statements, and show how soft constraints can faithfully approximate the semantics of conditional preference statements whilst improving the computational complexity. |
Year | Venue | Keywords |
|---|---|---|
2003 | Clinical Orthopaedics and Related Research | optimization problem,computational complexity,artificial intelligent |
Field | DocType | ISSN |
Discrete mathematics,Mathematical optimization,Computer science,Artificial intelligence,Formalism (philosophy),Optimization problem,Machine learning,Semantics,Computational complexity theory | Conference | IJCAI 2003: 215-220 |
Citations | PageRank | References |
30 | 2.57 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carmel Domshlak | 1 | 2156 | 123.57 |
| F. Rossi | 2 | 713 | 48.69 |
| Kristen Brent Venable | 3 | 168 | 11.88 |
| Toby Walsh | 4 | 4836 | 416.00 |