2035 search results - page 55 / 407 » On the complexity of stratified logics |
141
click to vote
CORR
2008
Springer
15 years 6 months 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...
149
click to vote
CADE
2008
Springer
16 years 6 months 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...
130
click to vote
LICS
2006
IEEE
16 years 4 days 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...
156
click to vote
PKDD
2004
Springer
15 years 11 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...
149
click to vote
AAAI
1990
15 years 7 months ago
1990
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the comp...