Fast left Kan extensions using the chase

DOI10.1007/S10817-022-09634-2MaRDI QIDQ2102935zbMATH OpenOpenAlexFDO

Authors Joshua Meyers, David I. Spivak, Ryan Wisnesky

Publication date 12 December 2022

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2205.02425

zbMATH Keywords

data integrationmodel theorylifting problemsthe chasedata migrationleft Kan extensionsregular logiccomputational category theoryDatalog-Eexistential Horn logic

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• scientific article; zbMATH DE number 784870
• Kan extensions for program optimisation Or: Art and Dan explain an old trick
• Kan extensions are partial colimits
• scientific article; zbMATH DE number 19482

Cites work

• scientific article; zbMATH DE number 3904807 (Why is no real title available?)
• scientific article; zbMATH DE number 19482 (Why is no real title available?)
• scientific article; zbMATH DE number 46995 (Why is no real title available?)
• scientific article; zbMATH DE number 575948 (Why is no real title available?)
• scientific article; zbMATH DE number 1840601 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Algebraic Model Management: A Survey
• Algebraic data integration
• Algebraic databases
• Are all localizing subcategories of stable homotopy categories coreflective?
• Category theory in context
• Computing left Kan extensions.
• Data exchange: getting to the core
• Database queries and constraints via lifting problems
• Enriched categories as a free cocompletion
• Fast Decision Procedures Based on Congruence Closure
• Generic figures and their glueings. A constructive approach to functor categories
• Partial Horn logic and Cartesian categories
• Term Rewriting and All That
• The Knuth-Bendix Completion Procedure and Thue Systems
• The Todd-Coxeter procedure and left Kan extensions
• The complexity of infinite \(H\)-colouring
• Understanding the small object argument
• Weak adjoint functors

Cited in

(3)

• Fast Left Kan Extensions Using The Chase
• Computing left Kan extensions.
• Computing over \(K\)-modules

This page was built for publication: Fast left Kan extensions using the chase

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