On the public citation graph
Short proofs for tricky formulas
0 signed · 136 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-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-94-009-2356-0_12openalex-snapshot
Towards Feasible Solutions of the Tautology Problem
inferredcites →https://doi.org/10.1016/0304-3975(85)90144-6openalex-snapshot
The intractability of resolution
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1016/s0020-0190(80)90082-4openalex-snapshot
A simplified proof that regular resolution is exponential
inferredcites →https://doi.org/10.1137/1021086openalex-snapshot
Graph Theory with Applications (J. A. Bondy and U. S. R. Murty)
inferredcites →https://doi.org/10.1145/1008335.1008338openalex-snapshot
A short proof of the pigeon hole principle using extended resolution
inferredcites →https://doi.org/10.1145/1811123.1811124openalex-snapshot
A note on disjunctive form tautologies
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/800076.802454openalex-snapshot
Examples of hard tautologies in the propositional calculus
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.1007/10722086_3openalex-snapshot
Local Symmetries in Propositional Logic
inferred← citeshttps://doi.org/10.1007/11499107_21openalex-snapshot
Input Distance and Lower Bounds for Propositional Resolution Proof Length
inferred← citeshttps://doi.org/10.1007/11564751_27openalex-snapshot
2 -Way vs.d -Way Branching for CSP
inferred← citeshttps://doi.org/10.1007/11591191_40openalex-snapshot
Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning
inferred← citeshttps://doi.org/10.1007/11814948_7openalex-snapshot
Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs
inferred← citeshttps://doi.org/10.1007/11889205_48openalex-snapshot
Reasoning by Dominance in Not-Equals Binary Constraint Networks
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_42openalex-snapshot
The Complexity of Resolution with Generalized Symmetry Rules
inferred← citeshttps://doi.org/10.1007/3-540-45620-1_15openalex-snapshot
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points
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-54487-9_67openalex-snapshot
Ramsey's theorem in bounded arithmetic
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_172openalex-snapshot
Theoretical study of symmetries in propositional calculus and applications
inferred← citeshttps://doi.org/10.1007/3-540-56944-8_46openalex-snapshot
A first order resolution calculus with symmetries
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-60428-6_3openalex-snapshot
Super-polynomial speed-ups in proof length by new tautologies
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_108openalex-snapshot
Ground resolution with group computations on semantic symmetries
inferred← citeshttps://doi.org/10.1007/978-0-387-34768-4_3openalex-snapshot
A Natural Proof System Based on Rewriting Techniques
inferred← citeshttps://doi.org/10.1007/978-1-4612-2566-9_3openalex-snapshot
Are there Hard Examples for Frege Systems?
inferred← citeshttps://doi.org/10.1007/978-3-030-24258-9_3openalex-snapshot
Proof Complexity of QBF Symmetry Recomputation
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_29openalex-snapshot
Short Q-Resolution Proofs with Homomorphisms
inferred← citeshttps://doi.org/10.1007/978-3-031-10769-6_24openalex-snapshot
Formula Simplification via Invariance Detection by Algebraically Indexed Types
inferred← citeshttps://doi.org/10.1007/978-3-319-13770-4_12openalex-snapshot
Dynamic Symmetry Breaking in Itemset Mining
inferred← citeshttps://doi.org/10.1007/978-3-319-21810-6_7openalex-snapshot
SAT encodings of a classical problem: a case study
inferred← citeshttps://doi.org/10.1007/978-3-319-25840-9_10openalex-snapshot
A Generic and Declarative Method for Symmetry Breaking in Itemset Mining
inferred← citeshttps://doi.org/10.1007/978-3-319-66263-3_6openalex-snapshot
Symmetric Explanation Learning: Effective Dynamic Symmetry Handling for SAT
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-540-24605-3_9openalex-snapshot
Local Search on SAT-encoded Colouring Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_1openalex-snapshot
Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_16openalex-snapshot
Local Symmetry Breaking During Search in CSPs
inferred← citeshttps://doi.org/10.1007/978-3-540-79719-7_26openalex-snapshot
Regular and General Resolution: An Improved Separation
inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_1openalex-snapshot
Symmetry Breaking for Maximum Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_14openalex-snapshot
An Exponential Lower Bound for Width-Restricted Clause Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_4openalex-snapshot
Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas
inferred← citeshttps://doi.org/10.1007/978-3-642-22438-6_18openalex-snapshot
Exploiting Symmetry in SMT Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_5openalex-snapshot
An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-40537-2_4openalex-snapshot
Dealing with Symmetries in Modal Tableaux
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_8openalex-snapshot
Dynamic and Static Symmetry Breaking in Answer Set Programming
inferred← citeshttps://doi.org/10.1007/bf00244489openalex-snapshot
Short proofs of the pigeonhole formulas based on the connection method
inferred← citeshttps://doi.org/10.1007/bf00881844openalex-snapshot
Tractability through symmetries in propositional calculus
inferred← citeshttps://doi.org/10.1007/s000370100000openalex-snapshot
Optimality of size-width tradeoffs for resolution
inferred← citeshttps://doi.org/10.1007/s002360050044openalex-snapshot
Short resolution proofs for a sequence of tricky formulas
inferred← citeshttps://doi.org/10.1007/s10472-004-9420-5openalex-snapshot
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points
inferred← citeshttps://doi.org/10.1007/s10472-004-9422-3openalex-snapshot
The Complexity of Homomorphisms and Renamings for Minimal Unsatisfiable Formulas
inferred← citeshttps://doi.org/10.1007/s10472-005-0420-xopenalex-snapshot
Testing satisfiability of CNF formulas by computing a stable set of points
inferred← citeshttps://doi.org/10.1007/s10472-005-0422-8openalex-snapshot
The complexity of homomorphisms and renamings for minimal unsatisfiable formulas
inferred← citeshttps://doi.org/10.1007/s10472-016-9528-4openalex-snapshot
Local and global symmetry breaking in itemset mining
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/s10601-014-9163-9openalex-snapshot
Symmetries, almost symmetries, and lazy clause generation
inferred← citeshttps://doi.org/10.1007/s10601-020-09313-2openalex-snapshot
On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers
inferred← citeshttps://doi.org/10.1007/s11390-005-0758-xopenalex-snapshot
Complexities of Homomorphism and Isomorphism for Definite Logic Programs
inferred← citeshttps://doi.org/10.1016/j.apal.2005.05.002openalex-snapshot
Separation results for the size of constant-depth propositional proofs
inferred← citeshttps://doi.org/10.1016/j.apal.2011.11.001openalex-snapshot
The limits of tractability in Resolution-based propositional proof systems
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.ipl.2018.07.009openalex-snapshot
Short proofs for some symmetric Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1016/j.knosys.2025.114985openalex-snapshot
Towards multi-clause automated deduction and theorem generation: Constructing and applying standard contradictions
inferred← citeshttps://doi.org/10.1016/j.procs.2019.01.052openalex-snapshot
Breaking Symmetries in Association Rules
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00411-0openalex-snapshot
Homomorphisms of conjunctive normal forms
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00039-6openalex-snapshot
The symmetry rule in propositional logic
inferred← citeshttps://doi.org/10.1016/s0168-0072(00)00005-1openalex-snapshot
Relative efficiency of propositional proof systems: resolution vs. cut-free LK
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00395-5openalex-snapshot
Mutilated chessboard problem is exponentially hard for resolution
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00158-7openalex-snapshot
A tabu search method guided by shifting bottleneck for the job shop scheduling problem
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80014-3openalex-snapshot
Symmetry in Constraint Programming
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03002-7openalex-snapshot
Chapter 2 Satisfiability Solvers
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)x0300-6openalex-snapshot
Handbook of Knowledge Representation
inferred← citeshttps://doi.org/10.1023/a:1021231610627openalex-snapshot
Resolution Proofs of Matching Principles
inferred← citeshttps://doi.org/10.1080/11663081.1995.10510844openalex-snapshot
Uniform and non uniform strategies for tableaux calculi for modal logics
inferred← citeshttps://doi.org/10.1109/12.223678openalex-snapshot
Solution of switching equations based on a tabular algebra
inferred← citeshttps://doi.org/10.1109/12.30854openalex-snapshot
Improved techniques for estimating signal probabilities
inferred← citeshttps://doi.org/10.1109/12.338103openalex-snapshot
Tight lower bounds on the detection probabilities of single faults at internal signal lines in combinational circuits
inferred← citeshttps://doi.org/10.1109/ccc.2004.1313798openalex-snapshot
The complexity of treelike systems over Λ-local formulae
inferred← citeshttps://doi.org/10.1109/ccc.2004.36openalex-snapshot
The Complexity of Treelike Systems over -Local Formulae
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00055openalex-snapshot
Polynomial Calculus Sizes Over the Boolean and Fourier Bases are Incomparable
inferred← citeshttps://doi.org/10.1109/iceice.2011.5778288openalex-snapshot
SAT for heterogeneous FPGA technology mapping
inferred← citeshttps://doi.org/10.1109/icmwi.2010.5648194openalex-snapshot
Reasoning by symmetry in non-monotonic inference
inferred← citeshttps://doi.org/10.1109/ictai.2010.55openalex-snapshot
Enhancing Clause Learning by Symmetry in SAT Solvers
inferred← citeshttps://doi.org/10.1109/ictai.2013.78openalex-snapshot
Symmetry-Based Pruning in Itemset Mining
inferred← citeshttps://doi.org/10.1109/lics.2003.1210053openalex-snapshot
The complexity of resolution refinements
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238206openalex-snapshot
Rank bounds and integrality gaps for cutting planes procedures
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814614openalex-snapshot
A study of proof search algorithms for resolution and polynomial calculus
inferred← citeshttps://doi.org/10.1109/tcad.2003.816218openalex-snapshot
Solving difficult instances of boolean satisfiability in the presence of symmetry
inferred← citeshttps://doi.org/10.1137/090772897openalex-snapshot
A Near-Optimal Separation of Regular and General Resolution
inferred← citeshttps://doi.org/10.1137/20m134784xopenalex-snapshot
Proof Complexity and the Binary Encoding of Combinatorial Principles
inferred← citeshttps://doi.org/10.1137/s0097539700366735openalex-snapshot
Space Complexity in Propositional Calculus
inferred← citeshttps://doi.org/10.1142/s0218213019500118openalex-snapshot
Enhancing Static Symmetry Breaking with Dynamic Symmetry Handling in CDCL SAT Solvers
inferred← citeshttps://doi.org/10.1145/1838552.1838556openalex-snapshot
Optimality of size-degree tradeoffs for polynomial calculus
inferred← citeshttps://doi.org/10.1145/2815493.2815497openalex-snapshot
On the interplay between proof complexity and SAT solving
inferred← citeshttps://doi.org/10.1145/3580478openalex-snapshot
Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas
inferred← citeshttps://doi.org/10.1145/509907.509974openalex-snapshot
An exponential separation between regular and general resolution
inferred← citeshttps://doi.org/10.1287/mnsc.46.1.148.15134openalex-snapshot
Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
inferred← citeshttps://doi.org/10.1371/journal.pone.0194334openalex-snapshot
A complete logical approach to resolve the evolution and dynamics of mitochondrial genome in bilaterians
inferred← citeshttps://doi.org/10.1609/aaai.v24i1.7553openalex-snapshot
A Restriction of Extended Resolution for Clause Learning SAT Solvers
inferred← citeshttps://doi.org/10.1613/jair.1410openalex-snapshot
Towards Understanding and Harnessing the Potential of Clause Learning
inferred← citeshttps://doi.org/10.1613/jair.1555openalex-snapshot
Generalizing Boolean Satisfiability II: Theory
inferred← citeshttps://doi.org/10.1613/jair.1637openalex-snapshot
Breaking Instance-Independent Symmetries In Exact Graph Coloring
inferred← citeshttps://doi.org/10.1613/jair.4260openalex-snapshot
Improved Separations of Regular Resolution from Clause Learning Proof Systems
inferred← citeshttps://doi.org/10.2178/jsl/1203350790openalex-snapshot
The complexity of resolution refinements
inferred← citeshttps://doi.org/10.24963/ijcai.2018/261openalex-snapshot
Pseudo-Boolean Constraints from a Knowledge Representation Perspective
inferred← citeshttps://doi.org/10.29007/1l5ropenalex-snapshot
Symmetry breaking in a new stable model search method
inferred← citeshttps://doi.org/10.3233/978-1-61499-098-7-432openalex-snapshot
Symmetries in Itemset Mining
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-51openalex-snapshot
Symmetry-Driven Decision Diagrams for Knowledge Compilation
inferred← citeshttps://doi.org/10.3233/aic-2009-0445openalex-snapshot
Structure-based satisfiability checking
inferred← citeshttps://doi.org/10.3233/aic-2011-0495openalex-snapshot
Symmetry-breaking answer set solving
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2011.03957openalex-snapshot
Some Properties of Pigeon-Hole Formulas
inferred← citeshttps://doi.org/10.4018/ijssmet.2021070106openalex-snapshot
Intervention Planning in ITIL Context
inferred← citeshttps://doi.org/10.48550/arxiv.1708.01745openalex-snapshot
On the Quest for an Acyclic Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1809.02843openalex-snapshot
Resolution and the binary encoding of combinatorial principles
inferred← citeshttps://doi.org/10.48550/arxiv.1812.01163openalex-snapshot
Sum of squares bounds for the ordering principle
inferred← citeshttps://doi.org/10.48550/arxiv.2103.10267openalex-snapshot
Exploiting Isomorphic Subgraphs in SAT (Long version)
inferred← citeshttps://doi.org/10.5555/1622487.1622502openalex-snapshot
Generalizing Boolean satisfiability II
inferred← citeshttps://doi.org/10.5555/968878.969090openalex-snapshot
Breaking instance-independent symmetries in exact graph coloring
inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-428openalex-snapshot
Lower bounds for width-restricted clause learning on formulas of small width
inferred← citeshttps://doi.org/10.70675/5732022dzaf3bz44e9zae98z41d4facf3deaopenalex-snapshot
Contributions à la résolution du problème de la Satisfiabilité Propositionnelle
inferred← citeshttps://doi.org/10.70675/b93453b6zbe43z4d57z9b7bzbfc04cefd679openalex-snapshot
Conception d'un système ASP basé sur une nouvelle sémantique et application aux problèmes biologiques
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.