Executable first-order queries in the logic of information flows
From MaRDI portal
Recommendations
Cites work
- An algebra of modular systems: static and dynamic perspectives
- Dynamic predicate logic
- Dynamic query optimization under access limitations and dependencies
- Elements of finite model theory.
- Executable First-Order Queries in the Logic of Information Flows
- Generating plans from proofs
- Generating plans from proofs. The interpolation-based approach to query reformulation
- scientific article; zbMATH DE number 1556014 (Why is no real title available?)
- scientific article; zbMATH DE number 1841810 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Inputs, Outputs, and Composition in the Logic of Information Flows
- On the calculus of relations.
- Query containment for data integration systems
- Recursive query plans for data integration
- Relative expressive power of navigational querying on graphs using transitive closure
- The origin of relation algebras in the development and axiomatization of the calculus of relations
- The relational model of data and cylindric algebras
This page was built for publication: Executable first-order queries in the logic of information flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563053)