Efficient Symmetry Breaking Predicates for Quantified Boolean Formulae
نویسندگان
چکیده
Many reasoning task and combinatorial problems exhibit symmetries. Exploiting such symmetries has been proved useful in reducing the search space. In this paper, a formal approach for symmetry breaking in quantified boolean formula is proposed. It make use of a new efficient technique for encoding the additional symmetry predicates in prenex clausal form. The new asymmetric formula is equivalent to the original one with respect to the validity. Experimental evaluation shows significant improvements over a wide range of QBF instances.
منابع مشابه
Symmetry Breaking in Quantified Boolean Formulae
Many reasoning task and combinatorial problems exhibit symmetries. Exploiting such symmetries has been proved to be very important in reducing search efforts. Breaking symmetries using additional constraints is currently one of the most used approaches. Extending such symmetry breaking techniques to quantified boolean formulae (QBF) is a very challenging task. In this paper, an approach to brea...
متن کاملDealing with Symmetries in Quantified Boolean Formulas
Many reasoning task and combinatorial problems exhibit symmetries. Exploiting symmetries has been proved very important in reducing search efforts. This important task is widely investigated in constraint satisfaction problems and satisfiability of boolean formulas. In this paper, we show how symmetries can be naturally extended to Quantified Boolean Formulas (QBFs). A symmetries detection algo...
متن کاملSymmetry Breaking Predicates for SAT-based DFA Identification
It was shown before that the NP-hard problem of deterministic finite automata (DFA) identification can be effectively translated to Boolean satisfiability (SAT). Modern SAT-solvers can tackle hard DFA identification instances efficiently. We present a technique to reduce the problem search space by enforcing an enumeration of DFA states in depth-first search (DFS) or breadth-first search (BFS) ...
متن کاملSpeeding up SAT solver by exploring CNF symmetries : Revisited
Boolean Satisfiability solvers have gone through dramatic improvements in their performances and scalability over the last few years by considering symmetries. It has been shown that by using graph symmetries and generating symmetry breaking predicates (SBPs) it is possible to break symmetries in Conjunctive Normal Form (CNF). The SBPs cut down the search space to the nonsymmetric regions of th...
متن کاملSymmetries of Quantified Boolean Formulas
While symmetries are well understood for Boolean formulas and successfully exploited in practical SAT solving, less is known about symmetries in quantified Boolean formulas (QBF). There are some works introducing adaptions of propositional symmetry breaking techniques, with a theory covering only very specific parts of QBF symmetries. We present a general framework that gives a concise characte...
متن کامل