This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
A collection of distributed databases forms an important architectural component of the ATON project for networked incidence management of highway traffic. The database sub-archit...
Mohan M. Trivedi, Shailendra K. Bhonsle, Amarnath ...
During the last decade, all commercial database systems have included features for parallel processing into their products. This development has been driven by the fact that datab...
For many years, finite model theory was viewed as the backbone of database theory, and database theory in turn supplied finite model theory with key motivations and problems. By n...