<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Adding Circumscription to Decidable Fragments of First-Order Logic: A Complexity Rollercoaster · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2407.20822/</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/2407.20822/feed.xml" rel="self" type="application/rss+xml" /><item><title>Adding Circumscription to Decidable Fragments of First-Order Logic: A Complexity Rollercoaster — mentioned by nyrikki</title><link>https://news.ycombinator.com/item?id=48196396</link><guid isPermaLink="false">urn:hackerpapers:mention:2407.20822:48196396</guid><pubDate>Tue, 19 May 2026 17:30:06 GMT</pubDate><description>&lt;p&gt;As TLA+ uses state machines that can define infinite state spaces, checking arbitrary temporal logic formulas is undecidable in the general case. Using a TLC model checker to verify invariants or properties, finding a valid counterexample can scale non-elementarily. In fact, in some situations it can end up being Ackermann-complete[0], but even recursively enumerable problems can be Tower-complete. I would say that unless you focus on more detailed temporal logic pitfalls you may have issues. So IMHO this will stay a use case specific solution, that you choose based on context. Even a common…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2407.20822/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Adding Circumscription to Decidable Fragments of First-Order Logic: A Complexity Rollercoaster — mentioned by nyrikki</title><link>https://news.ycombinator.com/item?id=47356408</link><guid isPermaLink="false">urn:hackerpapers:mention:2407.20822:47356408</guid><pubDate>Thu, 12 Mar 2026 20:14:49 GMT</pubDate><description>&lt;p&gt;Even with classic compilation, it is only the semantic behavior that is preserved. What the Church–Rosser property/confluence is in term rewriting in lambda calculus is a possible lens. To have a formally verified spec, one has to use some decidable fragment of FO. If you try to replace code generation with rewriting things can get complicated fast.[2] Rust uses affine types as an example and people try to add petri-nets[0] but in general petri-net reachability is Ackerman-complete [1] It is just the trade off of using a context free like system like an LLM with natural language. HoTT and how…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2407.20822/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Adding Circumscription to Decidable Fragments of First-Order Logic: A Complexity Rollercoaster — mentioned by nyrikki</title><link>https://news.ycombinator.com/item?id=42118918</link><guid isPermaLink="false">urn:hackerpapers:mention:2407.20822:42118918</guid><pubDate>Tue, 12 Nov 2024 19:44:04 GMT</pubDate><description>&lt;p&gt;You are using a different definition of strategic than the DoD uses, what you are describing is closer to tactical decisions. They are talking about typically Org wide scope, long-term direction . They aren&amp;#x27;t talking about planning hidden as &amp;#x27;strategic planning&amp;#x27; in the biz world. LLMs are powerful, but are by definition past focused, and are still in-context learners. As they covered, hallucinations, adverse actions, unexplainable models, etc are problematic. The &amp;quot;novel strategic approaches&amp;quot; is what in this domain would be tactics, not stratagy which is focused on the unknowable or unknown…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2407.20822/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item></channel></rss>
