Fast left Kan extensions using the chase
From MaRDI portal
Publication:2102935
DOI10.1007/S10817-022-09634-2OpenAlexW4283829443MaRDI QIDQ2102935FDOQ2102935
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
Recommendations
data integrationmodel theorylifting problemsthe chasedata migrationleft Kan extensionsregular logiccomputational category theoryDatalog-Eexistential Horn logic
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Data exchange: getting to the core
- Term Rewriting and All That
- Partial Horn logic and Cartesian categories
- Enriched categories as a free cocompletion
- Fast Decision Procedures Based on Congruence Closure
- Database queries and constraints via lifting problems
- The complexity of infinite \(H\)-colouring
- Weak adjoint functors
- The Knuth-Bendix Completion Procedure and Thue Systems
- Title not available (Why is that?)
- Category theory in context
- Are all localizing subcategories of stable homotopy categories coreflective?
- Algebraic Databases
- Computing left Kan extensions.
- The Todd-Coxeter procedure and left Kan extensions
- Title not available (Why is that?)
- Understanding the small object argument
- Algebraic data integration
- Algebraic Model Management: A Survey
Cited In (2)
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)
