{"type":"ScholarlyArticle","title":"Blockedness in Propositional Logic: Are You Satisfied With Your Neighborhood?","authors":[{"name":"Benjamin Kiesl","slug":"benjamin-kiesl","given":"Benjamin","family":"Kiesl","affiliation":"TU Wien , Austria"},{"name":"Martina Seidl","slug":"martina-seidl","given":"Martina","family":"Seidl","affiliation":"TU Wien , Austria; JKU Linz , Austria"},{"name":"Hans Tompits","slug":"hans-tompits","given":"Hans","family":"Tompits","affiliation":"TU Wien , Austria"},{"name":"Armin Biere","slug":"armin-biere","given":"Armin","family":"Biere","affiliation":"TU Wien , Austria; JKU Linz , Austria"}],"abstract":"Clause-elimination techniques that simplify formulas by removing redundant clauses play an important role in modern SAT solving. Among the types of redundant clauses, blocked clauses are particularly popular. For checking whether a clause C is blocked in a formula F, one only needs to consider the so-called resolution neighborhood of C, i.e., the set of clauses that can be resolved with C. Because of this, blocked clauses are referred to as being locally redundant. In this paper, we discuss powerful generalizations of blocked clauses that are still locally redundant, viz. set-blocked clauses and super-blocked clauses. We furthermore present complexity results for deciding whether a clause is set-blocked or super-blocked.","doi":"10.24963/ijcai.2017/687","url":"https://ijcai.org/proceedings/2017/687","pdf":"https://ijcai.org/proceedings/2017/0687.pdf","markdown":"https://ijcai.org/proceedings/2017/687.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/687","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Best Sister Conferences","track":"Best Sister Conferences","number":687,"pages":{"first":4884,"last":4888},"keywords":["Artificial Intelligence: search and constraint satisfaction","Artificial Intelligence: knowledge representation and reasoning"],"videos":[],"references":[{"position":1,"raw":"[Balyo et al., 2014] Tomas Balyo, Andreas Fröhlich, Marijn Heule, and Armin Biere. Everything you always wanted to know about blocked sets (but were afraid to ask). In Carsten Sinz and Uwe Egly, editors, Proc. of the 17th Int. Conference on Theory and Applications of Satisfiability Testing (SAT 2014), volume 8561 of LNCS, pages 317- 332, Cham, 2014. Springer.","title":"Everything you always wanted to know about blocked sets (but were afraid to ask)","authors":"Balyo","year":"2014","venue":"Proc. of the 17th Int. Conference on Theory and Applications of Satisfiability Testing (SAT 2014)","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Chen, 2015] Jingchao Chen. Fast blocked clause decompo- sition with high quality. CoRR, abs/1507.00459, 2015.","title":"Fast blocked clause decomposition with high quality","authors":"Chen ;, Jingchao Chen","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Davis and Putnam, 1960] Martin Davis and Hilary Putnam. A computing procedure for quantification theory. Journal of the ACM, 7(3):201-215, 1960.","title":"A computing procedure for quantification theory","authors":"Putnam ; Davis, Martin Davis, Hilary Putnam","year":"1960","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Heule and Biere, 2013] Marijn Heule and Armin Biere. Blocked clause decomposition. In Ken McMillan, Aart Middeldorp, and Andrei Voronkov, editors, Proc. of the 19th Int. Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-19), volume 8312 of LNCS, pages 423-438, Heidelberg, 2013. Springer.","title":"Blocked clause decomposition","authors":"Marijn Heule, Armin Biere","year":"2013","venue":"Proc. of the 19th Int. Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-19)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Iser et al., 2015] Markus Iser, Norbert Manthey, and Carsten Sinz. Recognition of nested gates in CNF for- mulas. In Marijn Heule and Sean Weaver, editors, Proc. of the 18th Int. Conference on Theory and Applications of Satisfiability Testing (SAT 2015), volume 9340 of LNCS, pages 255-271, Cham, 2015. Springer.","title":"Recognition of nested gates in CNF formulas","authors":"Markus Iser, Norbert Manthey, Carsten Sinz","year":"2015","venue":"Proc. of the 18th Int. Conference on Theory and Applications of Satisfiability Testing (SAT 2015)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Järvisalo et al., 2010] Matti Järvisalo, Armin Biere, and Marijn Heule. Blocked clause elimination. In Javier Es- parza and Rupak Majumdar, editors, Proc. of the 16th Int. Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2010), volume 6015 of LNCS, pages 129-144, Heidelberg, 2010. Springer.","title":"Blocked clause elimination","authors":"Matti Järvisalo, Armin Biere, Marijn Heule","year":"2010","venue":"Proc. of the 16th Int. Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2010)","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Järvisalo et al., 2012] Matti Järvisalo, Marijn Heule, and Armin Biere. Inprocessing rules. In Bernhard Gramlich, Dale Miller, and Uli Sattler, editors, Proc. of the 6th Int. Joint Conference on Automated Reasoning (IJCAR 2012), volume 7364 of LNCS, pages 355-370, Heidelberg, 2012. Springer.","title":"Inprocessing rules","authors":"Matti Järvisalo, Marijn Heule, Armin Biere","year":"2012","venue":"Proc. of the 6th Int. Joint Conference on Automated Reasoning (IJCAR 2012)","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Kiesl et al., 2016] Benjamin Kiesl, Martina Seidl, Hans Tompits, and Armin Biere. Super-blocked clauses. In Nicola Olivetti and Ashish Tiwari, editors, Proc. of the 8th Int. Joint Conference on Automated Reason- ing (IJCAR 2016), volume 9706 of LNCS, pages 45-61, Cham, 2016. Springer.","title":"Super-blocked clauses","authors":"Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere","year":"2016","venue":"Proc. of the 8th Int. Joint Conference on Automated Reasoning (IJCAR 2016)","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Kullmann, 1999] Oliver Kullmann. On a generalization of extended resolution. Discrete Applied Mathematics, 96- 97:149-176, 1999.","title":"On a generalization of extended resolution","authors":"Oliver Kullmann","year":"1999","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Manthey et al., 2013] Norbert Manthey, Tobias Philipp, and Christoph Wernhard. Soundness of inprocessing in clause sharing SAT solvers. In Matti Järvisalo and Allen Van Gelder, editors, Proc. of the 16th Int. Conference on Theory and Applications of Satisfiability Testing (SAT 2013), volume 7962 of LNCS, pages 22-39, Heidelberg, 2013. Springer.","title":"Soundness of inprocessing in clause sharing SAT solvers","authors":"Manthey","year":"2013","venue":"Proc. of the 16th Int. Conference on Theory and Applications of Satisfiability Testing (SAT 2013)","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}