<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1805.00068/</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/1805.00068/feed.xml" rel="self" type="application/rss+xml" /><item><title>Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learning — mentioned by YeGoblynQueenne</title><link>https://news.ycombinator.com/item?id=27383698</link><guid isPermaLink="false">urn:hackerpapers:mention:1805.00068:27383698</guid><pubDate>Thu, 03 Jun 2021 16:27:10 GMT</pubDate><description>&lt;p&gt;&amp;gt;&amp;gt; 3) all predicates work in all-modes, all the time I think this is the feature that is the most sorely missed in Prolog programming and as you say it is possible to have it, but only if one is prepared to jump through no end of hoops. Sometimes it&amp;#x27;s just not possbile with any reasonable amount of effort and any sensible amount of coding. This feature is also the one most characteristic of relations, rather than functions, or the demi-functions that Prolog predicate definitions end up as (i.e. with more or less standard inputs and outputs, a.k.a. modes). I think I detect a hint of…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1805.00068/"&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>
