On the public citation graph

New methods for computing inferences in first order logic

https://doi.org/10.1007/bf02027814

0 signed · 32 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-3-031-32726-1openalex-snapshot

Integer Programming and Combinatorial Optimization

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/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(86)90031-7openalex-snapshot

Probabilistic 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-9236(94)90031-0openalex-snapshot

Bayesian logic

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/0743-1066(89)90009-5openalex-snapshot

Algorithms for testing the satisfiability of propositional formulae

inferredcites →https://doi.org/10.1016/0743-1066(93)90018-copenalex-snapshot

Solving the incremental satisfiability problem

inferredcites →https://doi.org/10.1016/0885-064x(88)90006-4openalex-snapshot

Probabilistic satisfiability

inferredcites →https://doi.org/10.1016/c2009-0-27551-9openalex-snapshot

Logical Foundations of Artificial Intelligence

inferredcites →https://doi.org/10.1145/102782.102789openalex-snapshot

Extended Horn sets in propositional logic

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/2269326openalex-snapshot

A note on the Entscheidungsproblem

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-61377-3_31openalex-snapshot

Deduction by combining semantic tableaux and integer programming

inferred← citeshttps://doi.org/10.1007/978-1-4020-2653-9openalex-snapshot

Automated Model Building

inferred← citeshttps://doi.org/10.1007/978-3-7908-1831-4_2openalex-snapshot

Proof Theory of Many-Valued Logic and Linear Optimization

inferred← citeshttps://doi.org/10.1007/bf01530787openalex-snapshot

Many-valued logic and mixed integer programming

inferred← citeshttps://doi.org/10.1007/s005000050012openalex-snapshot

Proof theory of many-valued logic--linear optimization--logic design: connections and interactions

inferred← citeshttps://doi.org/10.1016/0743-1066(93)90018-copenalex-snapshot

Solving the incremental satisfiability problem

inferred← citeshttps://doi.org/10.1016/j.eswa.2010.11.061openalex-snapshot

Solving the multi-stage portfolio optimization problem with a novel particle swarm optimization

inferred← citeshttps://doi.org/10.1023/a:1015854101244openalex-snapshot

Partial Instantiation Methods for Inference in First-Order Logic

inferred← citeshttps://doi.org/10.1023/a:1020521718123openalex-snapshot

Mathematical Programming Embeddings of Logic

inferred← citeshttps://doi.org/10.1109/cmpsac.1997.624790openalex-snapshot

Partial instantiation theorem proving for distributed resource location

inferred← citeshttps://doi.org/10.48550/arxiv.1910.13975openalex-snapshot

A Brief Tour of Logic and Optimization

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.