2035 search results - page 290 / 407 » On the complexity of stratified logics |
99
Voted
CORR
2008
Springer
15 years 26 days ago
2008
Springer
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
88
Voted
IJIS
2008
15 years 23 days ago
2008
Abstract. In complex multi agent systems, the agents may be heterogeneous and possibly designed by different programmers. Thus, the importance of defining a standard framework for ...
PAMI
2006
15 years 21 days ago
2006
In documents, tables are important structured objects that present statistical and relational information. In this paper, we present a robust system which is capable of detecting t...
115
click to vote
JSW
2007
15 years 20 days ago
2007
— BPEL (Business Process Execution Language) as a de-facto standard for web service orchestration has drawn particularly attention from researchers and industries. BPEL is a semi...
69
Voted
ENTCS
2002
15 years 17 days ago
2002
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...