On the public citation graph
Lower bounds for resolution and cutting plane proofs and monotone computations
0 signed · 410 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/3-540-27477-4_16openalex-snapshot
The Complexity of Boolean Functions
inferredcites →https://doi.org/10.1007/3-540-60178-3_86openalex-snapshot
Some consequences of cryptographical conjectures for S 2 1 and EF
inferredcites →https://doi.org/10.1007/bf01845704openalex-snapshot
Cutting planes, connectivity, and threshold logic
inferredcites →https://doi.org/10.1007/bf02579196openalex-snapshot
The monotone circuit complexity of boolean functions
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/0024-3795(89)90476-xopenalex-snapshot
On cutting-plane proofs in combinatorial optimization
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/0304-3975(76)90083-9openalex-snapshot
A lower bound on the number of additions in monotone computations
inferredcites →https://doi.org/10.1016/0304-3975(85)90144-6openalex-snapshot
The intractability of resolution
inferredcites →https://doi.org/10.1017/cbo9780511529948openalex-snapshot
Bounded Arithmetic, Propositional Logic and Complexity Theory
inferredcites →https://doi.org/10.1017/s0022481200028061openalex-snapshot
Provability of the pigeonhole principle and the existence of infinitely many primes
inferredcites →https://doi.org/10.1070/im1995v059n01abeh000009openalex-snapshot
Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic
inferredcites →https://doi.org/10.1109/lics.1994.316069openalex-snapshot
Upper and lower bounds for tree-like cutting planes proofs
inferredcites →https://doi.org/10.1109/sfcs.1988.21951openalex-snapshot
The complexity of the pigeonhole principle
inferredcites →https://doi.org/10.1109/sfcs.1995.492460openalex-snapshot
Counting bottlenecks to show monotone P≠NP
inferredcites →https://doi.org/10.1145/129712.129733openalex-snapshot
Exponential lower bounds for the pigeonhole principle
inferredcites →https://doi.org/10.1145/225058.225275openalex-snapshot
Lower bounds for cutting planes proofs with small coefficients
inferredcites →https://doi.org/10.2307/2275250openalex-snapshot
Lower bounds to the size of constant-depth propositional proofs
inferredcites →https://doi.org/10.2307/2275541openalex-snapshot
Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.2307/2963593openalex-snapshot
Linear reasoning. A new form of the Herbrand-Gentzen theorem
inferredcites →https://doi.org/10.2307/2963594openalex-snapshot
Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
inferredcites →https://doi.org/10.2307/3006767openalex-snapshot
Recent Advances in Mathematical 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/1521-3870(200111)47:4<461::aid-malq461>3.0.co;2-bopenalex-snapshot
Monotone Proofs of the Pigeon Hole Principle
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0479openalex-snapshot
Lovász‐Schrijver Reformulation
inferred← citeshttps://doi.org/10.1002/malq.200810008openalex-snapshot
Some applications of propositional logic to cellular automata
inferred← citeshttps://doi.org/10.1002/malq.201010012openalex-snapshot
Nisan-Wigderson generators in proof systems with forms of interpolation
inferred← citeshttps://doi.org/10.1006/inco.1997.2674openalex-snapshot
Some Consequences of Cryptographical Conjectures forS12and EF
inferred← citeshttps://doi.org/10.1006/inco.2002.3114openalex-snapshot
Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution
inferred← citeshttps://doi.org/10.1006/jcss.1997.1480openalex-snapshot
On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In
inferred← citeshttps://doi.org/10.1006/jcss.1998.1617openalex-snapshot
An Exponential Lower Bound for the Size of Monotone Real Circuits
inferred← citeshttps://doi.org/10.1007/10720084_1openalex-snapshot
Combining Logic and Optimization in Cutting Plane Theory
inferred← citeshttps://doi.org/10.1007/10722086_3openalex-snapshot
Local Symmetries in Propositional Logic
inferred← citeshttps://doi.org/10.1007/11494744_2openalex-snapshot
Applications of Craig Interpolation to Model Checking
inferred← citeshttps://doi.org/10.1007/11499107_10openalex-snapshot
Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution
inferred← citeshttps://doi.org/10.1007/11513988_6openalex-snapshot
Interpolant-Based Transition Relation Approximation
inferred← citeshttps://doi.org/10.1007/11523468_95openalex-snapshot
Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity
inferred← citeshttps://doi.org/10.1007/11532231_26openalex-snapshot
A Combination Method for Generating Interpolants
inferred← citeshttps://doi.org/10.1007/11750321_23openalex-snapshot
Disjoint NP-Pairs from Propositional Proof Systems
inferred← citeshttps://doi.org/10.1007/11786986_29openalex-snapshot
Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies
inferred← citeshttps://doi.org/10.1007/11814948_3openalex-snapshot
Complexity of Semialgebraic Proofs with Restricted Degree of Falsity
inferred← citeshttps://doi.org/10.1007/3-540-36184-7_7openalex-snapshot
On Determining the Minimum Length, Tree-Like Resolution Refutation of 2SAT, and Extended 2SAT Formulas
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_13openalex-snapshot
Monotone Proofs of the Pigeon Hole Principle
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_38openalex-snapshot
On the Automatizability of Resolution and Related Propositional Proof Systems
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_34openalex-snapshot
Complexity of Semi-algebraic Proofs
inferred← citeshttps://doi.org/10.1007/3-540-47867-1_11openalex-snapshot
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_11openalex-snapshot
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_116openalex-snapshot
Lower bounds for prepositional proofs and independence results in bounded arithmetic
inferred← citeshttps://doi.org/10.1007/978-1-4419-7518-8_5openalex-snapshot
Ashenhurst Decomposition Using SAT and Interpolation
inferred← citeshttps://doi.org/10.1007/978-3-030-11245-5_14openalex-snapshot
Solving and Interpolating Constant Arrays Based on Weak Equivalences
inferred← citeshttps://doi.org/10.1007/978-3-030-17462-0_1openalex-snapshot
Decomposing Farkas Interpolants
inferred← citeshttps://doi.org/10.1007/978-3-030-24258-9_5openalex-snapshot
DRAT Proofs, Propagation Redundancy, and Extended Resolution
inferred← citeshttps://doi.org/10.1007/978-3-030-29436-6_11openalex-snapshot
NIL: Learning Nonlinear Interpolants
inferred← citeshttps://doi.org/10.1007/978-3-030-51074-9_5openalex-snapshot
How QBF Expansion Makes Strategy Extraction Hard
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_30openalex-snapshot
Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness
inferred← citeshttps://doi.org/10.1007/978-3-030-53288-8_20openalex-snapshot
Nonlinear Craig Interpolant Generation
inferred← citeshttps://doi.org/10.1007/978-3-030-62822-2_9openalex-snapshot
Probably Approximately Correct Interpolants Generation
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-65474-0_16openalex-snapshot
Farkas-Based Tree Interpolation
inferred← citeshttps://doi.org/10.1007/978-3-030-71430-7_18openalex-snapshot
Reflections on Proof Complexity and Counting Principles
inferred← citeshttps://doi.org/10.1007/978-3-030-71995-1_14openalex-snapshot
Interpolation and Amalgamation for Arrays with MaxDiff
inferred← citeshttps://doi.org/10.1007/978-3-030-73879-2_27openalex-snapshot
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II
inferred← citeshttps://doi.org/10.1007/978-3-030-81688-9_13openalex-snapshot
Interpolation and Model Checking for Nonlinear Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-030-99524-9_29openalex-snapshot
Transition Power Abstractions for Deep Counterexample Detection
inferred← citeshttps://doi.org/10.1007/978-3-031-25211-2_2openalex-snapshot
Optimal Length Cutting Plane Refutations of Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-38499-8_15openalex-snapshot
Choose Your Colour: Tree Interpolation for Quantified Formulas in SMT
inferred← citeshttps://doi.org/10.1007/978-3-031-45332-8_7openalex-snapshot
Automated Property Directed Self Composition
inferred← citeshttps://doi.org/10.1007/978-3-031-71162-6_5openalex-snapshot
Nonlinear Craig Interpolant Generation Over Unbounded Domains by Separating Semialgebraic Sets
inferred← citeshttps://doi.org/10.1007/978-3-031-90653-4_5openalex-snapshot
Revisiting DRUP-Based Interpolants with CaDiCaL 2.0
inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_4openalex-snapshot
Bit-Precise Interpolation in Bitwuzla
inferred← citeshttps://doi.org/10.1007/978-3-319-02444-8_19openalex-snapshot
Interpolation Properties and SAT-Based Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_1openalex-snapshot
A (Biased) Proof Complexity Survey for SAT Practitioners
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_11openalex-snapshot
Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_14openalex-snapshot
Interpolation and Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-11439-2_16openalex-snapshot
Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-13338-6_15openalex-snapshot
Reduction of Resolution Refutations and Interpolants via Subsumption
inferred← citeshttps://doi.org/10.1007/978-3-319-15075-8_7openalex-snapshot
Towards Completeness in Bounded Model Checking Through Automatic Recursion Depth Detection
inferred← citeshttps://doi.org/10.1007/978-3-319-23534-9_2openalex-snapshot
Horn Clause Solvers for Program Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-24953-7_5openalex-snapshot
Improving Interpolants for Linear Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-319-29613-5_1openalex-snapshot
A Proof-Sensitive Approach for Small Propositional Interpolants
inferred← citeshttps://doi.org/10.1007/978-3-319-40229-1_14openalex-snapshot
Interpolant Synthesis for Quadratic Polynomial Inequalities and Combination with EUF
inferred← citeshttps://doi.org/10.1007/978-3-319-41540-6_20openalex-snapshot
A SAT-Based Counterexample Guided Method for Unbounded Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-319-46520-3_25openalex-snapshot
Skolem Functions for DQBF
inferred← citeshttps://doi.org/10.1007/978-3-319-49052-6_12openalex-snapshot
Advancing Software Model Checking Beyond Linear Arithmetic Theories
inferred← citeshttps://doi.org/10.1007/978-3-319-58747-9_26openalex-snapshot
Dag-Like Communication and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-59250-3_33openalex-snapshot
High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy and CG Cuts
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_5openalex-snapshot
Parallel Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-319-70389-3_13openalex-snapshot
LRA Interpolants from No Man’s Land
inferred← citeshttps://doi.org/10.1007/978-3-319-73721-8_23openalex-snapshot
Selfless Interpolation for Infinite-State Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-90530-3_24openalex-snapshot
On the Decision Trees with Symmetries
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-3-319-94205-6_36openalex-snapshot
Efficient Interpolation for the Theory of Arrays
inferred← citeshttps://doi.org/10.1007/978-3-319-94418-0_27openalex-snapshot
Computing with SAT Oracles: Past, Present and Future
inferred← citeshttps://doi.org/10.1007/978-3-540-24730-2_2openalex-snapshot
An Interpolating Theorem Prover
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_4openalex-snapshot
Feasible Proofs and Computations: Partnership and Fusion
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_3openalex-snapshot
Applications of Craig Interpolation to Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_9openalex-snapshot
Constraint Propagation as a Proof System
inferred← citeshttps://doi.org/10.1007/978-3-540-31980-1_1openalex-snapshot
Applications of Craig Interpolants in Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_1openalex-snapshot
Interpolation and SAT-Based Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-69738-1_25openalex-snapshot
Constraint Solving for Interpolation
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_24openalex-snapshot
Efficient Craig Interpolation for Linear Diophantine (Dis)Equations and Linear Modular Equations
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_10openalex-snapshot
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
inferred← citeshttps://doi.org/10.1007/978-3-540-78163-9_10openalex-snapshot
Approximation Refinement for Interpolation-Based Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-78800-3_30openalex-snapshot
Efficient Interpolant Generation in Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_28openalex-snapshot
Logical Closure Properties of Propositional Proof Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-79709-8_4openalex-snapshot
Twelve Problems in Proof Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-00768-2_32openalex-snapshot
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-00768-2_34openalex-snapshot
Ground Interpolation for the Theory of Equality
inferred← citeshttps://doi.org/10.1007/978-3-642-03251-6_4openalex-snapshot
Challenges in Constraint-Based Analysis of Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-04420-5_17openalex-snapshot
Abstract Counterexamples for Non-disjunctive Abstractions
inferred← citeshttps://doi.org/10.1007/978-3-642-11957-6_11openalex-snapshot
Propositional Interpolation and Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-642-13562-0_3openalex-snapshot
Proof Complexity of Non-classical Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_10openalex-snapshot
Mean-Payoff Games and Propositional Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-14203-1_33openalex-snapshot
An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_28openalex-snapshot
Improving Integrality Gaps via Chvátal-Gomory Rounding
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_35openalex-snapshot
Interpolating Quantifier-Free Presburger Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-642-19237-1_15openalex-snapshot
An Interpolating Decision Procedure for Transitive Relations with Uninterpreted Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-19835-9_13openalex-snapshot
Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-642-19835-9_14openalex-snapshot
Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_53openalex-snapshot
Parameterized Bounded-Depth Frege Is Not Optimal
inferred← citeshttps://doi.org/10.1007/978-3-642-22119-4_1openalex-snapshot
On Interpolation in Decision Procedures
inferred← citeshttps://doi.org/10.1007/978-3-642-24310-3_17openalex-snapshot
Craig Interpolation in the Presence of Non-linear Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-24508-4openalex-snapshot
Boolean Function Complexity: Advances and Frontiers
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_11openalex-snapshot
Interpolants as Classifiers
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_18openalex-snapshot
Leveraging Interpolant Strength in Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-31485-8_1openalex-snapshot
Proof Complexity of Non-classical Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_24openalex-snapshot
Interpolant Strength Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-32770-4_4openalex-snapshot
Improvements to Satisfiability-Based Boolean Function Bi-Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-642-34188-5_15openalex-snapshot
Interpolation-Based Function Summaries in Bounded Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_20openalex-snapshot
Unbounded Model-Checking with Interpolation for Regular Language Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_9openalex-snapshot
Proof Tree Preserving Interpolation
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_26openalex-snapshot
A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem
inferred← citeshttps://doi.org/10.1007/978-3-642-39611-3_12openalex-snapshot
Computing Interpolants without Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_23openalex-snapshot
Efficient Generation of Small Interpolants in CNF
inferred← citeshttps://doi.org/10.1007/978-3-642-45114-0_3openalex-snapshot
A Parametric Interpolation Framework for First-Order Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_45openalex-snapshot
PeRIPLO: A Framework for Producing Effective Interpolants in SAT-Based Software Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_5openalex-snapshot
Propositional Proof Complexity an Introduction
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_84openalex-snapshot
Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-46675-9_13openalex-snapshot
Symbolic Detection of Assertion Dependencies for Bounded Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_15openalex-snapshot
Feasible Interpolation for QBF Resolution Calculi
inferred← citeshttps://doi.org/10.1007/978-3-662-49665-7_25openalex-snapshot
PVAIR: Partial Variable Assignment InterpolatoR
inferred← citeshttps://doi.org/10.1007/978-3-662-49674-9_41openalex-snapshot
Interpolants in Nonlinear Theories Over the Reals
inferred← citeshttps://doi.org/10.1007/978-3-662-59533-6_21openalex-snapshot
An Exponential Lower Bound for Proofs in Focused Calculi
inferred← citeshttps://doi.org/10.1007/bfb0055762openalex-snapshot
Satisfiability — Algorithms and logic
inferred← citeshttps://doi.org/10.1007/s00037-004-0183-5openalex-snapshot
Non-Automatizability of Bounded-Depth Frege Proofs
inferred← citeshttps://doi.org/10.1007/s00037-013-0064-xopenalex-snapshot
Lifting lower bounds for tree-like proofs
inferred← citeshttps://doi.org/10.1007/s00153-005-0325-8openalex-snapshot
Upper bounds on complexity of Frege proofs with limited use of certain schemata
inferred← citeshttps://doi.org/10.1007/s00453-010-9475-0openalex-snapshot
Exponential Lower Bounds on the Complexity of a Class of Dynamic Programs for Combinatorial Optimization Problems
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/s00493-003-0020-5openalex-snapshot
Bounds on the Chv�tal Rank of Polytopes in the 0/1-Cube*
inferred← citeshttps://doi.org/10.1007/s00493-022-4884-7openalex-snapshot
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization — II
inferred← citeshttps://doi.org/10.1007/s10009-015-0405-yopenalex-snapshot
Flexible SAT-based framework for incremental bounded upgrade checking
inferred← citeshttps://doi.org/10.1007/s10009-021-00641-zopenalex-snapshot
Using linear algebra in decomposition of Farkas interpolants
inferred← citeshttps://doi.org/10.1007/s10107-018-1302-4openalex-snapshot
Theoretical challenges towards cutting-plane selection
inferred← citeshttps://doi.org/10.1007/s10107-022-01781-zopenalex-snapshot
Lower bounds on the size of general branch-and-bound trees
inferred← citeshttps://doi.org/10.1007/s10107-022-01789-5openalex-snapshot
Complexity of branch-and-bound and cutting planes in mixed-integer optimization
inferred← citeshttps://doi.org/10.1007/s10107-022-01862-zopenalex-snapshot
Complexity of optimizing over the integers
inferred← citeshttps://doi.org/10.1007/s10472-015-9493-3openalex-snapshot
How to deal with unbelievable assertions
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-008-9060-1openalex-snapshot
SymChaff: exploiting symmetry in a structure-aware satisfiability solver
inferred← citeshttps://doi.org/10.1007/s10703-009-0069-xopenalex-snapshot
Efficient Craig interpolation for linear Diophantine (dis)equations and linear modular equations
inferred← citeshttps://doi.org/10.1007/s10703-011-0123-3openalex-snapshot
Benchmarking a model checker for algorithmic improvements and tuning for performance
inferred← citeshttps://doi.org/10.1007/s10703-014-0208-xopenalex-snapshot
Resolution proof transformation for compression and interpolation
inferred← citeshttps://doi.org/10.1007/s10703-015-0224-5openalex-snapshot
Efficient generation of small interpolants in CNF
inferred← citeshttps://doi.org/10.1007/s10703-019-00342-zopenalex-snapshot
Exploiting partial variable assignment in interpolation-based model checking
inferred← citeshttps://doi.org/10.1007/s10703-023-00423-0openalex-snapshot
SMT-based verification of program changes through summary repair
inferred← citeshttps://doi.org/10.1007/s10817-009-9139-4openalex-snapshot
Optimal Length Resolution Refutations of Difference Constraint Systems
inferred← citeshttps://doi.org/10.1007/s10817-015-9325-5openalex-snapshot
Interpolation Systems for Ground Proofs in Automated Deduction: a Survey
inferred← citeshttps://doi.org/10.1007/s10817-016-9364-6openalex-snapshot
Labelled Interpolation Systems for Hyper-Resolution, Clausal, and Local Proofs
inferred← citeshttps://doi.org/10.1007/s10817-016-9365-5openalex-snapshot
Proof Tree Preserving Tree Interpolation
inferred← citeshttps://doi.org/10.1007/s10817-021-09609-9openalex-snapshot
Proof Complexity of Modal Resolution
inferred← citeshttps://doi.org/10.1007/s10958-007-0329-5openalex-snapshot
Lower bounds on static Lovász-Schrijver calculus proofs for Tseitin tautologies
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50014-xopenalex-snapshot
Solving Numerical Constraints
inferred← citeshttps://doi.org/10.1016/j.apal.2005.12.006openalex-snapshot
Several notes on the power of Gomory–Chvátal cuts
inferred← citeshttps://doi.org/10.1016/j.apal.2008.04.001openalex-snapshot
Resolution over linear equations and multilinear proofs
inferred← citeshttps://doi.org/10.1016/j.apal.2011.09.009openalex-snapshot
Towards NP – P via proof complexity and search
inferred← citeshttps://doi.org/10.1016/j.apal.2021.102972openalex-snapshot
Proof complexity of substructural logics
inferred← citeshttps://doi.org/10.1016/j.apal.2026.103808openalex-snapshot
Completeness of interpolation algorithms in classical and non-classical logics
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103552openalex-snapshot
Propositional proof systems based on maximum satisfiability
inferred← citeshttps://doi.org/10.1016/j.dam.2016.04.024openalex-snapshot
Lower bounds for monotone counting circuits
inferred← citeshttps://doi.org/10.1016/j.dam.2023.02.001openalex-snapshot
Proving the infeasibility of Horn formulas through read-once resolution
inferred← citeshttps://doi.org/10.1016/j.disopt.2023.100806openalex-snapshot
Optimal length cutting plane refutations of integer programs
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.12.021openalex-snapshot
Interpolant Learning and Reuse in SAT-Based Model Checking
inferred← citeshttps://doi.org/10.1016/j.ic.2003.10.004openalex-snapshot
On the automatizability of resolution and related propositional proof systems
inferred← citeshttps://doi.org/10.1016/j.ic.2011.01.003openalex-snapshot
Mean-payoff games and propositional proofs
inferred← citeshttps://doi.org/10.1016/j.ic.2018.08.002openalex-snapshot
Understanding cutting planes for QBFs
inferred← citeshttps://doi.org/10.1016/j.infsof.2023.107298openalex-snapshot
Formal synthesis of neural Craig interpolant via counterexample guided deep learning
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.11.002openalex-snapshot
A note on monotone real circuits
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.04.007openalex-snapshot
On semantic cutting planes with very small coefficients
inferred← citeshttps://doi.org/10.1016/j.jalgor.2008.02.007openalex-snapshot
Model checking with Boolean Satisfiability
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.11.011openalex-snapshot
A game characterisation of tree-like Q-Resolution size
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.06.005openalex-snapshot
Constraint solving for interpolation
inferred← citeshttps://doi.org/10.1016/j.orl.2009.10.010openalex-snapshot
On the complexity of cutting-plane proofs using split cuts
inferred← citeshttps://doi.org/10.1016/j.orl.2012.03.008openalex-snapshot
Cutting planes cannot approximate some integer programs
inferred← citeshttps://doi.org/10.1016/j.scico.2011.07.006openalex-snapshot
Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.07.003openalex-snapshot
An interpolating theorem prover
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.005openalex-snapshot
Classes of representable disjoint NP-pairs
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.05.021openalex-snapshot
Nondeterministic functions and the existence of optimal proof systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.12.011openalex-snapshot
The complexity of the Hajós calculus for planar graphs
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)00079-9openalex-snapshot
Lower bounds for monotone real circuit depth and formula size and tree-like Cutting Planes
inferred← citeshttps://doi.org/10.1016/s0022-0000(02)00020-xopenalex-snapshot
Monotone simulations of non-monotone proofs
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00040-9openalex-snapshot
On the computational content of intuitionistic propositional proofs
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00142-5openalex-snapshot
No feasible monotone interpolation for simple combinatorial reasoning
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12004-0openalex-snapshot
Integer Programming, Lattices, and Results in Fixed Dimension
inferred← citeshttps://doi.org/10.1017/9781108242066.006openalex-snapshot
Quantified Propositional Calculus
inferred← citeshttps://doi.org/10.1017/9781108242066.008openalex-snapshot
Algebraic and Geometric Proof Systems
showing the first 200 of 385 · page through all 385
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.