{"id":189994,"date":"2013-10-14T00:00:00","date_gmt":"2013-10-16T15:56:50","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/msr-research-item\/sat-based-decision-procedure-for-analytic-sequent-calculi\/"},"modified":"2016-08-02T06:12:37","modified_gmt":"2016-08-02T13:12:37","slug":"sat-based-decision-procedure-for-analytic-sequent-calculi","status":"publish","type":"msr-video","link":"https:\/\/www.microsoft.com\/en-us\/research\/video\/sat-based-decision-procedure-for-analytic-sequent-calculi\/","title":{"rendered":"SAT-Based Decision Procedure for Analytic Sequent Calculi"},"content":{"rendered":"
\n

We present a general reduction of the derivability problem in a given analytic sequent calculus to SAT. This reduction generalizes of the one in [Gurevich and Beklemishev 2012] for the propositional fragment of Primal Logic, and it applies to a wide family of sequent calculi for propositional non-classical logics. Next, we study the extension of such calculi with simple modal operators, of a similar nature to the quotations employed in Primal Logic. We modify the reduction to SAT for these extended calculi, based on general (possibly, non-deterministic) Kripke-style semantics. In particular, it follows that Primal Logic with quotations can be decided in linear time by applying an off-the-shelf HORN-SAT solver. In addition, we point out several possible extensions of Primal Logic that still allow a linear time decision procedure. The talk is based on a work in-progress together with Yoni Zohar (also from TAU).<\/p>\n<\/div>\n

<\/p>\n","protected":false},"excerpt":{"rendered":"

We present a general reduction of the derivability problem in a given analytic sequent calculus to SAT. This reduction generalizes of the one in [Gurevich and Beklemishev 2012] for the propositional fragment of Primal Logic, and it applies to a wide family of sequent calculi for propositional non-classical logics. Next, we study the extension of […]<\/p>\n","protected":false},"featured_media":197924,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"footnotes":""},"research-area":[],"msr-video-type":[206954],"msr-locale":[268875],"msr-impact-theme":[],"msr-pillar":[],"class_list":["post-189994","msr-video","type-msr-video","status-publish","has-post-thumbnail","hentry","msr-video-type-microsoft-research-talks","msr-locale-en_us"],"msr_download_urls":"","msr_external_url":"https:\/\/youtu.be\/WSP8mbLgxfM","msr_secondary_video_url":"","msr_video_file":"","_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video\/189994"}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-video"}],"version-history":[{"count":0,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video\/189994\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media\/197924"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=189994"}],"wp:term":[{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=189994"},{"taxonomy":"msr-video-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video-type?post=189994"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=189994"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=189994"},{"taxonomy":"msr-pillar","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-pillar?post=189994"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}