3134 search results - page 14 / 627 » Computing full disjunctions |
163
Voted
PLDI
2010
ACM
16 years 3 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 ...
182
Voted
LPKR
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. This paper presents an extension of disjunctive datalog (Datalog∨ ) by nested rules. Nested rules are (disjunctive) rules where elements of the head may be also rules. ...
204
Voted
ENC
2008
IEEE
16 years 25 days ago
2008
IEEE
In many fields of automated information processing it becomes crucial to consider together imprecise, uncertain or inconsistent information. Argumentation theory is a suitable fr...
157
Voted
ECOOPW
1999
Springer
15 years 10 months ago
1999
Springer
Security is a fundamental precondition for the acceptance of mobile agent systems. In this paper we discuss protocols to improve agent security by distributing critical data and op...
322
Voted
SIGIR
2011
ACM
14 years 9 months ago
2011
ACM
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...