Talks and Poster Presentations (with Proceedings-Entry):
B. Kiesl, M. Seidl, H. Tompits, A. Biere:
"Blockedness in Propositional Logic: Are You Satisfied With Your Neighborhood?";
Talk: 26th International Joint Conference on Artificial Intelligence (IJCAI 2017),
Melbourne, Australia;
08-19-2017
- 08-25-2017; in: "Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017)",
F. Bacchus (ed.);
(2017),
ISBN: 978-0-9992411-0-3;
4884
- 4888.
English 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, namely set-blocked clauses and super-blocked clauses. We furthermore present complexity results for deciding whether a clause is set-blocked or super-blocked.
Keywords:
propositional logic, sat solving, preprocessing, inprocessing
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
http://dx.doi.org/10.24963/ijcai.2017/687
Electronic version of the publication:
http://publik.tuwien.ac.at/files/publik_266818.pdf
Created from the Publication Database of the Vienna University of Technology.