3914 search results - page 392 / 783 » Automating SLA modeling |
190
click to vote
LPNMR
2001
Springer
15 years 11 months ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
270
click to vote
SIGECOM
2000
ACM
15 years 11 months ago
2000
ACM
We introduce an information bundling model that addresses two important but relatively unstudied issues in real markets for information goods: automated customization of content b...
262
click to vote
LPKR
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. We study the relationship between argumentation (abduction) and disjunctive logic programming. Based on the paradigm of argumentation, an abductive semantic framework for...
172
click to vote
ECSQARU
2009
Springer
15 years 10 months ago
2009
Springer
The Transferable Belief Model is a powerful interpretation of belief function theory where decision making is based on the pignistic transform. Smets has proposed a generalization ...
184
click to vote
DLOG
2008
15 years 9 months ago
2008
We identify the complexity of (finite model) reasoning in the DL SROIQ to be N2ExpTime-complete. We also prove that (finite model) reasoning in the DL SR--a fragment of SROIQ witho...