3047 search results - page 374 / 610 » On the Meaning of Logical Completeness |
77
Voted
FSTTCS
2007
Springer
15 years 5 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
KES
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. This work presents a clustering method which can be applied to relational knowledge bases. Namely, it can be used to discover interesting groupings of semantically annota...
SEMWEB
2007
Springer
15 years 5 months ago
2007
Springer
Several description frameworks to semantically describe and match services on the one hand and service requests on the other have been presented in the literature. Many of the curr...
98
Voted
ICAS
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper is concerned with the problem of intrinsically assigning meaning to the signals responsible for autonomic responses in a system. Without an associated cognitive system,...
103
Voted
TLDI
2005
ACM
15 years 4 months ago
2005
ACM
Atomicity is a fundamental correctness property in multithreaded programs. This paper presents an algorithm for verifying atomicity via type inference. The underlying type system ...