2022 search results - page 62 / 405 » Complexity of Non-Monotonic Logics |
98
Voted
DLOG
2003
15 years 2 months ago
2003
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...
88
Voted
CORR
2008
Springer
15 years 22 days ago
2008
Springer
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
CADE
2008
Springer
16 years 29 days ago
2008
Springer
In this paper, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. This method is easy to implement, but si...
74
Voted
LICS
2006
IEEE
15 years 6 months ago
2006
IEEE
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
PKDD
2004
Springer
15 years 6 months ago
2004
Springer
One of the most important operations involving Data Mining patterns is computing their similarity. In this paper we present a general framework for comparing both simple and comple...