9842 search results - page 66 / 1969 » Problem complexity |
LPAR
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We p...
TSMC
2008
13 years 9 months ago
2008
In most real-world problems, we either know little about the problems or the problems are too complex to have a clear vision on how to decompose them by hand. Thus, it is usually d...
TOC
2008
13 years 9 months ago
2008
Abstract: Consider the following version of the Hamming distance problem for
COCOA
2011
Springer
12 years 9 months ago
2011
Springer
The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economi...
CADE
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. Conjunctive query answering plays a prominent role in applications of description logics (DLs) that involve instance data, but its exact complexity was a long-standing op...