On the public citation graph

QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency

https://doi.org/10.1007/11814948_35
0 signed · 48 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11527695_5openalex-snapshot
Resolve and Expand
inferredcites →https://doi.org/10.1007/11532231_27openalex-snapshot
sKizzo: A Suite to Evaluate and Certify QBFs
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-45653-8_25openalex-snapshot
Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae
inferredcites →https://doi.org/10.1007/3-540-45744-5_27openalex-snapshot
QuBE: A System for Deciding Quantified Boolean Formulas Satisfiability
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.1016/s1571-0661(05)82544-7openalex-snapshot
Symbolic Computational Techniques for Solving Games
inferredcites →https://doi.org/10.1023/a:1015019416843openalex-snapshot
An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation
inferredcites →https://doi.org/10.1142/9789812810403_0001openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/774572.774637openalex-snapshot
Conflict driven learning in a quantified Boolean Satisfiability solver
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)
inferredcites →https://doi.org/10.1613/jair.591openalex-snapshot
Constructing Conditional Plans by a Theorem-Prover

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-319-08867-9_35openalex-snapshot
Solving Games without Controllable Predecessor
inferred← citeshttps://doi.org/10.1007/978-3-319-40970-2_23openalex-snapshot
Incremental Determinization
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_13openalex-snapshot
Symmetries of Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_23openalex-snapshot
Backdoor Sets of Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1007/978-3-540-74105-3openalex-snapshot
Decision Procedures: An Algorithmic Point of View
inferred← citeshttps://doi.org/10.1007/978-3-540-79719-7_19openalex-snapshot
Nenofex: Expanding NNF for QBF Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_36openalex-snapshot
Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_38openalex-snapshot
Beyond CNF: A Circuit-Based QBF Solver
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_12openalex-snapshot
A Non-prenex, Non-clausal QBF Solver with Game-State Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_7openalex-snapshot
Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_15openalex-snapshot
Backdoors to Satisfaction
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_51openalex-snapshot
Primal and Dual Encoding from Applications into Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1007/s10601-008-9055-yopenalex-snapshot
A solver for QBFs in negation normal form
inferred← citeshttps://doi.org/10.1007/s10817-008-9114-5openalex-snapshot
Backdoor Sets of Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.12.005openalex-snapshot
Using decomposition-parameters for QBF: Mind the prefix!
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03002-7openalex-snapshot
Chapter 2 Satisfiability Solvers
inferred← citeshttps://doi.org/10.1109/date.2008.4484892openalex-snapshot
On Automated Trigger Event Generation in Post-Silicon Validation
inferred← citeshttps://doi.org/10.1109/date.2010.5457088openalex-snapshot
Leveraging dominators for preprocessing QBF
inferred← citeshttps://doi.org/10.1109/fmcad11703.2006openalex-snapshot
2006 Formal Methods in Computer Aided Design
inferred← citeshttps://doi.org/10.1109/fmcad16015.2009openalex-snapshot
2009 Formal Methods in Computer-Aided Design
inferred← citeshttps://doi.org/10.1109/ictai.2014.135openalex-snapshot
The Cut Tool for QCSP
inferred← citeshttps://doi.org/10.1109/tc.2011.192openalex-snapshot
Mapping Trigger Conditions onto Trigger Units during Post-silicon Validation and Debugging
inferred← citeshttps://doi.org/10.1145/1403375.1403437openalex-snapshot
On automated trigger event generation in post-silicon validation
inferred← citeshttps://doi.org/10.1609/aaai.v24i1.7548openalex-snapshot
Exploiting QBF Duality on a Circuit Representation
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9752openalex-snapshot
SAT-Based Strategy Extraction in Reachability Games
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10113openalex-snapshot
Using Decomposition-Parameters for QBF: Mind the Prefix!
inferred← citeshttps://doi.org/10.1613/jair.4694openalex-snapshot
Clause Elimination for SAT and QSAT
inferred← citeshttps://doi.org/10.3166/ria.31.337-365openalex-snapshot
Le problème de satisfaction de contraintes quantifiées et les jeux à deux joueurs à horizon fini : le projet QuaCod
inferred← citeshttps://doi.org/10.3233/fi-2011-398openalex-snapshot
Parallel QBF Solving with Advanced Knowledge Sharing
inferred← citeshttps://doi.org/10.3233/sat190055openalex-snapshot
QBF-Based Formal Verification: Experience and Perspectives
inferred← citeshttps://doi.org/10.3233/sat190092openalex-snapshot
Encoding Nested Boolean Functions as Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.5555/1870926.1871338openalex-snapshot
Leveraging dominators for preprocessing QBF
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.5958/j.0975-8070.3.3.014openalex-snapshot
Computational Analysis of Logic Gates and Circuits Derived from Gene Systems Using Quantified Boolean Formula Methodology in CNF Format
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.