<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Tableau-based decision procedure for the multi-agent epistemic logic with operators of common and distributed knowledge · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/0808.4133/</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/0808.4133/feed.xml" rel="self" type="application/rss+xml" /><item><title>Tableau-based decision procedure for the multi-agent epistemic logic with operators of common and distributed knowledge — mentioned by evincarofautumn</title><link>https://news.ycombinator.com/item?id=15030246</link><guid isPermaLink="false">urn:hackerpapers:mention:0808.4133:15030246</guid><pubDate>Wed, 16 Aug 2017 19:10:45 GMT</pubDate><description>&lt;p&gt;Wow, this got more replies than I expected. I was partly kidding, in that I don’t think it’s a huge concern for humans, but for example the tableau decision procedure[1] for modal logics such as epistemic logic is EXPTIME-complete[2]. [1]: https://en.wikipedia.org/wiki/Method_of_analytic_tableaux [2]: https://arxiv.org/abs/0808.4133&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/0808.4133/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LO</category></item></channel></rss>
