184 search results - page 4 / 37 » Querying Proofs |
182
click to vote
PPSWR
2005
Springer
15 years 7 months ago
2005
Springer
We present typing rules for the Web query language Xcerpt. The rules provide a descriptive type system: the typing of a program is an ation of its semantics. The rules can also be ...
117
Voted
FOCS
1992
IEEE
15 years 5 months ago
1992
IEEE
The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...
113
click to vote
DLOG
2007
15 years 4 months ago
2007
Abstract. In this work we propose an alternative approach to inference in DLLite, based on a reduction to reasoning in an extension of function-free Horn Logic (EHL). We develop a ...
118
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
107
Voted
PERVASIVE
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. A logic-based language is often adopted in systems for pervasive computing, because it provides a convenient way to define rules that change the behavior of the systems d...