On the public citation graph

Implementing Efficient All Solutions SAT Solvers

0 signed · 96 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.1002/j.1538-7305.1959.tb01585.xopenalex-snapshot
Representation of Switching Circuits by Binary-Decision Programs
inferredcites →https://doi.org/10.1007/11527695_13openalex-snapshot
Using DPLL for Efficient OBDD Construction
inferredcites →https://doi.org/10.1007/11564751_73openalex-snapshot
Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
inferredcites →https://doi.org/10.1007/11814948_38openalex-snapshot
sharpSAT – Counting Models with Advanced Component Caching and Implicit BCP
inferredcites →https://doi.org/10.1007/11817963_39openalex-snapshot
SMT Techniques for Fast Predicate Abstraction
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_3openalex-snapshot
Minimal Assignments for Bounded Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-31980-1_19openalex-snapshot
Efficient Conflict Analysis for Finding All Satisfying Assignments of a Boolean Circuit
inferredcites →https://doi.org/10.1007/978-3-642-01929-6_7openalex-snapshot
Solution Enumeration for Projected Boolean Search Problems
inferredcites →https://doi.org/10.1007/s10472-016-9520-zopenalex-snapshot
Dualization of boolean functions using ternary decision diagrams
inferredcites →https://doi.org/10.1007/s10618-006-0059-1openalex-snapshot
Frequent pattern mining: current status and future directions
inferredcites →https://doi.org/10.1007/s10817-016-9370-8openalex-snapshot
On Preprocessing Techniques and Their Impact on Propositional Model Counting
inferredcites →https://doi.org/10.1016/j.artint.2011.05.002openalex-snapshot
Itemset mining: A constraint programming perspective
inferredcites →https://doi.org/10.1016/j.dam.2007.04.017openalex-snapshot
Computational aspects of monotone dualization: A brief survey
inferredcites →https://doi.org/10.1016/j.dam.2014.01.012openalex-snapshot
Efficient algorithms for dualizing large-scale hypergraphs
inferredcites →https://doi.org/10.1016/s0004-3702(02)00120-0openalex-snapshot
Backjump-based backtracking for constraint satisfaction problems
inferredcites →https://doi.org/10.1023/b:form.0000040025.89719.f3openalex-snapshot
Predicate Abstraction of ANSI-C Programs Using SAT
inferredcites →https://doi.org/10.1090/dimacs/026openalex-snapshot
Cliques, Coloring, and Satisfiability
inferredcites →https://doi.org/10.1109/12.769433openalex-snapshot
GRASP: a search algorithm for propositional satisfiability
inferredcites →https://doi.org/10.1109/comst.2014.2345792openalex-snapshot
Applying Formal Methods to Networking: Theory, Techniques, and Applications
inferredcites →https://doi.org/10.1109/hldvt.2009.5340173openalex-snapshot
TG-PRO: A new model for SAT-based ATPG
inferredcites →https://doi.org/10.1109/iccad.2004.1382631openalex-snapshot
Efficient SAT-based unbounded symbolic model checking using circuit cofactoring
inferredcites →https://doi.org/10.1109/iri.2014.7051971openalex-snapshot
Extending modern SAT solvers for models enumeration
inferredcites →https://doi.org/10.1109/tc.1978.1675141openalex-snapshot
Binary Decision Diagrams
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1109/tcad.2004.841068openalex-snapshot
SAT-based unbounded symbolic model checking
inferredcites →https://doi.org/10.1109/tsg.2013.2288976openalex-snapshot
Distribution Loss Minimization With Guaranteed Error Bound
inferredcites →https://doi.org/10.1109/tsg.2014.2359114openalex-snapshot
Distribution Network Verification for Secure Restoration by Enumerating All Critical Failures
inferredcites →https://doi.org/10.1109/vlsid.2014.22openalex-snapshot
All-SAT Using Minimal Blocking Clauses
inferredcites →https://doi.org/10.1111/j.1467-8640.1993.tb00310.xopenalex-snapshot
HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM
inferredcites →https://doi.org/10.1145/1065579.1065775openalex-snapshot
Prime clauses for fast enumeration of satisfying assignments to boolean circuits
inferredcites →https://doi.org/10.1145/1536616.1536637openalex-snapshot
Boolean satisfiability from theoretical hardness to practical success
inferredcites →https://doi.org/10.1145/170036.170072openalex-snapshot
Mining association rules between sets of items in large databases
inferredcites →https://doi.org/10.1145/1714450.1714452openalex-snapshot
Formula Caching in DPLL
inferredcites →https://doi.org/10.1145/2505515.2505577openalex-snapshot
Boolean satisfiability for sequence mining
inferredcites →https://doi.org/10.1145/2695664.2695941openalex-snapshot
BDD construction for all solutions SAT and efficient caching mechanism
inferredcites →https://doi.org/10.1145/502090.502091openalex-snapshot
Decomposable negation normal form
inferredcites →https://doi.org/10.1287/ijoc.2015.0648openalex-snapshot
Discrete Optimization with Decision Diagrams
inferredcites →https://doi.org/10.3217/jucs-010-12-1562openalex-snapshot
MINCE: A Static Global Variable-Ordering Heuristic for SAT Search and BDD Manipulation
inferredcites →https://doi.org/10.5555/1622606.1622613openalex-snapshot
The language of search
inferredcites →https://doi.org/10.5555/789083.1022826openalex-snapshot
Efficient Preimage Computation Using A Novel Success-Driven ATPG

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-30048-7_29openalex-snapshot
An Improved GPU-Based SAT Model Counter
inferred← citeshttps://doi.org/10.1007/978-3-030-39197-3_10openalex-snapshot
Exploiting Database Management Systems and Treewidth for Counting
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_25openalex-snapshot
Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_5openalex-snapshot
Four Flavors of Entailment
inferred← citeshttps://doi.org/10.1007/978-3-031-31476-6_10openalex-snapshot
SMT-Based Test-Case Generation and Validation for Programs with Complex Specifications
inferred← citeshttps://doi.org/10.1007/978-3-031-42697-1_12openalex-snapshot
SAF: SAT-Based Attractor Finder in Asynchronous Automata Networks
inferred← citeshttps://doi.org/10.1007/978-3-032-04167-8_7openalex-snapshot
Exploiting Partial-Assignment Enumeration in Optimization Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-032-05073-1_26openalex-snapshot
Timed Models in AltaRica 3.0
inferred← citeshttps://doi.org/10.1007/s10208-018-9396-xopenalex-snapshot
The Geometry of Gaussoids
inferred← citeshttps://doi.org/10.1007/s10472-023-09906-6openalex-snapshot
On the benefits of knowledge compilation for feature-model analyses
inferred← citeshttps://doi.org/10.1007/s11390-022-1981-4openalex-snapshot
A Semi-Tensor Product Based All Solutions Boolean Satisfiability Solver
inferred← citeshttps://doi.org/10.1016/j.artint.2025.104346openalex-snapshot
Disjoint projected enumeration for SAT and SMT without blocking clauses
inferred← citeshttps://doi.org/10.1016/j.comgeo.2021.101770openalex-snapshot
Faradžev Read-type enumeration of non-isomorphic CC systems
inferred← citeshttps://doi.org/10.1016/j.dam.2024.10.006openalex-snapshot
Self-adhesivity in lattices of abstract conditional independence models
inferred← citeshttps://doi.org/10.1016/j.ijar.2023.109027openalex-snapshot
Selfadhesivity in Gaussian conditional independence structures
inferred← citeshttps://doi.org/10.1016/j.jss.2023.111920openalex-snapshot
Design, implementation, and validation of a benchmark generator for combinatorial interaction testing tools
inferred← citeshttps://doi.org/10.1016/j.laa.2026.02.029openalex-snapshot
Sign patterns of principal minors of real symmetric matrices
inferred← citeshttps://doi.org/10.1017/s147106842100003xopenalex-snapshot
Exploiting Database Management Systems and Treewidth for Counting
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/compcomm.2018.8780746openalex-snapshot
A Divide and Conquer Approach to All Solutions Satisfiability Problem
inferred← citeshttps://doi.org/10.1109/dac56929.2023.10248001openalex-snapshot
On EDA-Driven Learning for SAT Solving
inferred← citeshttps://doi.org/10.1109/ddecs.2018.00028openalex-snapshot
Augmenting All Solution SAT Solving for Circuits with Structural Information
inferred← citeshttps://doi.org/10.1109/iccad51958.2021.9643520openalex-snapshot
An Efficient Two-phase Method for Prime Compilation of Non-clausal Boolean Formulae
inferred← citeshttps://doi.org/10.1109/iccad66269.2025.11240928openalex-snapshot
CoP&R: Co-Optimizing Place-and-Route for Standard Cell Layout via MCTS and AllSAT
inferred← citeshttps://doi.org/10.1109/icdmw.2018.00175openalex-snapshot
Closed Frequent Itemset Mining with Arbitrary Side Constraints
inferred← citeshttps://doi.org/10.1109/ictai50040.2020.00033openalex-snapshot
Abacus: A New Hybrid Encoding for SAT Problems
inferred← citeshttps://doi.org/10.1109/mipro60963.2024.10569248openalex-snapshot
Dynamics of Bipartite Logical Networks
inferred← citeshttps://doi.org/10.1109/tdsc.2024.3524128openalex-snapshot
Cross-Level Security Verification for Network Functions Virtualization (NFV)
inferred← citeshttps://doi.org/10.1109/tifs.2021.3125242openalex-snapshot
In Praise of Exact-Functional-Secrecy in Circuit Locking
inferred← citeshttps://doi.org/10.1109/tr.2020.3014012openalex-snapshot
SATMCS: An Efficient SAT-Based Algorithm and Its Improvements for Computing Minimal Cut Sets
inferred← citeshttps://doi.org/10.1109/tse.2026.3696093openalex-snapshot
Tackling Expressive Feature-Modeling Constructs With Pseudo-Boolean d-DNNF Compilation
inferred← citeshttps://doi.org/10.1145/3106237.3106273openalex-snapshot
Finding near-optimal configurations in product lines by random sampling
inferred← citeshttps://doi.org/10.1145/3324884.3416569openalex-snapshot
Accelerating all-SAT computation with short blocking clauses
inferred← citeshttps://doi.org/10.1145/3377024.3377025openalex-snapshot
Evaluating #SAT solvers on industrial feature models
inferred← citeshttps://doi.org/10.1145/3442391.3442404openalex-snapshot
Applications of #SAT Solvers on Feature Models
inferred← citeshttps://doi.org/10.1145/3510003.3510077openalex-snapshot
Refty
inferred← citeshttps://doi.org/10.1145/3540250.3549161openalex-snapshot
SymMC: approximate model enumeration and counting using symmetry information for Alloy specifications
inferred← citeshttps://doi.org/10.1145/3571306.3571388openalex-snapshot
Invited Paper: Fault-tolerant and Expressive Cross-Chain Swaps
inferred← citeshttps://doi.org/10.1145/3639475.3640097openalex-snapshot
Greening Large Language Models of Code
inferred← citeshttps://doi.org/10.1145/3649476.3658705openalex-snapshot
On Hardware Trojan Detection using Oracle-Guided Circuit Learning
inferred← citeshttps://doi.org/10.1371/journal.pone.0227745openalex-snapshot
Error metrics determination in functionally approximated circuits using SAT solvers
inferred← citeshttps://doi.org/10.21468/scipostphys.7.5.060openalex-snapshot
Fast counting with tensor networks
inferred← citeshttps://doi.org/10.2197/ipsjjip.25.459openalex-snapshot
Exploiting Functional Dependencies of Variables in All Solutions SAT Solvers
inferred← citeshttps://doi.org/10.2197/ipsjjip.29.630openalex-snapshot
Interval-based Counterexample Analysis for Error Explanation
inferred← citeshttps://doi.org/10.23919/mipro48935.2020.9245400openalex-snapshot
HPC-based parallel software for solving applied Boolean satisfiability problems
inferred← citeshttps://doi.org/10.23919/mipro48935.2020.9245421openalex-snapshot
A Different Approach for Clique and Household Analysis in Synthetic Telecom Data Using Propositional Logic
inferred← citeshttps://doi.org/10.23919/mipro52101.2021.9596697openalex-snapshot
Classification in Binary Feature Space Using Logical Dynamic Models
inferred← citeshttps://doi.org/10.24963/ijcai.2022/259openalex-snapshot
AllSATCC: Boosting AllSAT Solving with Efficient Component Analysis
inferred← citeshttps://doi.org/10.3233/faia200110openalex-snapshot
Exploiting Incomparability in Solution Dominance: Improving General Purpose Constraint-Based Mining
inferred← citeshttps://doi.org/10.3390/mi15010085openalex-snapshot
Logical Resolving-Based Methodology for Efficient Reliability Analysis
inferred← citeshttps://doi.org/10.4114/intartif.vol21iss62pp67-74openalex-snapshot
Characterizing and Computing All Delete-Relaxed Dead-ends
inferred← citeshttps://doi.org/10.70675/4fb85f31za938z49f8za956z6c7b002ab6b5openalex-snapshot
Extraction de motifs fréquents sous contraintes
inferred← citeshttps://doi.org/10.70675/8a8c1180zceedz4ab6z895fz48d59e9d97b1openalex-snapshot
Contributions aux approches par contraintes pour la fouille de données
inferred← citeshttps://doi.org/10.70675/a52c999az4bc6z429eza297z0a41883df006openalex-snapshot
Etude des Mécanismes de Transformation de Modèles CSP/SAT
inferred← citeshttps://doi.org/10.70675/cf0edb8dz0512z4aeez99adzaaa58c3e2721openalex-snapshot
Declarative Approaches for Mining Frequent Itemsets over Transactional Databases
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.