Notice
This item was automatically migrated from a legacy system. It's data has not been checked and might not meet the quality criteria of the present system.
Record link: 
http://hdl.handle.net/20.500.12708/57274
-
Title: 
Blockedness in Propositional Logic: Are You Satisfied With Your Neighborhood?
-
Citation: 
Kiesl, B., Seidl, M., Tompits, H., & Biere, A. (2017). Blockedness in Propositional Logic: Are You Satisfied With Your Neighborhood? In F. Bacchus (Ed.), Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. https://doi.org/10.24963/ijcai.2017/687
-
Publisher DOI: 
10.24963/ijcai.2017/687
-
Publication Type: 
Inproceedings - Full-Paper Contribution
en
Authors: 
Kiesl, Benjamin 
Seidl, Martina 
Tompits, Hans 
Biere, Armin 
-
Organisational Unit: 
E192-03 - Forschungsbereich Knowledge Based Systems 
-
Published in: 
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence 
-
Date (published): 
2017
-
Event name: 
26th International Joint Conference on Artificial Intelligence (IJCAI 2017) 
-
Event date: 
19-Aug-2017 - 25-Aug-2017
-
Event place: 
Melbourne, Australia, Non-EU
-
Number of Pages: 
5
-
Peer reviewed: 
Yes
-
Keywords: 
propositional logic; sat solving; preprocessing; inprocessing
-
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.
en
Research Areas: 
Logic and Computation: 100%
-
Science Branch: 
Informatik
-
Appears in Collections:
Conference Paper

Show full item record

Page view(s)

137
checked on Nov 21, 2023

Google ScholarTM

Check