{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:35:34Z","timestamp":1725557734122},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We present a procedure to decide propositional Dummett logic. Such a procedure relies on a tableau calculus with a multiple premise rule and optimizations. The resulting implementation outperforms the state of the art graph-based procedure.<\/jats:p>","DOI":"10.29007\/mbbq","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T21:46:50Z","timestamp":1516744010000},"page":"52-40","source":"Crossref","is-referenced-by-count":0,"title":["Fast Decision Procedure for Propositional Dummett Logic Based on     a Multiple Premise Tableau Calculus"],"prefix":"10.29007","volume":"9","author":[{"given":"Guido","family":"Fiorino","sequence":"first","affiliation":[]}],"member":"11545","event":{"name":"PAAR-2010: Proceedings of the 2nd Workshop on Practical Aspects of Automated Reasoning"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T21:46:51Z","timestamp":1516744011000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/cS"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/mbbq","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}