On the public citation graph

Resolution and the integrality of satisfiability problems

https://doi.org/10.1007/bf02592142
0 signed · 37 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/bf01584535openalex-snapshot
Balanced matrices
inferredcites →https://doi.org/10.1007/bf02241270openalex-snapshot
Algorithms for the maximum satisfiability problem
inferredcites →https://doi.org/10.1007/bfb0121244openalex-snapshot
On balanced matrices
inferredcites →https://doi.org/10.1016/0004-3702(86)90031-7openalex-snapshot
Probabilistic logic
inferredcites →https://doi.org/10.1016/0020-0190(87)90028-7openalex-snapshot
On the complexity of the maximum satisfiability problem for horn formulas
inferredcites →https://doi.org/10.1016/0167-9236(94)00055-7openalex-snapshot
A linear programming framework for logics of uncertainty
inferredcites →https://doi.org/10.1016/0167-9236(94)90031-0openalex-snapshot
Bayesian logic
inferredcites →https://doi.org/10.1016/0304-3975(85)90144-6openalex-snapshot
The intractability of resolution
inferredcites →https://doi.org/10.1016/0885-064x(88)90006-4openalex-snapshot
Probabilistic satisfiability
inferredcites →https://doi.org/10.1016/b978-0-7204-2233-7.50001-0openalex-snapshot
STUDIES IN LOGIC AND THE FOUNDATIONS OF MATHEMATICS
inferredcites →https://doi.org/10.1016/c2009-0-27551-9openalex-snapshot
Logical Foundations of Artificial Intelligence
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
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.1109/sfcs.1992.267784openalex-snapshot
A class of logic problems solvable by linear programming
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1287/ijoc.3.2.135openalex-snapshot
Column Generation Methods for Probabilistic Logic
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming

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-59408-6_63openalex-snapshot
(0, ±1) ideal matrices
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/bf01581169openalex-snapshot
(0, ±1) ideal matrices
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.033openalex-snapshot
Balanced matrices
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00344-4openalex-snapshot
Ideal clutters
inferred← citeshttps://doi.org/10.1016/s0377-2217(00)00056-4openalex-snapshot
Perfect, ideal and balanced matrices
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12006-4openalex-snapshot
Balanced Matrices
inferred← citeshttps://doi.org/10.1023/a:1011921025322openalex-snapshot
Using a Hybrid Genetic-Algorithm/Branch and Bound Approach to Solve Feasibility and Optimization Integer Programming Problems
inferred← citeshttps://doi.org/10.1023/b:anor.0000032572.32788.daopenalex-snapshot
Approximations and Randomization to Boost CSP Techniques
inferred← citeshttps://doi.org/10.1109/cvpr.2005.515openalex-snapshot
Protein Interaction Inference as a MAX-SAT Problem
inferred← citeshttps://doi.org/10.1109/tcad.2003.811450openalex-snapshot
Sub-SAT: a formulation for relaxed boolean satisfiability with applications in routing
inferred← citeshttps://doi.org/10.1112/plms.70199openalex-snapshot
Lower bounds for cube‐ideal set‐systems
inferred← citeshttps://doi.org/10.1137/21m1397325openalex-snapshot
Clean Clutters and Dyadic Fractional Packings
inferred← citeshttps://doi.org/10.1145/505388.505432openalex-snapshot
sub-SAT
inferred← citeshttps://doi.org/10.1155/asp/2006/37349openalex-snapshot
Towards Inferring Protein Interactions: Challenges and Solutions
inferred← citeshttps://doi.org/10.1201/9781420049503-c33openalex-snapshot
Integer Programming
inferred← citeshttps://doi.org/10.1287/moor.23.2.322openalex-snapshot
Perfect and Ideal 0, ±1 Matrices
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.