<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Using Answer Set Programming for HPC Dependency Solving · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2210.08404/</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/2210.08404/feed.xml" rel="self" type="application/rss+xml" /><item><title>Using Answer Set Programming for HPC Dependency Solving — mentioned by teleforce</title><link>https://news.ycombinator.com/item?id=45600800</link><guid isPermaLink="false">urn:hackerpapers:mention:2210.08404:45600800</guid><pubDate>Thu, 16 Oct 2025 02:28:46 GMT</pubDate><description>&lt;p&gt;It&amp;#x27;s good that you&amp;#x27;ve mentioned Spack but not for HPC work, and that&amp;#x27;s very interesting. This a high level overview by one of the Spack authors from the HN post back in 2023 (top comment from 100 comments), including the Spack original paper link [1]: At a very high level, Spack has: * Nix&amp;#x27;s installation model and configuration hashing * Homebrew-like packages, but in a more expressive Python DSL, and with more versions/options * A very powerful dependency resolver that doesn&amp;#x27;t just pick from a set of available configurations -- it configures your build according to possible configurations.…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2210.08404/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.SE</category></item><item><title>Using Answer Set Programming for HPC Dependency Solving — mentioned by tgamblin</title><link>https://news.ycombinator.com/item?id=36089867</link><guid isPermaLink="false">urn:hackerpapers:mention:2210.08404:36089867</guid><pubDate>Fri, 26 May 2023 21:44:27 GMT</pubDate><description>&lt;p&gt;Love this article and the push to build awareness of what modern SAT solvers can do. It&amp;#x27;s worth mentioning that there are higher level abstractions that are far more accessible than SAT. If I were teaching a course on this, I would start with either Answer Set Programming (ASP) or Satisfiability Modulo Theories (SMT). The most widely used solvers for those are clingo [0] and Z3 [1]: With ASP, you write in a much clearer Prolog-like syntax that does not require nearly as much encoding effort as your typical SAT problem. Z3 is similar -- you can code up problems in a simple Python API, or write…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2210.08404/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.SE</category></item><item><title>Using Answer Set Programming for HPC Dependency Solving — HN submission</title><link>https://news.ycombinator.com/item?id=35613228</link><guid isPermaLink="false">urn:hackerpapers:submission:2210.08404:35613228</guid><pubDate>Tue, 18 Apr 2023 12:42:57 GMT</pubDate><description>&lt;p&gt;Simplifying HPC dependency solving with logic programming&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2210.08404/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.SE</category></item><item><title>Using Answer Set Programming for HPC Dependency Solving — mentioned by tgamblin</title><link>https://news.ycombinator.com/item?id=35238384</link><guid isPermaLink="false">urn:hackerpapers:mention:2210.08404:35238384</guid><pubDate>Mon, 20 Mar 2023 20:42:13 GMT</pubDate><description>&lt;p&gt;Original author here -- since I know that people click the comments to decide whether to read further, here&amp;#x27;s a (biased?) summary: Spack is aimed at end users, developers, and admins. It&amp;#x27;s used primarily in HPC at the moment but it would be great to see use outside of the HPC community. Spack supports: 1. Basic installation (spack install foo, foo@3.1.2, foo@3.1.2 +option, etc.) 2. Reproducible environments, via `spack.yaml` and `spack.lock` files that you can version in a repo. You can use this to build a custom software stack, build some dependencies for a project, etc. 3. Building many…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2210.08404/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.SE</category></item><item><title>Using Answer Set Programming for HPC Dependency Solving — mentioned by tgamblin</title><link>https://news.ycombinator.com/item?id=35194649</link><guid isPermaLink="false">urn:hackerpapers:mention:2210.08404:35194649</guid><pubDate>Fri, 17 Mar 2023 08:38:11 GMT</pubDate><description>&lt;p&gt;Have you looked at Spack (https://github.com/spack/spack)? Disclaimer: I lead the project. Spack essentially is nix with dependency resolution. spack packages can have conditional (nearly) anything: versions, options, compiler choices, dependencies (including virtual deps). The resolver can make choices about all of those. See here for more details: https://arxiv.org/abs/2210.08404&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2210.08404/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.SE</category></item><item><title>Using Answer Set Programming for HPC Dependency Solving — mentioned by tgamblin</title><link>https://news.ycombinator.com/item?id=33566807</link><guid isPermaLink="false">urn:hackerpapers:mention:2210.08404:33566807</guid><pubDate>Fri, 11 Nov 2022 21:03:29 GMT</pubDate><description>&lt;p&gt;Co-author/spack guy/occasional frequenter of Nix fora here. Aside from what p4ul said above, the main architectural differences between Nix and Spack are: 1. Spack has a dependency solver (the &amp;quot;concretizer&amp;quot;), Nix does not 2. Spack packages are parameterized, and we solve for parameters like build options, compilers, virtual dependencies, etc., so the user can say what tweaks they want on the CLI or in an environment. To do this same with Nix packages you typically need to hack on some nixpkgs. The goal of Spack is to be able to compose and swap libraries, compilers, and other options easily.…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2210.08404/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.SE</category></item><item><title>Using Answer Set Programming for HPC Dependency Solving — HN submission</title><link>https://news.ycombinator.com/item?id=33566680</link><guid isPermaLink="false">urn:hackerpapers:submission:2210.08404:33566680</guid><pubDate>Fri, 11 Nov 2022 20:54:20 GMT</pubDate><description>&lt;p&gt;Using Answer Set Programming for HPC Dependency Solving&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2210.08404/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.SE</category></item><item><title>Using Answer Set Programming for HPC Dependency Solving — HN submission</title><link>https://news.ycombinator.com/item?id=33313907</link><guid isPermaLink="false">urn:hackerpapers:submission:2210.08404:33313907</guid><pubDate>Mon, 24 Oct 2022 07:36:08 GMT</pubDate><description>&lt;p&gt;Using Answer Set Programming for Dependency Solving in Spack&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2210.08404/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.SE</category></item></channel></rss>
