On the public citation graph
Branching rules for satisfiability
0 signed · 108 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.1007/bf01531074openalex-snapshot
Branch-and-cut solution of inference problems in propositional logic
inferredcites →https://doi.org/10.1007/bf01531077openalex-snapshot
Solving propositional satisfiability problems
inferredcites →https://doi.org/10.1007/bf01581082openalex-snapshot
A continuous approach to inductive inference
inferredcites →https://doi.org/10.1016/0305-0548(90)90007-topenalex-snapshot
Compact normal forms in propositional logic and integer programming formulations
inferredcites →https://doi.org/10.1016/0743-1066(89)90009-5openalex-snapshot
Algorithms for testing the satisfiability of propositional formulae
inferredcites →https://doi.org/10.1057/jors.1986.93openalex-snapshot
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
inferredcites →https://doi.org/10.1090/dimacs/026/23openalex-snapshot
Efficiency and stability of hypergraph SAT algorithms
inferredcites →https://doi.org/10.1137/1.9781611970074openalex-snapshot
Ten Lectures on the Probabilistic Method
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1287/ijoc.6.4.423openalex-snapshot
A Computational Study of Satisfiability Algorithms for Propositional Logic
inferredcites →https://doi.org/10.1287/mnsc.25.12.1258openalex-snapshot
Controlled Experimental Design for Statistical Comparison of Integer Programming Algorithms
inferredcites →https://doi.org/10.1287/opre.42.2.201openalex-snapshot
Needed: An Empirical Science of Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jsco.1996.0030openalex-snapshot
PSATO: a Distributed Propositional Prover and its Application to Quasigroup Problems
inferred← citeshttps://doi.org/10.1007/11564751_31openalex-snapshot
Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
inferred← citeshttps://doi.org/10.1007/11757283_6openalex-snapshot
Building Efficient Decision Procedures on Top of SAT Solvers
inferred← citeshttps://doi.org/10.1007/11757375_22openalex-snapshot
An Efficient Hybrid Strategy for Temporal Planning
inferred← citeshttps://doi.org/10.1007/3-540-45331-8_25openalex-snapshot
Complexity Issues in the Davis and Putnam Scheme
inferred← citeshttps://doi.org/10.1007/3-540-45349-0_37openalex-snapshot
Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances
inferred← citeshttps://doi.org/10.1007/3-540-45578-7_62openalex-snapshot
Automatic Generation of Implied Clauses for SAT
inferred← citeshttps://doi.org/10.1007/3-540-45620-1_26openalex-snapshot
The Quest for Efficient Boolean Satisfiability Solvers
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_2openalex-snapshot
The Quest for Efficient Boolean Satisfiability Solvers
inferred← citeshttps://doi.org/10.1007/3-540-48159-1_5openalex-snapshot
The Impact of Branching Heuristics in Propositional Satisfiability Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-48238-5_25openalex-snapshot
Systematic vs. Local Search for SAT
inferred← citeshttps://doi.org/10.1007/3-540-48747-6_3openalex-snapshot
A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_13openalex-snapshot
A practical integration of first-order reasoning and decision procedures
inferred← citeshttps://doi.org/10.1007/978-3-319-05443-8_22openalex-snapshot
The Multi-Mode Resource-Constrained Project Scheduling Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-24581-0_9openalex-snapshot
Dynamic Variable Filtering for Hard Random 3-SAT Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-24840-8_20openalex-snapshot
On Selection Strategies for the DPLL Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-28633-2_20openalex-snapshot
Extending Unit Propagation Look-Ahead of DPLL Procedure
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_50openalex-snapshot
Efficient Strategies for (Weighted) Maximum Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-540-76928-6_96openalex-snapshot
Branching Rules for Satisfiability Analysed with Factor Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-79719-7_23openalex-snapshot
How Many Conflicts Does It Need to Be Unsatisfiable?
inferred← citeshttps://doi.org/10.1007/bfb0017450openalex-snapshot
Look-ahead versus look-back for satisfiability problems
inferred← citeshttps://doi.org/10.1007/s10472-005-1809-2openalex-snapshot
A cost-reducing question-selection algorithm for propositional knowledge-based systems
inferred← citeshttps://doi.org/10.1007/s10472-008-9087-4openalex-snapshot
On look-ahead heuristics in disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/s10723-010-9160-1openalex-snapshot
Parallel SAT Solving on Peer-to-Peer Desktop Grids
inferred← citeshttps://doi.org/10.1016/0004-3702(95)00051-8openalex-snapshot
Hard random 3-SAT problems and the Davis-Putnam procedure
inferred← citeshttps://doi.org/10.1016/j.artint.2005.01.004openalex-snapshot
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
inferred← citeshttps://doi.org/10.1016/j.bjp.2013.11.004openalex-snapshot
Efficient Two Dimensional-IP routing: An incremental deployment design
inferred← citeshttps://doi.org/10.1016/j.dam.2014.05.007openalex-snapshot
On the van der Waerden numbers w(2;3,t)
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.03.019openalex-snapshot
Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers
inferred← citeshttps://doi.org/10.1016/j.jalgor.2008.02.005openalex-snapshot
The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00097-1openalex-snapshot
On the complexity of choosing the branching literal in DPLL
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00099-5openalex-snapshot
Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00249-3openalex-snapshot
Solving satisfiability problems using elliptic approximations – effective branching rules
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00385-2openalex-snapshot
A complete adaptive algorithm for propositional satisfiability
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00399-2openalex-snapshot
Approximating minimal unsatisfiable subformulae by means of adaptive core search
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00408-0openalex-snapshot
On the limit of branching rules for hard random unsatisfiable 3-SAT
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00045-6openalex-snapshot
How good are branching rules in DPLL?
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00017-6openalex-snapshot
New methods for 3-SAT decision and worst-case analysis
inferred← citeshttps://doi.org/10.1016/s0895-7177(03)90030-6openalex-snapshot
A weight-balanced branching rule for SAT
inferred← citeshttps://doi.org/10.1016/s0895-7177(98)00087-9openalex-snapshot
Backtracking tactics in the backtrack method for SAT
inferred← citeshttps://doi.org/10.1016/s0951-8320(02)00165-5openalex-snapshot
A practical comparison of methods to assess sum-of-products
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00320-8openalex-snapshot
Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00323-3openalex-snapshot
PaSAT — Parallel SAT-Checking with Lemma Exchange: Implementation and Applications
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00328-2openalex-snapshot
Ensemble-based prediction of SAT search behaviour
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00332-4openalex-snapshot
Learning to Select Branching Rules in the DPLL Procedure for Satisfiability
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80008-8openalex-snapshot
Backtracking Search Algorithms
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1017/s0269888900001041openalex-snapshot
Combining satisfiability techniques from AI and OR
inferred← citeshttps://doi.org/10.1017/s0890060403171065openalex-snapshot
Formal methods for the validation of automotive product configuration data
inferred← citeshttps://doi.org/10.1023/a:1006303512524openalex-snapshot
Resolution versus Search: Two Strategies for SAT
inferred← citeshttps://doi.org/10.1023/a:1006366304347openalex-snapshot
The Propositional Formula Checker HeerHugo
inferred← citeshttps://doi.org/10.1023/a:1011921025322openalex-snapshot
Using a Hybrid Genetic-Algorithm/Branch and Bound Approach to Solve Feasibility and Optimization Integer Programming Problems
inferred← citeshttps://doi.org/10.1023/a:1021200130191openalex-snapshot
Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights
inferred← citeshttps://doi.org/10.1023/a:1021264516079openalex-snapshot
An Overview of Backtrack Search Satisfiability Algorithms
inferred← citeshttps://doi.org/10.1080/0952813021000026795openalex-snapshot
Consistent subsets of inconsistent systems: structure and behaviour
inferred← citeshttps://doi.org/10.1093/jigpal/jzz025openalex-snapshot
Clause tableaux for maximum and minimum satisfiability
inferred← citeshttps://doi.org/10.1103/8g3p-tyz1openalex-snapshot
Quantum Davis-Putnam-Logemann-Loveland and generalized constraints in iterative quantum algorithms
inferred← citeshttps://doi.org/10.1109/bdai.2018.8546684openalex-snapshot
A Branching Strategy Based on the Length of Learnt Clause
inferred← citeshttps://doi.org/10.1109/ccgrid.2005.1558680openalex-snapshot
ZetaSAT - Boolean SATisfiability solving on Desktop Grids
inferred← citeshttps://doi.org/10.1109/dac.2005.193910openalex-snapshot
Efficient SAT solving: beyond supercubes
inferred← citeshttps://doi.org/10.1109/hldvt.2005.1568836openalex-snapshot
B-cubing theory: new possibilities for efficient SAT-solving
inferred← citeshttps://doi.org/10.1109/hldvt.2006.319983openalex-snapshot
Guiding CNF-SAT Search by Analyzing Constraint-Variable Dependencies and Clause Lengths
inferred← citeshttps://doi.org/10.1109/ictai.2006.62openalex-snapshot
Heuristic Policy Analysis and Efficiency Assessment in Constraint Satisfaction Search
inferred← citeshttps://doi.org/10.1109/ictai.2007.54openalex-snapshot
Determining the Basis for Performance Variations in CSP Heuristics
inferred← citeshttps://doi.org/10.1109/ictai.2007.87openalex-snapshot
Design of OBF-TS Fuzzy Models Based on Multiple Clustering Validity Criteria
inferred← citeshttps://doi.org/10.1109/tc.2006.175openalex-snapshot
B-Cubing: New Possibilities for Efficient SAT-Solving
inferred← citeshttps://doi.org/10.1126/science.283.5408.1752openalex-snapshot
Motor Cortical Encoding of Serial Order in a Context-Recall Task
inferred← citeshttps://doi.org/10.1142/s0218213008004199openalex-snapshot
DETERMINING THE PRINCIPLES UNDERLYING PERFORMANCE VARIATION IN CSP HEURISTICS
inferred← citeshttps://doi.org/10.1145/3094243.3094250openalex-snapshot
Research of Branching Heuristic Strategy for Implied Literal in Shortest Clause for SAT Problem
inferred← citeshttps://doi.org/10.1145/330560.330565openalex-snapshot
Parallel genetic algorithm to solve the satisfiability problem
inferred← citeshttps://doi.org/10.1287/ijoc.8.2.144openalex-snapshot
Constraint Propagation Based Scheduling of Job Shops
inferred← citeshttps://doi.org/10.1287/opre.42.2.201openalex-snapshot
Needed: An Empirical Science of Algorithms
inferred← citeshttps://doi.org/10.1360/04yf0171openalex-snapshot
Integrating advanced reasoning into a SAT solver
inferred← citeshttps://doi.org/10.1515/integ.2010.032openalex-snapshot
Two New Van Der Waerden Numbers: w(2; 3, 17) and w(2; 3, 18)
inferred← citeshttps://doi.org/10.1609/aimag.v19i4.1426openalex-snapshot
A Generic Framework for Constraint-Directed Search and Scheduling
inferred← citeshttps://doi.org/10.1609/icaps.v24i1.13645openalex-snapshot
A Novel Priority Rule Heuristic: Learning from Justification
inferred← citeshttps://doi.org/10.25911/5d7a2ba742b8copenalex-snapshot
Investigations into Satisfiability Search
inferred← citeshttps://doi.org/10.3233/978-1-58603-929-5-205openalex-snapshot
Fundaments of Branching Heuristics
inferred← citeshttps://doi.org/10.3233/aic-2009-0445openalex-snapshot
Structure-based satisfiability checking
inferred← citeshttps://doi.org/10.3233/sat190034openalex-snapshot
Lazy Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.3390/math10132264openalex-snapshot
A Verified Implementation of the DPLL Algorithm in Dafny
inferred← citeshttps://doi.org/10.48550/arxiv.2007.10842openalex-snapshot
Who Verifies the Verifiers? A Computer-Checked Implementation of the DPLL Algorithm in Dafny
inferred← citeshttps://doi.org/10.5555/1998496.1998538openalex-snapshot
Propelling SAT and SAT-based BMC using careset
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/82a54e1dz8c85z4f6dz9f3az60324fa2f8c1openalex-snapshot
Hybridation de techniques d'apprentissage de clauses en programmation par contraintes
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.7936/k7bk19qqopenalex-snapshot
An Efficient Algorithm for Maximum Boolean Satisfiability Based on Unit Propagation, Linear Programming, and Dynamic Weighting
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.