https://hackerpaper.kaipfister.de/p/1006.4948/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=9275042urn:hackerpapers:mention:1006.4948:9275042Fri, 27 Mar 2015 07:05:57 GMT<p>Fwiw some of the later logic-programming work coming out of Prolog has produced languages with Prolog-like syntax but without statement order being significant, and guaranteed termination. This paradigm, Answer Set Programming (ASP), is also based on solvers, so has some relationship to SMT, but feels more like Prolog to program, e.g. it has negation-as-failure. My favorite implementation is from the University of Potsdam [1]. Imo it&#x27;s a much nicer modeling language, especially for incremental formalization, in part because of implementing a nonmonotonic rather than classical logic. It also…</p><p><a href="https://hackerpaper.kaipfister.de/p/1006.4948/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.LO