346 search results - page 10 / 70 » Logical omniscience as a computational complexity problem |
IJSI
2010
13 years 7 months ago
2010
Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods hav...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
ENTCS
2008
13 years 8 months ago
2008
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
ECAI
2010
Springer
13 years 6 months ago
2010
Springer
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...
AAAI
2012
11 years 11 months ago
2012
In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visual demonstration. These systems were constructed for speciï...