Sciweavers

351 search results - page 10 / 71
» Perfect Constraints Are Tractable
Sort
View
JAIR
2008
111views more  JAIR 2008»
13 years 7 months ago
New Islands of Tractability of Cost-Optimal Planning
We study the complexity of cost-optimal classical planning over propositional state variables and unary-effect actions. We discover novel problem fragments for which such optimiza...
Michael Katz, Carmel Domshlak
AMAI
2006
Springer
13 years 7 months ago
Bargaining over multiple issues in finite horizon alternating-offers protocol
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
Francesco Di Giunta, Nicola Gatti
CORR
2011
Springer
187views Education» more  CORR 2011»
12 years 11 months ago
Backdoors to Tractable Answer-Set Programming
We present a unifying approach to the efficient evaluation of propositional answer-set programs. Our approach is based on backdoors which are small sets of atoms that represent ...
Johannes Klaus Fichte, Stefan Szeider
EDBT
2009
ACM
85views Database» more  EDBT 2009»
14 years 8 days ago
Expressive, yet tractable XML keys
Constraints are important for a variety of XML recommendations and applications. Consequently, there are numerous opportunities for advancing the treatment of XML semantics. In pa...
Sven Hartmann, Sebastian Link
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
14 years 5 days ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
Philippe Rolet, Michèle Sebag, Olivier Teyt...