Nenofex

swMATH9579MaRDI QIDQ21560FDOQ21560

Author name not available (Why is that?)

Described by source

• Nenofex: Expanding NNF for QBF Solving

Cited In (17)

• Solving QBF with counterexample guided refinement
• Conformant planning as a case study of incremental QBF solving
• The Seventh QBF Solvers Evaluation (QBFEVAL’10)
• Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers
• Dependency learning for QBF
• sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning
• Expansion-based QBF solving versus Q-resolution
• Exploiting Circuit Representations in QBF Solving
• Non-prenex QBF Solving Using Abstraction
• Blocked Clause Elimination for QBF
• Solving QBF with Counterexample Guided Refinement
• Failed Literal Detection for QBF
• A Unified Framework for Certificate and Compilation for QBF
• On QBF Proofs and Preprocessing
• Incremental Determinization
• Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
• A Non-prenex, Non-clausal QBF Solver with Game-State Learning

This page was built for software: Nenofex