The choice of programming primitives for set-like programming languages
Proc. of the European symposium on programming on ESOP 86
A calculus of mobile processes, I
Information and Computation
Hereditarily-finite sets, data bases and polynomial-time computability
Informatika '91 Selected papers of the 5th Soviet-French symposium on Theoretical computer science, methods and tools for compilation, and program development
Query languages for hierarchic databases
Information and Computation
A query language and optimization techniques for unstructured data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
&Dgr;-languages for sets and LOGSPACE computable graph transformers
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Linear ordering on graphs, anti-founded sets and polynomial time computability
Theoretical Computer Science
Distributed query evaluation on semistructured data
ACM Transactions on Database Systems (TODS)
Communication and Concurrency
Queries and Computation on the Web
ICDT '97 Proceedings of the 6th International Conference on Database Theory
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
Query Decomposition and View Maintenance for Query Languages for Unstructured Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Capturing LOGSPACE over Hereditarily-Finite Sets
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
ASA/MA 2000 Proceedings of the Second International Symposium on Agent Systems and Applications and Fourth International Symposium on Mobile Agents
On the Formal Semantics of SDL-2000: A Compilation Approach Based on an Abstract SDL Machine
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
A Bounded Set Theory with Anti-Foundation Axiom and Inductive Definability
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Bounded Hyperset Theory and Web-like Data Bases
KGC '97 Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
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
Bounded Set Theory and Polynominal Computability
FCT '87 Proceedings of the International Conference on Fundamentals of Computation Theory
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Relational queries computable in polynomial time (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Algebras of feasible functions
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Distributed computation of web queries using automata
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Δ: Set-theoretic query language capturing LOGSPACE
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
The aim of this paper is to present a brief outline of a further step in the ongoing work concerning the hyper-set-theoretic approach to (unstructured) distributed Web-like databases and corresponding query language 驴. The novel idea in this paper consists in using dynamically created mobile agents (processes) for more efficient querying such databases by exploiting concurrently distributed computational resources, potentially over the whole Internet. A fragment of a calculus of querying agents based on 驴 is presented.