https://hackerpaper.kaipfister.de/p/1201.0856/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=38774782urn:hackerpapers:mention:1201.0856:38774782Tue, 26 Dec 2023 19:00:40 GMT<p>This may only be tangentially related, but you might be interested in the recent research on Qualitative Constraint Satisfaction Problems - a good introduction to the topic is Manuel Bodirsky&#x27;s habilitation thesis [1]. The purpose of the subject is, roughly speaking, to exhaustively characterize all types of reliable reasoning which can be carried out efficiently - some people say they are searching for &quot;a logic for P&quot;. The techniques used are a mix of ideas from model theory, universal algebra, Ramsey theory, and computer science. Given the ridiculously ambitious scope of the project, I…</p><p><a href="https://hackerpaper.kaipfister.de/p/1201.0856/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.CC