Right-adjoints for Datalog programs

DOI10.4230/LIPICS.ICDT.2024.10MaRDI QIDQ6902079zbMATH OpenFDO

Authors Balder ten Cate, Víctor Dalmau, Jakub Opršal

Publication date 11 November 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICDT.2024.10

zbMATH Keywords

adjointsconjunctive queriesdata examplesdatabase constraintsDataloghomomorphism dualities

Mathematics Subject Classification ID

Database theory (68P15)

Cites work

• Digraph functors which admit both left and right adjoints
• Dualities for Constraint Satisfaction Problems
• Dualities in full homomorphisms
• Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Monadic Datalog and the expressive power of languages for web information extraction
• On digraph coloring problems and treewidth duality
• On the equivalence of recursive and nonrecursive Datalog programs
• Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
• Regular families of forests, antichains and duality pairs of relational structures
• The right adjoints into the categories of relational systems
• Topology and Adjunction in Promise Constraint Satisfaction

Cited in

(1)

• Datalog-expressibility for monadic and guarded second-order logic

This page was built for publication: Right-adjoints for Datalog programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902079)