On the public citation graph
Generalized resolution and cutting planes
0 signed · 108 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.1007/978-3-662-09438-9openalex-snapshot
Principles of Artificial Intelligence
inferredcites →https://doi.org/10.1007/978-94-011-7557-9_14openalex-snapshot
Characterisations of Totally Unimodular, Balanced and Perfect Matrices
inferredcites →https://doi.org/10.1007/bf01582278openalex-snapshot
On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}
inferredcites →https://doi.org/10.1016/0004-3702(80)90026-0openalex-snapshot
Principles of artificial intelligence
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/0166-218x(87)90039-4openalex-snapshot
On the complexity of cutting-plane proofs
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)90127-3openalex-snapshot
On monotone chaining procedures of the CF type
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.1017/s0022481200031406openalex-snapshot
Krister Segerberg. The logic of deliberate action. Journal of philosophical logic, vol. 11 (1982),pp. 233–254.
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/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.2307/2273702openalex-snapshot
The relative efficiency of propositional proof systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/aic.690430911openalex-snapshot
Implicit model checking of logic‐based control systems
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_363openalex-snapshot
Optimization in Boolean Classification Problems
inferred← citeshttps://doi.org/10.1007/10720084_1openalex-snapshot
Combining Logic and Optimization in Cutting Plane Theory
inferred← citeshttps://doi.org/10.1007/3-540-45349-0_15openalex-snapshot
Cutting Planes in Constraint Programming: An Hybrid Approach
inferred← citeshttps://doi.org/10.1007/3-540-54487-9_59openalex-snapshot
Cutting plane versus frege proof systems
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_132openalex-snapshot
Two proof procedures for a cardinality based language in propositional calculus
inferred← citeshttps://doi.org/10.1007/3-540-59155-9_2openalex-snapshot
Solving pseudo-Boolean constraints
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_479openalex-snapshot
Optimization in Boolean Classification Problems
inferred← citeshttps://doi.org/10.1007/978-1-4612-1492-2_5openalex-snapshot
Parallel Algorithms for Satisfiability (SAT) Testing
inferred← citeshttps://doi.org/10.1007/978-1-4613-3629-7_6openalex-snapshot
Optimization Algorithms for the Satisfiability (SAT) Problem
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-51825-7_23openalex-snapshot
On Weakening Strategies for PB Solvers
inferred← citeshttps://doi.org/10.1007/978-3-030-64843-5_19openalex-snapshot
On Unit Read-Once Resolutions and Copy Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_15openalex-snapshot
Non-clausal Redundancy Properties
inferred← citeshttps://doi.org/10.1007/978-3-030-80223-3_22openalex-snapshot
On Dedicated CDCL Strategies for PB Solvers
inferred← citeshttps://doi.org/10.1007/978-3-030-99524-9_25openalex-snapshot
Clausal Proofs for Pseudo-Boolean Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-032-27242-3_10openalex-snapshot
Resolution Meets Cutting Planes: Introducing Hypercube Linear Resolution
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_22openalex-snapshot
Detecting Cardinality Constraints in CNF
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_18openalex-snapshot
In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving
inferred← citeshttps://doi.org/10.1007/978-94-009-2203-7_8openalex-snapshot
Default Reasoning Through Integer Linear Programming
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/bf01531033openalex-snapshot
Generalized resolution for 0?1 linear inequalities
inferred← citeshttps://doi.org/10.1007/bf01531068openalex-snapshot
Polynomial-time inference of all valid implications for Horn and related formulae
inferred← citeshttps://doi.org/10.1007/bf01531074openalex-snapshot
Branch-and-cut solution of inference problems in propositional logic
inferred← citeshttps://doi.org/10.1007/bf02027814openalex-snapshot
New methods for computing inferences in first order logic
inferred← citeshttps://doi.org/10.1007/bf02283686openalex-snapshot
Computational experience with an interior point algorithm on the satisfiability problem
inferred← citeshttps://doi.org/10.1007/bf02952482openalex-snapshot
On optimizing the satisfiability (SAT) problem
inferred← citeshttps://doi.org/10.1007/bfb0023767openalex-snapshot
Logical inference and polyhedral projection
inferred← citeshttps://doi.org/10.1007/s00453-022-01048-1openalex-snapshot
Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling
inferred← citeshttps://doi.org/10.1007/s10107-022-01778-8openalex-snapshot
Achieving consistency with cutting planes
inferred← citeshttps://doi.org/10.1007/s101070050061openalex-snapshot
Tight representation of logical constraints as cardinality rules
inferred← citeshttps://doi.org/10.1007/s10472-022-09800-7openalex-snapshot
On the lengths of tree-like and Dag-like cutting plane refutations of Horn constraint systems
inferred← citeshttps://doi.org/10.1007/s10601-015-9201-2openalex-snapshot
Projection, consistency, and George Boole
inferred← citeshttps://doi.org/10.1007/s10601-020-09318-xopenalex-snapshot
Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search
inferred← citeshttps://doi.org/10.1007/s11241-023-09408-yopenalex-snapshot
Cutting-plane algorithms for preemptive uniprocessor scheduling problems
inferred← citeshttps://doi.org/10.1016/0167-6377(88)90044-2openalex-snapshot
Resolution vs. cutting plane solution of inference problems: Some computational experience
inferred← citeshttps://doi.org/10.1016/0305-0548(90)90062-copenalex-snapshot
Modeling and integer programming techniques applied to propositional calculus
inferred← citeshttps://doi.org/10.1016/0305-0548(94)00056-eopenalex-snapshot
Improving the performance of enumerative search methods-I. Exploiting structure and intelligence
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)00016-fopenalex-snapshot
Improving the performance of enumerative search methods—part II: Computational experiments
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/0377-2217(93)e0359-6openalex-snapshot
Logic applied to integer programming and integer programming applied to logic
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/b978-044450813-3/50014-xopenalex-snapshot
Solving Numerical Constraints
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.2021.08.017openalex-snapshot
Copy complexity of Horn formulas with respect to unit read-once resolution
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00144-6openalex-snapshot
A linear-time transformation of linear inequalities into conjunctive normal form
inferred← citeshttps://doi.org/10.1016/s0020-0255(03)00065-3openalex-snapshot
Experimental complexity analysis of continuous constraint satisfaction problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00035-9openalex-snapshot
The Multi-SAT algorithm
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00100-6openalex-snapshot
Mixed logical-linear programming
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00316-0openalex-snapshot
Perspectives on operations research in data and knowledge management
inferred← citeshttps://doi.org/10.1109/12.485373openalex-snapshot
Convergence properties of optimization algorithms for the SAT problem
inferred← citeshttps://doi.org/10.1109/69.334864openalex-snapshot
Global optimization for satisfiability (SAT) problem
inferred← citeshttps://doi.org/10.1109/cacsd.2000.900200openalex-snapshot
Implicit model checking: formal verification technique for large-scale discrete systems
inferred← citeshttps://doi.org/10.1109/icse.2007.59openalex-snapshot
OPIUM: Optimal Package Install/Uninstall Manager
inferred← citeshttps://doi.org/10.1109/isic.1988.65439openalex-snapshot
A system for reasoning by minimizing exception
inferred← citeshttps://doi.org/10.1109/lics.1992.185542openalex-snapshot
Cutting planes and constant depth Frege proofs
inferred← citeshttps://doi.org/10.1109/tste.2025.3556155openalex-snapshot
An RL-Based Strategy for Optimal Power and Gas Flow Calculation
inferred← citeshttps://doi.org/10.1145/143559.143681openalex-snapshot
A cost effective question asking strategy
inferred← citeshttps://doi.org/10.1145/3180155.3180257openalex-snapshot
Multi-objective integer programming approaches for solving optimal feature selection problem
inferred← citeshttps://doi.org/10.1145/3677121openalex-snapshot
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations
inferred← citeshttps://doi.org/10.1287/ijoc.10.3.261openalex-snapshot
Connections Between Integer Linear Programming and Constraint Logic Programming—An Overview and Introduction to the Cluster of Articles
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.4.295.2828openalex-snapshot
Logic, Optimization, and Constraint Programming
inferred← citeshttps://doi.org/10.1287/ijoc.2024.0999openalex-snapshot
Cut-Based Conflict Analysis in Mixed Integer Programming
inferred← citeshttps://doi.org/10.1287/opre.49.1.42.11196openalex-snapshot
Optimal Design of Truss Structures by Logic-Based Branch and Cut
inferred← citeshttps://doi.org/10.14288/1.0043903openalex-snapshot
Survey on integrating cutting planes in CDCL solvers
inferred← citeshttps://doi.org/10.1541/ieejeiss1987.114.7-8_796openalex-snapshot
An Algorithm for β Clause Satisfiability Problem in Propositional Logic
inferred← citeshttps://doi.org/10.1609/aaai.v34i02.5508openalex-snapshot
A Cardinal Improvement to Pseudo-Boolean Solving
inferred← citeshttps://doi.org/10.1613/jair.1555openalex-snapshot
Generalizing Boolean Satisfiability II: Theory
inferred← citeshttps://doi.org/10.1613/jair.1656openalex-snapshot
Generalizing Boolean Satisfiability III: Implementation
inferred← citeshttps://doi.org/10.24963/ijcai.2018/261openalex-snapshot
Pseudo-Boolean Constraints from a Knowledge Representation Perspective
inferred← citeshttps://doi.org/10.24963/ijcai.2019/237openalex-snapshot
On Division Versus Saturation in Pseudo-Boolean Solving
inferred← citeshttps://doi.org/10.3233/sat190020openalex-snapshot
Pueblo: A Hybrid Pseudo-Boolean SAT Solver
inferred← citeshttps://doi.org/10.48550/arxiv.1910.13975openalex-snapshot
A Brief Tour of Logic and Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.2006.10836openalex-snapshot
An Integer Linear Programming Framework for Mining Constraints from Data
inferred← citeshttps://doi.org/10.5555/1622487.1622502openalex-snapshot
Generalizing Boolean satisfiability II
inferred← citeshttps://doi.org/10.70675/41a21d4bz191ez4409za183z754a7064aeafopenalex-snapshot
Raisonnement à partir de contraintes pseudo-booléennes et compilation
inferred← citeshttps://doi.org/10.70675/4a8859a0z611ez41eezbcd9zacdf7026c150openalex-snapshot
Optimisation booléenne multiobjectif : complexité sous contraintes compilées et résolution via SAT
inferred← citeshttps://doi.org/10.70675/adbba29czefedz4ad5zb321z6fbb66d9c5f7openalex-snapshot
Optimization of passenger flows and resources management through machine learning and constraint programming techniques
inferred← citeshttps://doi.org/10.7551/mitpress/4298.003.0022openalex-snapshot
Finite Domain and Cutting Plane Techniques in CLP(PB)
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.