<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Fast Left Kan Extensions Using The Chase · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2205.02425/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2205.02425/feed.xml" rel="self" type="application/rss+xml" /><item><title>Fast Left Kan Extensions Using The Chase — mentioned by mbid</title><link>https://news.ycombinator.com/item?id=42203479</link><guid isPermaLink="false">urn:hackerpapers:mention:2205.02425:42203479</guid><pubDate>Thu, 21 Nov 2024 12:03:54 GMT</pubDate><description>&lt;p&gt;If you&amp;#x27;re interested in the details, you might want to have a look at papers [1] or [2]. You can add existentials in this framework, which basically means that the lifting problems mentioned above don&amp;#x27;t need to have unique solutions. But as you say, then the &amp;quot;minimal&amp;quot; databases aren&amp;#x27;t determined uniquely up to isomorphism anymore. So the result of Datalog evaluation now depends on the order in which you apply rules. If I recall correctly, then [3] discusses a logic corresponding to accessible categories (Datalog + equality corresponds to locally presentable categories) which includes the the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2205.02425/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DB</category></item></channel></rss>
