Transforming quantified Boolean formulas using biclique covers
From MaRDI portal
Publication:6536143
DOI10.1007/978-3-031-30820-8_23zbMATH Open1547.68529MaRDI QIDQ6536143
Publication date: 5 April 2024
preprocessingconflict graphminimal unsatisfiabilityDQBFQBF solvingHorn clause sets2QCNFbiclique cover problem
Graph theory (including graph drawing) in computer science (68R10) Computational aspects of satisfiability (68R07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Covering graphs with few complete bipartite subgraphs
- Proof of the squashed cube conjecture
- Bipartite dimensions and bipartite degrees of graphs
- An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
- Davis and Putnam meet Henkin: solving DQBF with resolution
- Clausal abstraction for DQBF
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
- Efficient approximation for restricted biclique cover problems
- The biclique covering number of grids
- DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
- Incremental Determinization
- 2QBF: Challenges and Solutions
- On the Parameterized Complexity of Biclique Cover and Partition
- sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning
- Theory and Applications of Satisfiability Testing
- On the Addressing Problem for Loop Switching
- Theory and Applications of Satisfiability Testing
- Understanding and extending incremental determinization for 2QBF
This page was built for publication: Transforming quantified Boolean formulas using biclique covers
