<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Correctness and completeness of logic programs · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1412.8739/</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/1412.8739/feed.xml" rel="self" type="application/rss+xml" /><item><title>Correctness and completeness of logic programs — mentioned by throwaway000002</title><link>https://news.ycombinator.com/item?id=12493616</link><guid isPermaLink="false">urn:hackerpapers:mention:1412.8739:12493616</guid><pubDate>Wed, 14 Sep 2016 01:22:49 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;m sorry I know nothing about core.logic. However, if you are familiar with Prolog, and sufficiently motivated to work through cited references, this paper is a good place to start. [1] [1] https://arxiv.org/abs/1412.8739&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1412.8739/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LO</category></item></channel></rss>
