881 search results - page 65 / 177 » Solving satisfiability problems with preferences |
JAIR
2008
13 years 8 months ago
2008
Reasoning about agent preferences on a set of alternatives, and the aggregation of such preferences into some social ranking is a fundamental issue in reasoning about multi-agent ...
PUK
2001
13 years 10 months ago
2001
The work described in this paper presents an approach on scheduling in a virtual enterprise in the tourism sector. This scheduling scenario has to reconcile customers' and ser...
Publication
We generalise the problem of inverse reinforcement learning to multiple tasks, from multiple demonstrations. Each one may represent one expert trying to solve a different task, or ...
TABLEAUX
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
ICDE
2007
IEEE
14 years 3 months ago
2007
IEEE
At present, we have proceeded to extend SQL into a new language called dmFSQL (data mining Fuzzy Structured Query Language) which can be used to solve real problems of Data Mining...