1634 search results - page 168 / 327 » Reasoning about Knowledge Using Rough Sets |
95
Voted
PLDI
2010
ACM
15 years 10 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
108
click to vote
ICTAI
2005
IEEE
15 years 6 months ago
2005
IEEE
Following the framework proposed by Besnard and Hunter for argumentation, this paper aims to propose a logical tool for the generation of new arguments when two formal agents have...
88
Voted
LICS
2010
IEEE
14 years 11 months ago
2010
IEEE
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
112
Voted
PSSS
2003
15 years 2 months ago
2003
: RDF-based tools promise to provide a base for reasoning about metadata and about situated data—data describing entities situated in time and space—that is superior to alterna...
139
click to vote
ICS
1995
Tsinghua U.
15 years 4 months ago
1995
Tsinghua U.
Current data cache organizations fail to deliver high performance in scalar processors for many vector applications. There are two main reasons for this loss of performance: the u...