1941 search results - page 99 / 389 » On the Hardness of Approximate Reasoning |
139
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
194
click to vote
KR
2010
Springer
15 years 10 months ago
2010
Springer
We investigate the computational complexity of axiom pinpointing, which is the task of finding minimal subsets of a Description Logic knowledge base that have a given consequence...
140
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...
185
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
139
click to vote
DLOG
2009
15 years 7 months ago
2009
Abstract There are various techniques for specifying a module of an ontology that covers all knowledge about a given set of terms. These differ with respect to the size of the modu...