2035 search results - page 341 / 407 » On the complexity of stratified logics |
ICDT
2001
ACM
15 years 3 months ago
2001
ACM
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
146
Voted
ISEC
2001
Springer
15 years 3 months ago
2001
Springer
Over the past decade the Internet has evolved into the largest public community in the world. It provides a wealth of data content and services in almost every field of science, t...
70
Voted
LCPC
2001
Springer
15 years 3 months ago
2001
Springer
Integer division, modulo, and remainder operations are expressive and useful operations. They are logical candidates to express complex data accesses such as the wrap-around behav...
100
click to vote
PAPM
2001
Springer
15 years 3 months ago
2001
Springer
Abstract. This paper reports on the implementation and the experiments with symbolic model checking of continuous-time Markov chains using multi-terminal binary decision diagrams (...
RTA
2001
Springer
15 years 3 months ago
2001
Springer
In this paper we give a simple and uniform presentation of the rewriting calculus, also called Rho Calculus. In addition to its simplicity, this formulation explicitly allows us to...