On the public citation graph

Logical inference and polyhedral projection

https://doi.org/10.1007/bfb0023767
0 signed · 52 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/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
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-031-32726-1openalex-snapshot
Integer Programming and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01531033openalex-snapshot
Generalized resolution for 0?1 linear inequalities
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/bf01531078openalex-snapshot
A linear programming approach to reasoning about probabilities
inferredcites →https://doi.org/10.1007/bf01580586openalex-snapshot
A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
inferredcites →https://doi.org/10.1007/bf02186367openalex-snapshot
Logical testing for rule-base management
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/0012-365x(73)90167-2openalex-snapshot
Edmonds polytopes and a hierarchy of combinatorial problems
inferredcites →https://doi.org/10.1016/0020-0190(76)90079-xopenalex-snapshot
A cascade algorithm for the logical closure of a set of binary relations
inferredcites →https://doi.org/10.1016/0020-0190(87)90200-6openalex-snapshot
An O(n2) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all horn sentences
inferredcites →https://doi.org/10.1016/0020-0190(88)90113-5openalex-snapshot
Polynomially solvable satisfiability problems
inferredcites →https://doi.org/10.1016/0097-3165(76)90055-8openalex-snapshot
Fourier-Motzkin elimination extension to integer programming problems
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/0304-3975(85)90144-6openalex-snapshot
The intractability of resolution
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/0377-2217(91)90312-jopenalex-snapshot
The equivalence of an LCP to a parametric linear program with a scalar parameter
inferredcites →https://doi.org/10.1016/0743-1066(84)90014-1openalex-snapshot
Linear-time algorithms for testing the satisfiability of propositional horn formulae
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.1016/c2009-0-27551-9openalex-snapshot
Logical Foundations of Artificial Intelligence
inferredcites →https://doi.org/10.1016/s0019-9958(83)80027-8openalex-snapshot
The satisfiabilty problem for a class consisting of horn sentences and some non-horn sentences in proportional logic
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.1145/102782.102789openalex-snapshot
Extended Horn sets in propositional logic
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/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1287/ijoc.1.3.137openalex-snapshot
Input Proofs and Rank One Cutting Planes
inferredcites →https://doi.org/10.1287/ijoc.3.2.135openalex-snapshot
Column Generation Methods for Probabilistic Logic
inferredcites →https://doi.org/10.2307/3009304openalex-snapshot
Model Building in Mathematical Programming
inferredcites →https://doi.org/10.7249/r366openalex-snapshot
Linear Programming and Extensions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118033166.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/3-540-69346-7_21openalex-snapshot
Solving Integer and Disjunctive Programs by Lift and Project
inferred← citeshttps://doi.org/10.1007/978-3-030-29007-8_9openalex-snapshot
Restricted Cutting Plane Proofs in Horn Constraint Systems
inferred← citeshttps://doi.org/10.1007/978-3-7091-9394-5_6openalex-snapshot
Automated Deduction and Integer Programming
inferred← citeshttps://doi.org/10.1007/bf01530787openalex-snapshot
Many-valued logic and mixed integer programming
inferred← citeshttps://doi.org/10.1007/bfb0023753openalex-snapshot
Computer Science Logic
inferred← citeshttps://doi.org/10.1007/s10479-009-0623-3openalex-snapshot
Projecting systems of linear inequalities with binary variables
inferred← citeshttps://doi.org/10.1007/s10601-015-9201-2openalex-snapshot
Projection, consistency, and George Boole
inferred← citeshttps://doi.org/10.1007/s10817-022-09618-2openalex-snapshot
Analyzing Read-Once Cutting Plane Proofs in Horn Systems
inferred← citeshttps://doi.org/10.1016/0305-0548(95)00028-3openalex-snapshot
Long range planning in the process industries: A projection approach
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00100-6openalex-snapshot
Mixed logical-linear programming
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00576-3openalex-snapshot
Logic cuts for multilevel generalized assignment problems
inferred← citeshttps://doi.org/10.1090/crmp/048/04openalex-snapshot
An output-sensitive algorithm for multi-parametric LCPs with sufficient matrices
inferred← citeshttps://doi.org/10.1093/logcom/9.5.651openalex-snapshot
Propositional information systems
inferred← citeshttps://doi.org/10.1093/oso/9780198539896.001.0001openalex-snapshot
Automated Deduction in Multiple-valued Logics
inferred← citeshttps://doi.org/10.1109/date.2005.127openalex-snapshot
Efficient Conflict-Based Learning in an RTL Circuit Constraint Solver
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.