On the public citation graph
Look-ahead versus look-back for satisfiability problems
0 signed · 88 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/3-540-61551-2_65openalex-snapshot
Using CSP look-back techniques to solve exceptionally hard SAT instances
inferredcites →https://doi.org/10.1007/bf00881805openalex-snapshot
Branching rules for satisfiability
inferredcites →https://doi.org/10.1007/bf01531077openalex-snapshot
Solving propositional satisfiability problems
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/0167-6377(92)90019-yopenalex-snapshot
An efficient algorithm for the 3-satisfiability problem
inferredcites →https://doi.org/10.1109/tai.1996.560789openalex-snapshot
Conflict analysis in search algorithms for satisfiability
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
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.1002/9780470612309.ch17openalex-snapshot
Boosting SLS Using Resolution
inferred← citeshttps://doi.org/10.1007/11427186_43openalex-snapshot
Efficient and Experimental Meta-heuristics for MAX-SAT Problems
inferred← citeshttps://doi.org/10.1007/11493853_6openalex-snapshot
Simplifying Diagnosis Using LSAT: A Propositional Approach to Reasoning from First Principles
inferred← citeshttps://doi.org/10.1007/11499107_12openalex-snapshot
Diversification and Determinism in Local Search for Satisfiability
inferred← citeshttps://doi.org/10.1007/11527695_26openalex-snapshot
March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver
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/11814948_28openalex-snapshot
Local Search for Unsatisfiability
inferred← citeshttps://doi.org/10.1007/11889205_18openalex-snapshot
Adaptive Clause Weight Redistribution
inferred← citeshttps://doi.org/10.1007/3-540-36187-1_52openalex-snapshot
Modelling More Realistic SAT Problems
inferred← citeshttps://doi.org/10.1007/3-540-36607-5_11openalex-snapshot
The Effect of Nogood Recording in DPLL-CBJ SAT Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-44654-0_3openalex-snapshot
Constraint (Logic) Programming: A Survey on Research and Applications
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_25openalex-snapshot
AVAL: An Enumerative Method for SAT
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_37openalex-snapshot
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking
inferred← citeshttps://doi.org/10.1007/3-540-45349-0_36openalex-snapshot
Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability
inferred← citeshttps://doi.org/10.1007/3-540-45422-5_11openalex-snapshot
Propositional Satisfiability in Answer-Set Programming
inferred← citeshttps://doi.org/10.1007/3-540-45675-9_49openalex-snapshot
Multiagent SAT (MASSAT): Autonomous Pattern Search in Constrained Domains
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/978-1-4020-5571-3_7openalex-snapshot
Clause Weighting Local Search for SAT
inferred← citeshttps://doi.org/10.1007/978-1-4615-1567-8_21openalex-snapshot
Extending the Smodels System with Cardinality and Weight Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-19212-9_5openalex-snapshot
Local Rapid Learning for Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-09584-4_6openalex-snapshot
Evaluating Instance Generators by Configuration
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-24605-3_28openalex-snapshot
The Interaction Between Inference and Branching Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_34openalex-snapshot
Local-Search Techniques for Propositional Logic Extended with Cardinality Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_7openalex-snapshot
Boosting Chaff’s Performance by Incorporating CSP Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_49openalex-snapshot
Hierarchical Hardness Models for SAT
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_20openalex-snapshot
From High Girth Graphs to Hard Instances
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_25openalex-snapshot
Exact Cover via Satisfiability: An Empirical Study
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_27openalex-snapshot
Partitioning SAT Instances for Distributed Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-20662-7_23openalex-snapshot
Beyond Unit Propagation in SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-38171-3_6openalex-snapshot
Revisiting Hyper Binary Resolution
inferred← citeshttps://doi.org/10.1007/978-3-662-07952-2_13openalex-snapshot
Agent Networks: Topological and Clustering Characterization
inferred← citeshttps://doi.org/10.1007/s10115-015-0890-zopenalex-snapshot
Information diffusion in a multi-social-network scenario: framework and ASP-based analysis
inferred← citeshttps://doi.org/10.1007/s10472-004-9425-0openalex-snapshot
Efficient Data Structures for Backtrack Search SAT Solvers
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/s10732-010-9146-yopenalex-snapshot
Generating highly balanced sudoku problems as hard problems
inferred← citeshttps://doi.org/10.1007/s10817-005-1970-7openalex-snapshot
A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers
inferred← citeshttps://doi.org/10.1007/s10817-005-9010-1openalex-snapshot
Clause Weighting Local Search for SAT
inferred← citeshttps://doi.org/10.1007/s10817-006-9025-2openalex-snapshot
An Efficient Approach to Solving Random k-sat Problems
inferred← citeshttps://doi.org/10.1007/s10898-007-9166-9openalex-snapshot
An efficient solver for weighted Max-SAT
inferred← citeshttps://doi.org/10.1007/s12532-008-0001-1openalex-snapshot
SCIP: solving constraint integer programs
inferred← citeshttps://doi.org/10.1016/j.artint.2008.06.003openalex-snapshot
Modelling and solving temporal reasoning as propositional satisfiability
inferred← citeshttps://doi.org/10.1016/j.dam.2005.10.020openalex-snapshot
Regular-SAT: A many-valued approach to solving combinatorial problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00410-9openalex-snapshot
SAT problems with chains of dependent variables
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00322-1openalex-snapshot
Stochastic Systematic Search Algorithms for Satisfiability
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00336-1openalex-snapshot
Extending the Reach of SAT with Many-Valued Logics
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80106-4openalex-snapshot
Finding the Right Hybrid Algorithm - A Combinatorial Meta-Problem
inferred← citeshttps://doi.org/10.1023/a:1006343127545openalex-snapshot
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
inferred← citeshttps://doi.org/10.1023/a:1006351428454openalex-snapshot
Implementing the Davis–Putnam Method
inferred← citeshttps://doi.org/10.1023/a:1014450507312openalex-snapshot
Finding the Right Hybrid Algorithm – A Combinatorial Meta-Problem
inferred← citeshttps://doi.org/10.1023/a:1021264516079openalex-snapshot
An Overview of Backtrack Search Satisfiability Algorithms
inferred← citeshttps://doi.org/10.1088/1755-1315/440/3/032143openalex-snapshot
An Effective Sharpsat Solution Method Based on Learnt Clause Minimization Approach
inferred← citeshttps://doi.org/10.1109/aspdac.2005.1466522openalex-snapshot
Comparison of schemes for encoding unobservability in translation to SAT
inferred← citeshttps://doi.org/10.1109/date.2004.1268859openalex-snapshot
Exploiting signal unobservability for efficient translation to CNF in formal verification of microprocessors
inferred← citeshttps://doi.org/10.1109/iccd.2008.4751838openalex-snapshot
Improving SAT-based Combinational Equivalence Checking through circuit preprocessing
inferred← citeshttps://doi.org/10.1109/ictai.2009.47openalex-snapshot
Towards a Generic CNF Simplifier for Minimising Structured Problem Hardness
inferred← citeshttps://doi.org/10.1109/ictai.2014.74openalex-snapshot
Extensions and Variants of Dalal's Quad Polynomial Fragments of SAT
inferred← citeshttps://doi.org/10.1109/iscas.2004.1329500openalex-snapshot
A new generation of ISCAS benchmarks from formal verification of high-level microprocessors
inferred← citeshttps://doi.org/10.1109/ismvl.2003.1201404openalex-snapshot
New logical and complexity results for signed-SAT
inferred← citeshttps://doi.org/10.1109/ismvl.2004.1319950openalex-snapshot
The interface between P and NP in signed CNF formulas
inferred← citeshttps://doi.org/10.1109/tai.2003.1250177openalex-snapshot
Probing-based preprocessing techniques for propositional satisfiability
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.11606/d.45.2007.tde-03062007-144527openalex-snapshot
"Um resolvedor SAT paralelo com BSP sobre uma grade"
inferred← citeshttps://doi.org/10.1287/ijoc.2016.0723openalex-snapshot
A Machine Learning-Based Approximation of Strong Branching
inferred← citeshttps://doi.org/10.14794/icai.9.2014.2.101openalex-snapshot
SAT representation of randomly deployed Wireless Sensor Networks
inferred← citeshttps://doi.org/10.15476/elte.2019.163openalex-snapshot
Formal Methods for Modelling Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1609/aaai.v34i02.5500openalex-snapshot
Guiding CDCL SAT Search via Random Exploration amid Conflict Depression
inferred← citeshttps://doi.org/10.1613/jair.1681openalex-snapshot
Hiding Satisfying Assignments: Two are Better than One
inferred← citeshttps://doi.org/10.3233/fi-1999-391202openalex-snapshot
A Hybrid Method for Finite Model Search in Equational Theories
inferred← citeshttps://doi.org/10.3233/sat190034openalex-snapshot
Lazy Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.3233/sat190047openalex-snapshot
The First and Second Max-SAT Evaluations
inferred← citeshttps://doi.org/10.70675/22f799bfz3181z4324z8161zb5470bfc9e34openalex-snapshot
Extensions of tractable classes for propositional satisfiability
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/90961a35z8128z45eaz9859z1d246d7621d4openalex-snapshot
Max-résolution et apprentissage pour la résolution du problème de satisfiabilité maximum
inferred← citeshttps://doi.org/10.70675/932a7c81z8d8dz4199z9e7bz02240dcf3998openalex-snapshot
Reasoning and inference for (maximum) satisfiability : new insights
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.