<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Combinatorial Search With Picat · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1405.2538/</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/1405.2538/feed.xml" rel="self" type="application/rss+xml" /><item><title>Combinatorial Search With Picat — mentioned by clemiclemen</title><link>https://news.ycombinator.com/item?id=39456025</link><guid isPermaLink="false">urn:hackerpapers:mention:1405.2538:39456025</guid><pubDate>Wed, 21 Feb 2024 16:39:16 GMT</pubDate><description>&lt;p&gt;This approach to programming is not all new to me (I studied Prolog at university which looks very similar but does not have the planner feature) but the planner is a very elegant and simple way of solving problems. The comments about video game at the end of the article makes me wonder: the planner feature allows solving problems very easily by writing few lines of clear code. However, how does the performance compares against an algorithm written in imperative programming? Picat seems to be fairly efficient compared to similar languages [1] but I don&amp;#x27;t find a comparison against &amp;quot;standard&amp;quot;…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1405.2538/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item></channel></rss>
