On the public citation graph
On optimizing the satisfiability (SAT) problem
0 signed · 93 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-58325-4_176openalex-snapshot
Average time complexity of the SAT 1.2 algorithm
inferredcites →https://doi.org/10.1007/978-0-387-74503-9openalex-snapshot
Linear and Nonlinear Programming
inferredcites →https://doi.org/10.1007/978-1-4613-1987-0openalex-snapshot
Parallel Execution of Logic Programs
inferredcites →https://doi.org/10.1007/978-1-4899-5327-8_25openalex-snapshot
On the Complexity of Derivation in Propositional Calculus
inferredcites →https://doi.org/10.1007/978-3-662-09438-9openalex-snapshot
Principles of Artificial Intelligence
inferredcites →https://doi.org/10.1007/bf01407901openalex-snapshot
Parallel consistent labeling algorithms
inferredcites →https://doi.org/10.1007/bf01531030openalex-snapshot
An average case analysis of a resolution principle algorithm in mechanical theorem proving
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/bf02127976openalex-snapshot
A fast parallel SAT-solver — efficient workload balancing
inferredcites →https://doi.org/10.1007/bf02186368openalex-snapshot
Generalized resolution and cutting planes
inferredcites →https://doi.org/10.1007/bf02283686openalex-snapshot
Computational experience with an interior point algorithm on the satisfiability problem
inferredcites →https://doi.org/10.1016/0004-3702(77)90007-8openalex-snapshot
Consistency in networks of relations
inferredcites →https://doi.org/10.1016/0004-3702(80)90026-0openalex-snapshot
Principles of artificial intelligence
inferredcites →https://doi.org/10.1016/0004-3702(85)90074-8openalex-snapshot
Refutational theorem proving using term-rewriting systems
inferredcites →https://doi.org/10.1016/0020-0190(79)90002-4openalex-snapshot
A linear-time algorithm for testing the truth of certain quantified boolean formulas
inferredcites →https://doi.org/10.1016/0020-0190(82)90110-7openalex-snapshot
Average time analysis of simplified Davis-Putnam procedures
inferredcites →https://doi.org/10.1016/0020-0190(92)90029-uopenalex-snapshot
On the greedy algorithm for satisfiability
inferredcites →https://doi.org/10.1016/0020-0255(87)90005-3openalex-snapshot
A parallel approach for theorem proving in prepositional logic
inferredcites →https://doi.org/10.1016/0167-6377(88)90044-2openalex-snapshot
Resolution vs. cutting plane solution of inference problems: Some computational experience
inferredcites →https://doi.org/10.1016/0167-9236(88)90097-8openalex-snapshot
A quantitative approach to logical inference
inferredcites →https://doi.org/10.1016/0167-9236(88)90128-5openalex-snapshot
Computation-oriented reductions of predicate to propositional logic
inferredcites →https://doi.org/10.1016/0167-9260(92)90015-qopenalex-snapshot
Boolean satisfiability and equivalence checking using general Binary Decision Diagrams
inferredcites →https://doi.org/10.1016/0304-3975(77)90054-8openalex-snapshot
On the complexity of regular resolution and the Davis-Putnam procedure
inferredcites →https://doi.org/10.1016/0305-0548(86)90056-0openalex-snapshot
Some results and experiments in programming techniques for propositional logic
inferredcites →https://doi.org/10.1016/0378-4754(86)90092-3openalex-snapshot
Linear and nonlinear programming.
inferredcites →https://doi.org/10.1016/0743-7315(89)90068-3openalex-snapshot
A neural network approach to the 3-satisfiability problem
inferredcites →https://doi.org/10.1016/0890-5401(88)90014-4openalex-snapshot
A satisfiability tester for non-clausal propositional calculus
inferredcites →https://doi.org/10.1016/c2009-0-27551-9openalex-snapshot
Logical Foundations of Artificial Intelligence
inferredcites →https://doi.org/10.1016/s0004-3702(83)80007-1openalex-snapshot
Search rearrangement backtracking and polynomial average time
inferredcites →https://doi.org/10.1090/dimacs/035/02openalex-snapshot
Algorithms for the satisfiability (SAT) problem: A survey
inferredcites →https://doi.org/10.1109/21.247892openalex-snapshot
Local search for satisfiability (SAT) problem
inferredcites →https://doi.org/10.1109/34.149596openalex-snapshot
A novel discrete relaxation architecture
inferredcites →https://doi.org/10.1109/43.108614openalex-snapshot
Test pattern generation using Boolean satisfiability
inferredcites →https://doi.org/10.1109/54.60606openalex-snapshot
Neural net and Boolean satisfiability models of logic circuits
inferredcites →https://doi.org/10.1109/69.166989openalex-snapshot
Vectorization of a generalized procedure for theorem proving in propositional logic on vector computers
inferredcites →https://doi.org/10.1109/69.334864openalex-snapshot
Global optimization for satisfiability (SAT) problem
inferredcites →https://doi.org/10.1109/mc.1987.1663350openalex-snapshot
Guest Editor's Introduction: New Computers for Artificial Intelligence Processing
inferredcites →https://doi.org/10.1109/sfcs.1975.21openalex-snapshot
On the complexity of time table and multi-commodity flow problems
inferredcites →https://doi.org/10.1109/sfcs.1991.185365openalex-snapshot
On selecting a satisfying truth assignment
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1109/tc.1985.1676530openalex-snapshot
Parallel Computer Architectures and Problem Solving Strategies for the Consistent Labeling Problem
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1109/tpami.1987.4767988openalex-snapshot
A Parallel Architecture for Discrete Relaxation Algorithm
inferredcites →https://doi.org/10.1137/0205048openalex-snapshot
On the Complexity of Timetable and Multicommodity Flow Problems
inferredcites →https://doi.org/10.1137/0210043openalex-snapshot
An Average Time Analysis of Backtracking
inferredcites →https://doi.org/10.1137/0214067openalex-snapshot
The Pure Literal Rule and Polynomial Average Time
inferredcites →https://doi.org/10.1137/0218026openalex-snapshot
CNF-Satisfiability Test by Counting and Polynomial Average Time
inferredcites →https://doi.org/10.1137/0220069openalex-snapshot
Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms
inferredcites →https://doi.org/10.1142/9789814354707_0002openalex-snapshot
On Optimizing a Search Problem
inferredcites →https://doi.org/10.1145/130836.130837openalex-snapshot
Efficient local search for very large-scale satisfiability problems
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/361219.361224openalex-snapshot
Backtrack programming techniques
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/800133.804350openalex-snapshot
The complexity of satisfiability problems
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1147/rd.41.0028openalex-snapshot
A Proof Method for Quantification Theory: Its Justification and Realization
inferredcites →https://doi.org/10.2178/bsl/1203350879openalex-snapshot
The Complexity of Propositional Proofs
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.2307/421131openalex-snapshot
The Complexity of Propositional Proofs
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-59234-9_6openalex-snapshot
A Survey on Analog Models of Computation
inferred← citeshttps://doi.org/10.1007/s10846-017-0480-2openalex-snapshot
A New Mobile Robot Toolbox for Matlab
inferred← citeshttps://doi.org/10.1038/nphys2105openalex-snapshot
Optimization hardness as transient chaos in an analog approach to constraint satisfaction
inferred← citeshttps://doi.org/10.1109/cnna.2012.6331411openalex-snapshot
Continuous-time neural networks without local traps for solving Boolean satisfiability
inferred← citeshttps://doi.org/10.1109/icicisys.2010.5658781openalex-snapshot
Optimization method for mixed constraints problem solving
inferred← citeshttps://doi.org/10.1109/qce52317.2021.00031openalex-snapshot
A Quantum-Inspired Classical Solver for Boolean k-Satisfiability Problems
inferred← citeshttps://doi.org/10.1134/s0001434624030210openalex-snapshot
On the Existence and Properties of Convex Extensions of Boolean Functions
inferred← citeshttps://doi.org/10.1134/s1990478924010010openalex-snapshot
Convex Continuation of a Boolean Function and Its Applications
inferred← citeshttps://doi.org/10.1134/s1990478924030049openalex-snapshot
Convex Continuations of Some Discrete Functions
inferred← citeshttps://doi.org/10.1145/3386164.3387292openalex-snapshot
Towards Flexible Process Automation
inferred← citeshttps://doi.org/10.1371/journal.pone.0073400openalex-snapshot
Asymmetric Continuous-Time Neural Networks without Local Traps for Solving Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.20310/2686-9667-2024-29-145-20-28openalex-snapshot
Construction of smooth convex extensions of Boolean functions
inferred← citeshttps://doi.org/10.20310/2686-9667-2025-30-149-5-14openalex-snapshot
On the set of continuously differentiable concave extensions of a Boolean function
inferred← citeshttps://doi.org/10.20948/prepr-2024-30openalex-snapshot
On Inequalities Between Convex, Concave, and Multilinear Continuations of Boolean Functions
inferred← citeshttps://doi.org/10.22405/2226-8383-2025-26-3-58-70openalex-snapshot
О порядке гладкости максимального выпуклого продолжения булевой функции
inferred← citeshttps://doi.org/10.26089/nummet.v24r102openalex-snapshot
Polylinear continuations of some discrete functions and an algorithm for finding them
inferred← citeshttps://doi.org/10.26907/0021-3446-2025-9-3-12openalex-snapshot
Direct and inverse mean value properties for polylinear functions and their application
inferred← citeshttps://doi.org/10.3103/s1066369x25700653openalex-snapshot
Direct and Inverse Mean Value Properties for Polylinear Functions and Their Applications
inferred← citeshttps://doi.org/10.3390/math10060918openalex-snapshot
Polylinear Transformation Method for Solving Systems of Logical Equations
inferred← citeshttps://doi.org/10.3390/math10111851openalex-snapshot
The Development of Suitable Inequalities and Their Application to Systems of Logical Equations
inferred← citeshttps://doi.org/10.3390/math10122097openalex-snapshot
Target Function without Local Minimum for Systems of Logical Equations with a Unique Solution
inferred← citeshttps://doi.org/10.3390/math9243299openalex-snapshot
Transformation Method for Solving System of Boolean Algebraic Equations
inferred← citeshttps://doi.org/10.4213/mzm14105openalex-snapshot
О существовании и свойствах выпуклых продолжений булевых функций
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.