On the public citation graph
A continuous approach to inductive inference
0 signed · 106 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.1002/(issn)1538-7305copenalex-snapshot
Bell System Technical Journal
inferredcites →https://doi.org/10.1002/j.1538-7305.1956.tb03835.xopenalex-snapshot
Minimization of Boolean Functions*
inferredcites →https://doi.org/10.1007/978-1-4615-0292-0_16openalex-snapshot
Exact Minimization of Multiple-Valued Functions for PLA Optimization
inferredcites →https://doi.org/10.1007/bf01582907openalex-snapshot
An interior point algorithm to solve computationally difficult set covering problems
inferredcites →https://doi.org/10.1007/bf02283686openalex-snapshot
Computational experience with an interior point algorithm on the satisfiability problem
inferredcites →https://doi.org/10.1007/bf02283750openalex-snapshot
Cause-effect relationships and partially defined Boolean functions
inferredcites →https://doi.org/10.1016/0305-0548(94)90051-5openalex-snapshot
Generating logical expressions from positive and negative examples via a branch-and-bound approach
inferredcites →https://doi.org/10.1080/00029890.1952.11988183openalex-snapshot
The Problem of Simplifying Truth Functions
inferredcites →https://doi.org/10.1080/00029890.1955.11988710openalex-snapshot
A Way to Simplify Truth Functions
inferredcites →https://doi.org/10.1090/conm/114/1097865openalex-snapshot
Riemannian geometry underlying interior-point methods for linear programming
inferredcites →https://doi.org/10.1090/conm/114/1097880openalex-snapshot
An interior-point approach to NP-complete problems. I
inferredcites →https://doi.org/10.1109/dac.1981.1585367openalex-snapshot
A State-Machine Synthesizer -- SMS
inferredcites →https://doi.org/10.1109/pgec.1965.264175openalex-snapshot
A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table
inferredcites →https://doi.org/10.1109/t-c.1970.222917openalex-snapshot
A New Algorithm for Generating Prime Implicants
inferredcites →https://doi.org/10.1109/t-c.1970.222967openalex-snapshot
Recursive Operators for Prime Implicant and Irredundant Normal Form Determination
inferredcites →https://doi.org/10.1137/s0895480191199385openalex-snapshot
Predicting Cause-Effect Relationships from Incomplete Discrete Observations
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/356914.356918openalex-snapshot
Inductive Inference: Theory and Methods
inferredcites →https://doi.org/10.1147/rd.185.0443openalex-snapshot
MINI: A Heuristic Approach for Logic Minimization
inferredcites →https://doi.org/10.1184/r1/6707426openalex-snapshot
Predicting Cause-Effect Relationships from Incomplete Discrete Observations
inferredcites →https://doi.org/10.5555/800073.802315openalex-snapshot
A State-Machine Synthesizer -- SMS
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/int.1064openalex-snapshot
An artificial neural network satisfiability tester
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_408openalex-snapshot
Quadratic Programming Over an Ellipsoid
inferred← citeshttps://doi.org/10.1007/0-387-25592-3_5openalex-snapshot
Interior Point and Semidefinite Approaches in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/0-387-32942-0_2openalex-snapshot
Continuous Approaches for Solving Discrete Optimization Problems
inferred← citeshttps://doi.org/10.1007/0-387-34296-6_2openalex-snapshot
The One Clause at a Time (OCAT) Approach to Data Mining and Knowledge Discovery
inferred← citeshttps://doi.org/10.1007/0-387-34296-6_5openalex-snapshot
Learning Logic Formulas and Related Error Distributions
inferred← citeshttps://doi.org/10.1007/3-540-36553-2_37openalex-snapshot
A Note on Designing Logical Circuits Using SAT
inferred← citeshttps://doi.org/10.1007/3-540-36755-1_34openalex-snapshot
Phase Transitions and Stochastic Local Search in k-Term DNF Learning
inferred← citeshttps://doi.org/10.1007/3-540-44886-1_12openalex-snapshot
Iterated Robust Tabu Search for MAX-SAT
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_143openalex-snapshot
Branching rules for satisfiability
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_539openalex-snapshot
Quadratic Programming over an Ellipsoid
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_2openalex-snapshot
Approximate Algorithms and Heuristics for MAX-SAT
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_4openalex-snapshot
Interior Point Methods for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3449-1_11openalex-snapshot
Interior Point Methods for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3449-1_12openalex-snapshot
Interior Point Methods for Global Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_2openalex-snapshot
Complexity Issues in Global Optimization: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4615-4102-8_9openalex-snapshot
Some Recent Developments of Using Logical Analysis for Inferring a Boolean Function with Few Clauses
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_7openalex-snapshot
Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-20323-8_8openalex-snapshot
Exact Synthesis of ESOP Forms
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_49openalex-snapshot
Towards Formal Fairness in Machine Learning
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_55openalex-snapshot
Computing Optimal Decision Sets with SAT
inferred← citeshttps://doi.org/10.1007/978-3-319-94205-6_41openalex-snapshot
A SAT-Based Approach to Learn Explainable Decision Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_29openalex-snapshot
Quality of LP-Based Approximations for Highly Combinatorial Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-30217-9_6openalex-snapshot
Search Space Features Underlying the Performance of Stochastic Local Search Algorithms for MAX-SAT
inferred← citeshttps://doi.org/10.1007/978-3-642-46773-8_4openalex-snapshot
Mathematical Programming Methods for Reasoning under Uncertainty
inferred← citeshttps://doi.org/10.1007/bf00881805openalex-snapshot
Branching rules for satisfiability
inferred← citeshttps://doi.org/10.1007/bf01097004openalex-snapshot
Inference of a minimum size boolean function from examples by using a new efficient branch-and-bound approach
inferred← citeshttps://doi.org/10.1007/bf01581170openalex-snapshot
Trust region affine scaling algorithms for linearly constrained convex and concave programs
inferred← citeshttps://doi.org/10.1007/bf01581726openalex-snapshot
On the complexity of approximating a KKT point of quadratic programming
inferred← citeshttps://doi.org/10.1007/s10472-004-9421-4openalex-snapshot
UnitWalk: A New SAT Solver that Uses Local Search Guided by Unit Clause Elimination
inferred← citeshttps://doi.org/10.1007/s10994-023-06346-5openalex-snapshot
Differentiable learning of matricized DNFs and its application to Boolean networks
inferred← citeshttps://doi.org/10.1016/0020-0255(96)00082-5openalex-snapshot
Interactive learning of monotone Boolean functions
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90033-7openalex-snapshot
Recognition of q-Horn formulae in linear time
inferred← citeshttps://doi.org/10.1016/0305-0548(94)90051-5openalex-snapshot
Generating logical expressions from positive and negative examples via a branch-and-bound approach
inferred← citeshttps://doi.org/10.1016/0305-0548(95)00075-5openalex-snapshot
On the minimum number of logical clauses inferred from examples
inferred← citeshttps://doi.org/10.1016/0895-7177(95)00234-0openalex-snapshot
An approach to guided learning of boolean functions
inferred← citeshttps://doi.org/10.1016/j.artint.2026.104605openalex-snapshot
The model counting competitions 2021–2023
inferred← citeshttps://doi.org/10.1016/j.omega.2004.07.012openalex-snapshot
A spanning heuristic for the unordered and ordered matching identification problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.08.015openalex-snapshot
Synthesis of a DNF formula from a sample of strings using Ehrenfeucht–Fraïssé games
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.08.032openalex-snapshot
Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT
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/s0360-8352(00)00021-8openalex-snapshot
Bicriteria programming with several modern applications
inferred← citeshttps://doi.org/10.1016/s0895-7177(97)00255-0openalex-snapshot
A Greedy Randomized Adaptive Search Procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions
inferred← citeshttps://doi.org/10.1016/s1088-467x(99)00022-0openalex-snapshot
MICSL: Multiple Iterative Constraint Satisfaction based Learning
inferred← citeshttps://doi.org/10.1023/a:1006350622830openalex-snapshot
Local Search Algorithms for SAT: An Empirical Evaluation
inferred← citeshttps://doi.org/10.1023/a:1008240227198openalex-snapshot
A Branch and Bound Method via d.c. Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic Problems
inferred← citeshttps://doi.org/10.1023/a:1008287028851openalex-snapshot
A Discrete Lagrangian-Based Global-Search Method for Solving Satisfiability Problems
inferred← citeshttps://doi.org/10.1023/a:1008294209959openalex-snapshot
Trace-Based Methods for Solving Nonlinear Global Optimization and Satisfiability Problems
inferred← citeshttps://doi.org/10.1023/a:1009739827008openalex-snapshot
Approximation Algorithms for Quadratic Programming
inferred← citeshttps://doi.org/10.1023/b:anor.0000032572.32788.daopenalex-snapshot
Approximations and Randomization to Boost CSP Techniques
inferred← citeshttps://doi.org/10.1038/srep36812openalex-snapshot
Logic models to predict continuous outputs based on binary inputs with an application to personalized cancer therapy
inferred← citeshttps://doi.org/10.1080/02331930108844555openalex-snapshot
A continuous approch for globally solving linearly constrained quadratic
inferred← citeshttps://doi.org/10.1093/oso/9780198538561.003.0006openalex-snapshot
Interior point algorithms for integer programming
inferred← citeshttps://doi.org/10.1098/rsta.2019.0161openalex-snapshot
Boolean satisfiability in quantum compilation
inferred← citeshttps://doi.org/10.1103/physreve.71.066707openalex-snapshot
Optimization by quantum annealing: Lessons from hard satisfiability problems
inferred← citeshttps://doi.org/10.1109/4235.942527openalex-snapshot
Parallel hybrid method for SAT that couples genetic algorithms and local search
inferred← citeshttps://doi.org/10.1109/aspdac.2017.7858328openalex-snapshot
CEGAR-based EF synthesis of Boolean functions with an application to circuit rectification
inferred← citeshttps://doi.org/10.1109/bracis.2018.00098openalex-snapshot
Synthesis of a DNF Formula From a Sample of Strings
inferred← citeshttps://doi.org/10.1109/eurmic.1998.708093openalex-snapshot
Solving the satisfiability problem by a parallel cellular genetic algorithm
inferred← citeshttps://doi.org/10.1109/icsmc.2004.1400824openalex-snapshot
Using ant colonies to solve data-mining problems
inferred← citeshttps://doi.org/10.1109/ictai62512.2024.00130openalex-snapshot
On the Learning of Explainable Classification Rules through Disjunctive Patterns
inferred← citeshttps://doi.org/10.1109/mwscas.1993.343098openalex-snapshot
An interior point approach to Boolean vector function synthesis
inferred← citeshttps://doi.org/10.1109/nano.2002.1032161openalex-snapshot
Gene expression modelling with the use of Boolean network and artificial neural network
inferred← citeshttps://doi.org/10.1109/tai.1998.744842openalex-snapshot
Combining cellular genetic algorithms and local search for solving satisfiability problems
inferred← citeshttps://doi.org/10.1142/s0129183117501467openalex-snapshot
On the inherent competition between valid and spurious inductive inferences in Boolean data
inferred← citeshttps://doi.org/10.1145/1143844.1143943openalex-snapshot
A statistical approach to rule learning
inferred← citeshttps://doi.org/10.1145/1837934.1837954openalex-snapshot
Parametric quantified SAT solving
inferred← citeshttps://doi.org/10.1184/r1/6721049openalex-snapshot
Phenotype Inference from Genotype in RNA Viruses
inferred← citeshttps://doi.org/10.1186/s13640-018-0303-9openalex-snapshot
Cascade of Boolean detector combinations
inferred← citeshttps://doi.org/10.1191/0143624403bt064oaopenalex-snapshot
Building Energy and Environment Performance System (BEEPS): a programme for building energy certification in Italy
inferred← citeshttps://doi.org/10.1287/ijoc.10.3.301openalex-snapshot
An Incremental Branch-and-Bound Method for the Satisfiability Problem
inferred← citeshttps://doi.org/10.1287/ijoc.14.1.20.7709openalex-snapshot
A MINSAT Approach for Learning in Logic Domains
inferred← citeshttps://doi.org/10.1287/ijoc.7.3.283openalex-snapshot
A Relationship Between CNF and DNF Systems Derivable from Examples
inferred← citeshttps://doi.org/10.1371/journal.pone.0089053openalex-snapshot
Using Data-Driven Rules to Predict Mortality in Severe Community Acquired Pneumonia
inferred← citeshttps://doi.org/10.14288/1.0051395openalex-snapshot
Understanding stochastic local search algorithms : an empirical analysis of the relationship between search space structure and algorithm behaviour
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.12208openalex-snapshot
Towards Generalization in QBF Solving via Machine Learning
inferred← citeshttps://doi.org/10.1609/aaai.v35i5.16498openalex-snapshot
A Scalable Two Stage Approach to Computing Optimal Decision Sets
inferred← citeshttps://doi.org/10.1613/jair.1.12719openalex-snapshot
Learning Optimal Decision Sets and Lists with SAT
inferred← citeshttps://doi.org/10.24963/ijcai.2021/608openalex-snapshot
Reasoning-Based Learning of Interpretable ML Models
inferred← citeshttps://doi.org/10.4018/978-1-59904-528-3openalex-snapshot
Mathematical Methods for Knowledge Discovery and Data Mining
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.