Additive first-order queries
From MaRDI portal
Publication:5091133
Recommendations
Cites work
- A framework for comparing query languages in their ability to express Boolean queries
- Bisimulation invariance and finite models
- Datalog queries distributing over components
- Equivalences Among Relational Expressions with the Union and Difference Operators
- scientific article; zbMATH DE number 3819693 (Why is no real title available?)
- scientific article; zbMATH DE number 4041866 (Why is no real title available?)
- scientific article; zbMATH DE number 1086487 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 7297870 (Why is no real title available?)
- Modal and guarded characterisation theorems over finite transition systems
- Modal languages and bounded fragments of predicate logic
- Modal logic over finite structures
- On the complexity of division and set joins in the relational algebra
- On the Restraining Power of Guards
- Some Aspects of Model Theory and Finite Structures
- The semijoin algebra and the guarded fragment
- Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the CALM-conjecture
Cited in
(2)
This page was built for publication: Additive first-order queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091133)