On the public citation graph

Improving backtrack search for SAT by means of redundancy

https://doi.org/10.1007/bfb0095116
0 signed · 27 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/bf01531077openalex-snapshot
Solving propositional satisfiability problems
inferredcites →https://doi.org/10.1007/bfb0054253openalex-snapshot
System description: CRIL platform for SAT
inferredcites →https://doi.org/10.1016/0004-3702(95)00046-1openalex-snapshot
Experimental results on the crossover point in random 3-SAT
inferredcites →https://doi.org/10.1016/0166-218x(83)90017-3openalex-snapshot
Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
inferredcites →https://doi.org/10.1016/0304-3975(91)90316-topenalex-snapshot
Probabilistic approach to the satisfiability problem
inferredcites →https://doi.org/10.1023/a:1018999721141openalex-snapshot
Boosting complete techniques thanks to local search methods
inferredcites →https://doi.org/10.1090/dimacs/026openalex-snapshot
Cliques, Coloring, and Satisfiability
inferredcites →https://doi.org/10.1090/dimacs/026/20openalex-snapshot
SAT versus UNSAT
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/48014.48016openalex-snapshot
Many hard examples for resolution
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures

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-642-15396-9_22openalex-snapshot
Diversification and Intensification in Parallel SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-29828-8_15openalex-snapshot
Activity-Based Search for Black-Box Constraint Programming Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-41482-4_3openalex-snapshot
Parallel Tree Search for Satisfiability
inferred← citeshttps://doi.org/10.1007/s10288-011-0191-7openalex-snapshot
Learning from conflicts in propositional satisfiability
inferred← citeshttps://doi.org/10.1007/s10479-015-2028-9openalex-snapshot
What we can learn from conflicts in propositional satisfiability
inferred← citeshttps://doi.org/10.1109/dac.2002.1012719openalex-snapshot
Solving difficult SAT instances in the presence of symmetry
inferred← citeshttps://doi.org/10.1109/ictai.2009.16openalex-snapshot
Local Autarkies Searching for the Dynamic Partition of CNF Formulae
inferred← citeshttps://doi.org/10.1109/tcad.2003.816218openalex-snapshot
Solving difficult instances of boolean satisfiability in the presence of symmetry
inferred← citeshttps://doi.org/10.1145/513918.514102openalex-snapshot
Solving difficult SAT instances in the presence of symmetry
inferred← citeshttps://doi.org/10.3233/sat190070openalex-snapshot
ManySAT: a Parallel SAT Solver
inferred← citeshttps://doi.org/10.70675/07c087ecz3cdbz4a6az8c57z5a437d46aab8openalex-snapshot
Fouille de données par contraintes
inferred← citeshttps://doi.org/10.70675/4a8859a0z611ez41eezbcd9zacdf7026c150openalex-snapshot
Optimisation booléenne multiobjectif : complexité sous contraintes compilées et résolution via SAT
inferred← citeshttps://doi.org/10.70675/5732022dzaf3bz44e9zae98z41d4facf3deaopenalex-snapshot
Contributions à la résolution du problème de la Satisfiabilité Propositionnelle
inferred← citeshttps://doi.org/10.70675/90961a35z8128z45eaz9859z1d246d7621d4openalex-snapshot
Max-résolution et apprentissage pour la résolution du problème de satisfiabilité maximum
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.