On the public citation graph

A linear programming approach to reasoning about probabilities

https://doi.org/10.1007/bf01531078
0 signed · 72 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.1002/j.1538-7305.1970.tb01770.xopenalex-snapshot
An Efficient Heuristic Procedure for Partitioning Graphs
inferredcites →https://doi.org/10.1007/bf01593804openalex-snapshot
A practicable steepest-edge simplex algorithm
inferredcites →https://doi.org/10.1007/bf02612354openalex-snapshot
Roof duality, complementation and persistency in quadratic 0–1 optimization
inferredcites →https://doi.org/10.1016/0004-3702(86)90031-7openalex-snapshot
Probabilistic logic
inferredcites →https://doi.org/10.1016/0025-5564(75)90047-4openalex-snapshot
A model of inexact reasoning in medicine
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1016/0885-064x(88)90006-4openalex-snapshot
Probabilistic satisfiability
inferredcites →https://doi.org/10.1016/s0019-9958(65)90241-xopenalex-snapshot
Fuzzy sets
inferredcites →https://doi.org/10.1145/800119.803884openalex-snapshot
Some simplified NP-complete problems
inferredcites →https://doi.org/10.1287/opre.18.6.992openalex-snapshot
Optimal Design of Offshore Natural-Gas Pipeline Systems
inferredcites →https://doi.org/10.1287/opre.21.2.498openalex-snapshot
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
inferredcites →https://doi.org/10.1287/opre.8.1.101openalex-snapshot
Decomposition Principle for Linear Programs
inferredcites →https://doi.org/10.1515/9780691214696openalex-snapshot
A Mathematical Theory of Evidence
inferredcites →https://doi.org/10.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.2307/j.ctv10vm1qbopenalex-snapshot
A Mathematical Theory of Evidence
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.1002/int.4550101002openalex-snapshot
Probabilistic logic via capacities
inferred← citeshttps://doi.org/10.1007/11546245_5openalex-snapshot
A Hybrid Genetic and Variable Neighborhood Descent for Probabilistic SAT Problem
inferred← citeshttps://doi.org/10.1007/3-540-60112-0_18openalex-snapshot
Probabilistic satisfiability and decomposition
inferred← citeshttps://doi.org/10.1007/978-0-387-71921-4_9openalex-snapshot
Variable Neighborhood Search for the Probabilistic Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-94205-6_14openalex-snapshot
Probably Half True: Probabilistic Satisfiability over Łukasiewicz Infinitely-Valued Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-98797-2_12openalex-snapshot
Quantitative Logic Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-04388-8_12openalex-snapshot
On Improving the Scalability of Checking Satisfiability in Probabilistic Description Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-35975-0_4openalex-snapshot
Pronto: A Practical Probabilistic Description Logic Reasoner
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_18openalex-snapshot
Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability
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/978-94-017-1737-3_8openalex-snapshot
Probabilistic Satisfiability
inferred← citeshttps://doi.org/10.1007/bf01581149openalex-snapshot
Characterizing consistency in probabilistic logic for a class of Horn clauses
inferred← citeshttps://doi.org/10.1007/bf02027814openalex-snapshot
New methods for computing inferences in first order logic
inferred← citeshttps://doi.org/10.1007/bfb0023767openalex-snapshot
Logical inference and polyhedral projection
inferred← citeshttps://doi.org/10.1007/s00357-007-0014-xopenalex-snapshot
Algorithms for ℓ1-Embeddability and Related Problems
inferred← citeshttps://doi.org/10.1007/s10472-015-9466-6openalex-snapshot
Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
inferred← citeshttps://doi.org/10.1007/s10472-021-09738-2openalex-snapshot
Automated non-monotonic reasoning in System P
inferred← citeshttps://doi.org/10.1007/s10479-026-07098-wopenalex-snapshot
Variable aggregation and its effect on union bounding problem
inferred← citeshttps://doi.org/10.1007/s10601-015-9201-2openalex-snapshot
Projection, consistency, and George Boole
inferred← citeshttps://doi.org/10.1007/s10817-020-09558-9openalex-snapshot
Probably Partially True: Satisfiability for Łukasiewicz Infinitely-Valued Probabilistic Logic and Related Topics
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00050-nopenalex-snapshot
Boole's conditions of possible experience and reasoning under uncertainty
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90122-8openalex-snapshot
A column generation approach to job grouping for flexible manufacturing systems
inferred← citeshttps://doi.org/10.1016/b978-1-4832-8287-9.50034-7openalex-snapshot
Empirical Probabilities in Monadic Deductive Databases
inferred← citeshttps://doi.org/10.1016/j.artint.2004.04.003openalex-snapshot
Combining probabilistic logic programming with the power of maximum entropy
inferred← citeshttps://doi.org/10.1016/j.artint.2015.06.006openalex-snapshot
Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation
inferred← citeshttps://doi.org/10.1016/j.asoc.2015.03.017openalex-snapshot
Bee colony optimization for the satisfiability problem in probabilistic logic
inferred← citeshttps://doi.org/10.1016/j.ijar.2007.03.001openalex-snapshot
Merging the local and global approaches to probabilistic satisfiability
inferred← citeshttps://doi.org/10.1016/j.ijar.2008.03.005openalex-snapshot
An anytime deduction algorithm for the probabilistic logic and entailment problems
inferred← citeshttps://doi.org/10.1016/j.ijar.2023.108942openalex-snapshot
A further step for efficient corrections of inconsistent probabilistic data sets
inferred← citeshttps://doi.org/10.1016/j.jal.2014.01.005openalex-snapshot
Towards classifying propositional probabilistic logics
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.04.026openalex-snapshot
Consistency checking and querying in probabilistic databases under integrity constraints
inferred← citeshttps://doi.org/10.1016/j.probengmech.2022.103335openalex-snapshot
A nested hierarchy of second order upper bounds on system failure probability
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00116-xopenalex-snapshot
Best second order bounds for two-terminal network reliability with dependent edge failures
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00059-3openalex-snapshot
Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00179-3openalex-snapshot
On consistency in probabilistic logic for logical formulas represented by B-hypertrees
inferred← citeshttps://doi.org/10.1016/s0888-613x(00)00033-5openalex-snapshot
Probabilistic satisfiability with imprecise probabilities
inferred← citeshttps://doi.org/10.1016/s0888-613x(99)00006-7openalex-snapshot
Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events
inferred← citeshttps://doi.org/10.1023/a:1012332915908openalex-snapshot
Easy Cases of Probabilistic Satisfiability
inferred← citeshttps://doi.org/10.1023/a:1020521718123openalex-snapshot
Mathematical Programming Embeddings of Logic
inferred← citeshttps://doi.org/10.1051/ro/1994280302831openalex-snapshot
Approximation algorithms for integer covering problems via greedy column generation
inferred← citeshttps://doi.org/10.1109/nafips.2006.365434openalex-snapshot
An Anytime Deduction Algorithm for the Probabilistic Logic and Entailment Problems
inferred← citeshttps://doi.org/10.1142/s0218488597000245openalex-snapshot
Reasoning with Uncertainty in Deductive Databases and Logic Programs
inferred← citeshttps://doi.org/10.1145/266714.266863openalex-snapshot
Efficient global probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events
inferred← citeshttps://doi.org/10.1145/377978.377983openalex-snapshot
Probabilistic logic programming with conditional constraints
inferred← citeshttps://doi.org/10.11606/d.45.2011.tde-02062011-181639openalex-snapshot
Satisfazibilidade probabilística
inferred← citeshttps://doi.org/10.11606/t.45.2016.tde-04042016-045006openalex-snapshot
Measuring inconsistency in probabilistic knowledge bases
inferred← citeshttps://doi.org/10.11606/t.45.2021.tde-17062021-163257openalex-snapshot
Semantics modulo satisfiability with applications: function representation, probabilities and game theory
inferred← citeshttps://doi.org/10.1287/moor.2014.0657openalex-snapshot
Polynomially Computable Bounds for the Probability of the Union of Events
inferred← citeshttps://doi.org/10.1287/moor.2023.0019openalex-snapshot
Boole’s Probability Bounding Problem, Linear Programming Aggregations, and Nonnegative Quadratic Pseudo-Boolean Functions
inferred← citeshttps://doi.org/10.1287/opre.2018.1795openalex-snapshot
Mass Customization and “Forecasting Options’ Penetration Rates Problem”
inferred← citeshttps://doi.org/10.1613/jair.4883openalex-snapshot
Knowledge Representation in Probabilistic Spatio-Temporal Knowledge Bases
inferred← citeshttps://doi.org/10.1613/jair.577openalex-snapshot
Probabilistic Deduction with Conditional Constraints over Basic Events
inferred← citeshttps://doi.org/10.26481/dis.19921009aoopenalex-snapshot
Production planning for flexible manufacturing systems
inferred← citeshttps://doi.org/10.48550/arxiv.1301.7397openalex-snapshot
Magic Inference Rules for Probabilistic Deduction under Taxonomic Knowledge
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.