Fast left Kan extensions using the chase

DOI10.1007/s10817-022-09634-2OpenAlexW4283829443MaRDI QIDQ2102935

Ryan Wisnesky, David I. Spivak, Joshua Meyers

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

model theorydata integrationlifting 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial Horn logic and Cartesian categories
• Enriched categories as a free cocompletion
• The complexity of infinite \(H\)-colouring
• Computing left Kan extensions.
• The Todd-Coxeter procedure and left Kan extensions
• Are all localizing subcategories of stable homotopy categories coreflective?
• Weak adjoint functors
• Algebraic Databases
• Data exchange: getting to the core
• The Knuth-Bendix Completion Procedure and Thue Systems
• Fast Decision Procedures Based on Congruence Closure
• Algebraic data integration
• Term Rewriting and All That
• Algebraic Model Management: A Survey
• Database queries and constraints via lifting problems
• Understanding the small object argument

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