On the public citation graph
DepQBF: A Dependency-Aware QBF Solver
0 signed · 140 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1995.1025openalex-snapshot
Resolution for Quantified Boolean Formulas
inferredcites →https://doi.org/10.1007/3-540-45616-3_12openalex-snapshot
Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas
inferredcites →https://doi.org/10.1007/3-540-46135-3_14openalex-snapshot
Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation
inferredcites →https://doi.org/10.1007/978-1-4020-5571-3_2openalex-snapshot
Heuristic-Based Backtracking Relaxation for Propositional Satisfiability
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_3openalex-snapshot
Watched Data Structures for QBF Solvers
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_37openalex-snapshot
An Extensible SAT-solver
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_21openalex-snapshot
Monotone Literals and Learning in QBF Reasoning
inferredcites →https://doi.org/10.1007/978-3-540-72788-0_23openalex-snapshot
Backdoor Sets of Quantified Boolean Formulas
inferredcites →https://doi.org/10.1007/978-3-540-72788-0_28openalex-snapshot
A Lightweight Component Caching Scheme for Satisfiability Solvers
inferredcites →https://doi.org/10.1007/978-3-642-02777-2_37openalex-snapshot
A Compact Representation for Syntactic Dependencies in QBFs
inferredcites →https://doi.org/10.1007/978-3-642-14186-7_14openalex-snapshot
Integrating Dependency Schemes in Search-Based QBF Solvers
inferredcites →https://doi.org/10.1007/978-3-642-14186-7_6openalex-snapshot
Automated Testing and Debugging of SAT and QBF Solvers
inferredcites →https://doi.org/10.1007/s10817-005-9005-yopenalex-snapshot
Heuristic-Based Backtracking Relaxation for Propositional Satisfiability
inferredcites →https://doi.org/10.1007/s10817-008-9114-5openalex-snapshot
Backdoor Sets of Quantified Boolean Formulas
inferredcites →https://doi.org/10.1109/dac.2001.935565openalex-snapshot
Chaff: engineering an efficient SAT solver
inferredcites →https://doi.org/10.1109/date.2002.998262openalex-snapshot
BerkMin: A fast and robust SAT-solver
inferredcites →https://doi.org/10.1109/tcad.2006.888264openalex-snapshot
Quantifier Structure in Search-Based Procedures for QBFs
inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
inferredcites →https://doi.org/10.1613/jair.1959openalex-snapshot
Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas
inferredcites →https://doi.org/10.3233/sat190061openalex-snapshot
HaifaSat: a SAT solver based on an Abstraction/Refinement model
inferredcites →https://doi.org/10.5555/777092.777192openalex-snapshot
Learning for quantified boolean logic satisfiability
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-25543-5_6openalex-snapshot
Incremental Determinization for Quantifier Elimination and Functional Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-030-30048-7_31openalex-snapshot
A Cube Distribution Approach to QBF Solving and Certificate Minimization
inferred← citeshttps://doi.org/10.1007/978-3-030-80223-3_28openalex-snapshot
Proof Complexity of Symbolic QBF Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-030-86044-8_10openalex-snapshot
Updating Service-Based Software Systems in Air-Gapped Environments
inferred← citeshttps://doi.org/10.1007/978-3-030-89188-6_36openalex-snapshot
Adaptive Relaxations for Multistage Robust Optimization
inferred← citeshttps://doi.org/10.1007/978-3-031-76554-4_16openalex-snapshot
PyQBF: A Python Framework for Solving Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1007/978-3-031-89610-1_7openalex-snapshot
Bounded Henkin Quantifiers and the Exponential Time Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-319-06200-6_23openalex-snapshot
A Synthesized Algorithm for Interactive Consistency
inferred← citeshttps://doi.org/10.1007/978-3-319-08587-6_7openalex-snapshot
A Unified Proof System for QBF Preprocessing
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_12openalex-snapshot
QBF Resolution Systems and Their Proof Complexities
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_32openalex-snapshot
MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing
inferred← citeshttps://doi.org/10.1007/978-3-319-23506-6_15openalex-snapshot
Bounded Synthesis for Petri Games
inferred← citeshttps://doi.org/10.1007/978-3-319-24318-4_25openalex-snapshot
QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-40970-2_25openalex-snapshot
On Q-Resolution and CDCL QBF Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-40970-2_28openalex-snapshot
2QBF: Challenges and Solutions
inferred← citeshttps://doi.org/10.1007/978-3-319-40970-2_33openalex-snapshot
HordeQBF: A Modular and Massively Parallel QBF Solver
inferred← citeshttps://doi.org/10.1007/978-3-319-41528-4_6openalex-snapshot
Structural Synthesis for GXW Specifications
inferred← citeshttps://doi.org/10.1007/978-3-319-46520-3_25openalex-snapshot
Skolem Functions for DQBF
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_17openalex-snapshot
BoSy: An Experimentation Framework for Bounded Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_25openalex-snapshot
On Expansion and Resolution in CEGAR Based QBF Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_4openalex-snapshot
Parallel Solving of Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1007/978-3-319-66263-3_20openalex-snapshot
A Resolution-Style Proof System for DQBF
inferred← citeshttps://doi.org/10.1007/978-3-319-66263-3_21openalex-snapshot
From DQBF to QBF by Dependency Elimination
inferred← citeshttps://doi.org/10.1007/978-3-319-67295-3_7openalex-snapshot
Analysis of Incomplete Circuits Using Dependency Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1007/978-3-319-67549-7_14openalex-snapshot
Homing Sequence Derivation with Quantified Boolean Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_1openalex-snapshot
Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_14openalex-snapshot
Local Soundness for QBF Calculi
inferred← citeshttps://doi.org/10.1007/978-3-319-96142-2_17openalex-snapshot
Understanding and Extending Incremental Determinization for 2QBF
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_14openalex-snapshot
Integrating Dependency Schemes in Search-Based QBF Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_21openalex-snapshot
Failed Literal Detection for QBF
inferred← citeshttps://doi.org/10.1007/978-3-642-22438-6_10openalex-snapshot
Blocked Clause Elimination for QBF
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_51openalex-snapshot
A More Efficient BDD-Based QBF Solver
inferred← citeshttps://doi.org/10.1007/978-3-642-24372-1_14openalex-snapshot
Antichain-Based QBF Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_10openalex-snapshot
Solving QBF with Counterexample Guided Refinement
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_4openalex-snapshot
Off the Trail: Re-examining the CDCL Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_48openalex-snapshot
Single-Solver Algorithms for 2QBF
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_7openalex-snapshot
On Propositional QBF Expansions and Q-Resolution
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_8openalex-snapshot
Recovering and Utilizing Partial Duality in QBF
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_9openalex-snapshot
Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_21openalex-snapshot
Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-54013-4_1openalex-snapshot
SAT-Based Synthesis Methods for Safety Specs
inferred← citeshttps://doi.org/10.1007/978-3-642-54833-8_2openalex-snapshot
Application-Scale Secure Multiparty Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-54862-8_6openalex-snapshot
Detecting Unrealizable Specifications of Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-44199-2_48openalex-snapshot
Incremental QBF Solving by DepQBF
inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_8openalex-snapshot
On Unification of QBF Resolution-Based Calculi
inferred← citeshttps://doi.org/10.1007/s00236-019-00357-3openalex-snapshot
A formal methods approach to predicting new features of the eukaryotic vesicle traffic system
inferred← citeshttps://doi.org/10.1007/s10817-016-9390-4openalex-snapshot
Solution Validation and Extraction for QBF Preprocessing
inferred← citeshttps://doi.org/10.1007/s10817-018-9482-4openalex-snapshot
Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF
inferred← citeshttps://doi.org/10.1007/s10817-024-09707-4openalex-snapshot
Dependency Schemes in CDCL-Based QBF Solving: A Proof-Theoretic Study
inferred← citeshttps://doi.org/10.1016/j.artint.2010.06.003openalex-snapshot
Logic-based ontology comparison and module extraction, with an application to DL-Lite
inferred← citeshttps://doi.org/10.1016/j.artint.2016.01.004openalex-snapshot
Solving QBF with counterexample guided refinement
inferred← citeshttps://doi.org/10.1016/j.artint.2019.04.002openalex-snapshot
The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.048openalex-snapshot
Expansion-based QBF solving versus Q-resolution
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.03.029openalex-snapshot
Solving dependency quantified Boolean formulas using quantifier localization
inferred← citeshttps://doi.org/10.1063/1.5081590openalex-snapshot
Methods and tools of synthesis for linear regulator in binary dynamic systems: A logical approach
inferred← citeshttps://doi.org/10.1063/5.0278488openalex-snapshot
Qualitative analysis of the dynamics of asynchronous Boolean networks with control of update scheme for state variables
inferred← citeshttps://doi.org/10.1063/5.0278496openalex-snapshot
Dynamics and control in singular logical networks
inferred← citeshttps://doi.org/10.1109/fmcad.2014.6987592openalex-snapshot
SAT-based methods for circuit synthesis
inferred← citeshttps://doi.org/10.1109/fmcad.2014.6987599openalex-snapshot
Template-based circuit understanding
inferred← citeshttps://doi.org/10.1109/fmcad.2015.7542263openalex-snapshot
CAQE: A Certifying QBF Solver
inferred← citeshttps://doi.org/10.1109/hst.2013.6581568openalex-snapshot
WordRev: Finding word-level structures in a sea of bit-level gates
inferred← citeshttps://doi.org/10.1109/iccad.2015.7372652openalex-snapshot
Property-directed synthesis of reactive systems from safety specifications
inferred← citeshttps://doi.org/10.1109/icnp.2012.6459944openalex-snapshot
Verification and synthesis of firewalls using SAT and QBF
inferred← citeshttps://doi.org/10.1109/mtv.2013.11openalex-snapshot
Proving QBF-hardness in Bounded Model Checking for Incomplete Designs
inferred← citeshttps://doi.org/10.1109/synasc.2016.038openalex-snapshot
A Duality-Aware Calculus for Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1109/synasc57785.2022.00022openalex-snapshot
FERPModels: A Certification Framework for Expansion-Based QBF Solving
inferred← citeshttps://doi.org/10.1109/tc.2021.3058302openalex-snapshot
Homing Sequence Derivation With Quantified Boolean Satisfiability
inferred← citeshttps://doi.org/10.1109/tcad.2013.2276395openalex-snapshot
Software Workarounds for Hardware Errors: Instruction Patch Synthesis
inferred← citeshttps://doi.org/10.1109/tcad.2015.2512906openalex-snapshot
Flexibility and Optimization of QBF Skolem–Herbrand Certificates
inferred← citeshttps://doi.org/10.1109/tcad.2022.3198260openalex-snapshot
Everything You Always Wanted to Know About Generalization of Proof Obligations in PDR
inferred← citeshttps://doi.org/10.1109/tetc.2013.2294918openalex-snapshot
Reverse Engineering Digital Circuits Using Structural and Functional Analyses
inferred← citeshttps://doi.org/10.1145/2661632openalex-snapshot
Synthesizing Optimal Switching Lattices
inferred← citeshttps://doi.org/10.1145/2818646openalex-snapshot
Backdoors to Normality for Disjunctive Logic Programs
inferred← citeshttps://doi.org/10.1145/3157053openalex-snapshot
Are Short Proofs Narrow? QBF Resolution Is Not So Simple
inferred← citeshttps://doi.org/10.1145/3355995openalex-snapshot
Dynamic QBF Dependencies in Reduction and Expansion
inferred← citeshttps://doi.org/10.1145/3698038.3698551openalex-snapshot
Cloud-native Workflow Scheduling using a Hybrid Priority Rule, Dynamic Resource Allocation, and Dynamic Task Partition
inferred← citeshttps://doi.org/10.1145/3779651openalex-snapshot
PyQBF: A Python Framework for Solving Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1155/2022/9013361openalex-snapshot
DAG Scheduling with Communication Delays Based on Graph Convolutional Neural Network
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9750openalex-snapshot
Efficient Extraction of QBF (Counter)models from Long-Distance Resolution Proofs
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.10682openalex-snapshot
Solving Advanced Argumentation Problems with Answer-Set Programming
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.12208openalex-snapshot
Towards Generalization in QBF Solving via Machine Learning
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33011584openalex-snapshot
A PSPACE Subclass of Dependency Quantified Boolean Formulas and Its Effective Solving
inferred← citeshttps://doi.org/10.1613/jair.4694openalex-snapshot
Clause Elimination for SAT and QSAT
inferred← citeshttps://doi.org/10.21236/ada623698openalex-snapshot
Formal Methods for Reverse Engineering Gate-Level Netlists
inferred← citeshttps://doi.org/10.2168/lmcs-11(3:12)2015openalex-snapshot
Detecting Unrealizability of Distributed Fault-tolerant Systems
inferred← citeshttps://doi.org/10.23919/date56975.2023.10137282openalex-snapshot
Synthesis with Explicit Dependencies
inferred← citeshttps://doi.org/10.23919/fmcad.2019.8894269openalex-snapshot
Localizing Quantifiers for DQBF
inferred← citeshttps://doi.org/10.23919/mipro.2019.8757154openalex-snapshot
Multiagent Technology for Parallel Implementation of Boolean Constraint Method for Qualitative Analysis of Binary Dynamic Systems
inferred← citeshttps://doi.org/10.23919/mipro52101.2021.9596697openalex-snapshot
Classification in Binary Feature Space Using Logical Dynamic Models
inferred← citeshttps://doi.org/10.23919/mipro52101.2021.9597079openalex-snapshot
Service-oriented Application for Solving Parametric Synthesis Problem of a Boolean Network with Given Dynamic Properties
inferred← citeshttps://doi.org/10.24963/ijcai.2021/261openalex-snapshot
Program Synthesis as Dependency Quantified Formula Modulo Theory
inferred← citeshttps://doi.org/10.29007/2b5dopenalex-snapshot
qbf2epr: A Tool for Generating EPR Formulas from QBF
inferred← citeshttps://doi.org/10.3233/978-1-61499-098-7-217openalex-snapshot
Planning as Quantified Boolean Formula
inferred← citeshttps://doi.org/10.3233/aic-140633openalex-snapshot
Verification of partial designs using incremental QBF
inferred← citeshttps://doi.org/10.3233/fi-2016-1445openalex-snapshot
Twelve Years of QBF Evaluations: QSAT Is PSPACE-Hard and It Shows
inferred← citeshttps://doi.org/10.3233/sat190108openalex-snapshot
QBF Gallery 2014: The QBF Competition at the FLoC 2014 Olympic Games
inferred← citeshttps://doi.org/10.3233/sat190121openalex-snapshot
CAQE and QuAbS: Abstraction Based QBF Solvers
inferred← citeshttps://doi.org/10.3233/sat190122openalex-snapshot
QBFRelay, QRATPre+, and DepQBF: Incremental Preprocessing Meets Search-Based QBF Solving
inferred← citeshttps://doi.org/10.4204/eptcs.157.5openalex-snapshot
Synthesis of a simple self-stabilizing system
inferred← citeshttps://doi.org/10.4230/lipics.sat.2022.10openalex-snapshot
QFUN: Towards Machine Learning in QBF
inferred← citeshttps://doi.org/10.48550/arxiv.1311.3530openalex-snapshot
SAT-Based Synthesis Methods for Safety Specs
inferred← citeshttps://doi.org/10.48550/arxiv.1604.06204openalex-snapshot
Satisfiability-Based Methods for Reactive Synthesis from Safety Specifications
inferred← citeshttps://doi.org/10.48550/arxiv.1612.07601openalex-snapshot
Counting Answer Sets via Dynamic Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1702.02890openalex-snapshot
Answer Set Solving with Bounded Treewidth Revisited
inferred← citeshttps://doi.org/10.48550/arxiv.1803.09566openalex-snapshot
BoSy: An Experimentation Framework for Bounded Synthesis
inferred← citeshttps://doi.org/10.48550/arxiv.1905.13411openalex-snapshot
Understanding and Extending Incremental Determinization for 2QBF
inferred← citeshttps://doi.org/10.48550/arxiv.2608.14274openalex-snapshot
Solving QBF by Clause Selection
inferred← citeshttps://doi.org/10.5555/2485288.2485484openalex-snapshot
Bridging the gap between dual propagation and CNF-based QBF solving
inferred← citeshttps://doi.org/10.5555/2616606.2616790openalex-snapshot
Partial witnesses from preprocessed quantified Boolean formulas
inferred← citeshttps://doi.org/10.5555/2682923.2682943openalex-snapshot
Template-based circuit understanding
inferred← citeshttps://doi.org/10.5555/2755753.2757188openalex-snapshot
Solving DQBF through quantifier elimination
inferred← citeshttps://doi.org/10.7873/date.2013.172openalex-snapshot
Bridging the Gap between Dual Propagation and CNF-based QBF Solving
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.