Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Δ: Set-theoretic query language capturing LOGSPACE
Annals of Mathematics and Artificial Intelligence
Capturing LOGSPACE over Hereditarily-Finite Sets
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Abstract Computability of Non-deterministic Programs over Various Data Structures
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Using Agents for Concurrent Querying of Web-Like Databases via a Hyper-Set-Theoretic Approach
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Partial Evaluations in a Set-Theoretic Query Language for the WWW
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Complexity and Expressive Power of Logic Programming
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Hyperset Approach to Semi-structured Databases
BNCOD 26 Proceedings of the 26th British National Conference on Databases: Dataspace: The Final Frontier
Structural recursion on ordered trees and list-based complex objects
ICDT'07 Proceedings of the 11th international conference on Database Theory
CATEGORISATION OF COMPUTABLE DATABASE QUERIES
Fundamenta Informaticae
| Hi-index | 0.00 |