1391 search results - page 249 / 279 » Completeness of Neighbourhood Logic |
187
click to vote
AAAI
1990
15 years 7 months ago
1990
Since knowledge bases (KBs) are usually incomplete, they should be able to provide information regarding their own incompleteness, which requires them to introspect on what they k...
137
click to vote
CONEXT
2009
ACM
15 years 7 months ago
2009
ACM
The lack of automation associated with network operations in general and network configuration management in particular, is widely recognized as a significant contributing factor ...
145
click to vote
ACS
2007
15 years 6 months ago
2007
Abstract. For a symmetric monoidal-closed category X and any object K, the category of K-Chu spaces is small-topological over X and small cotopological over Xop . Its full subcateg...
152
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In recent years, the significant growth of RDF data used in numerous applications has made its efficient and scalable manipulation an important issue. In this paper, we present RD...
153
click to vote
CORR
2008
Springer
15 years 6 months 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...