Extended Magic for Negation: Efficient Demand-Driven Evaluation of Stratified Datalog with Precise Complexity Guarantees · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/1909.08246/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTExtended Magic for Negation: Efficient Demand-Driven Evaluation of Stratified Datalog with Precise Complexity Guarantees — mentioned by mncharityhttps://news.ycombinator.com/item?id=25670373urn:hackerpapers:mention:1909.08246:25670373Thu, 07 Jan 2021 12:44:24 GMT<p>No recommendations, sorry, merely a couple of thoughts. Prolog and datalog start out as rather different beasts, though prolog tabling gets them closer. It&#x27;s an area of current research[1]. A datalog implementation can serve as DSL, learning tool, and/or efficient solver of large problems. For the first two, most languages have a little datalog implementation or three. For datalog engines, perhaps Z3 and its fixpoint engine from python?? Or maybe Soufflé from python?? But I really have no idea what&#x27;s plausible. I too would be interested. &gt; database/persistence That&#x27;s something with a big…</p><p><a href="https://hackerpaper.kaipfister.de/p/1909.08246/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.LO