SEPARATING AUXILIARY ARITY HIERARCHY OF FIRST-ORDER INCREMENTAL EVALUATION SYSTEMS USING (3K+1)-ary INPUT RELATIONS
From MaRDI portal
Publication:4528763
Recommendations
- Tools and Algorithms for the Construction and Analysis of Systems
- Incremental and decremental evaluation of transitive closure by first- order queries
- An arithmetical hierarchy in propositional dynamic logic
- scientific article; zbMATH DE number 1086669
- Formal Methods in Computer-Aided Design
- LTL with arithmetic and its applications in reasoning about hierarchical systems
- Foundations of Information and Knowledge Systems
- Arity and alternation: a proper hierarchy in higher order logics
- Arity bounds in first-order incremental evaluation and definition of polynomial time database queries
- scientific article; zbMATH DE number 1903356
Cites work
- Arity bounds in first-order incremental evaluation and definition of polynomial time database queries
- Incremental and decremental evaluation of transitive closure by first- order queries
- Lower bounds for constant-depth circuits in the presence of help bits
- Nonrecursive incremental evaluation of Datalog queries
Cited in
(3)
This page was built for publication: SEPARATING AUXILIARY ARITY HIERARCHY OF FIRST-ORDER INCREMENTAL EVALUATION SYSTEMS USING (3K+1)-ary INPUT RELATIONS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4528763)