On the public citation graph
Tractability through symmetries in propositional calculus
0 signed · 55 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-642-81955-1_28openalex-snapshot
On the Complexity of Derivation in Propositional Calculus
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_32openalex-snapshot
Linear Resolution with Selection Function
inferredcites →https://doi.org/10.1007/bf00244489openalex-snapshot
Short proofs of the pigeonhole formulas based on the connection method
inferredcites →https://doi.org/10.1016/0004-3702(71)90012-9openalex-snapshot
Linear resolution with selection function
inferredcites →https://doi.org/10.1016/s0021-9800(68)80024-9openalex-snapshot
On the maximal triangle-free edge-chromatic graphs in three colors
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/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/800076.802454openalex-snapshot
Examples of hard tautologies in the propositional calculus
inferredcites →https://doi.org/10.5555/96346.96352openalex-snapshot
Short proofs of the pigeonhole formulas based on the connection method
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45620-1_19openalex-snapshot
Reasoning by Symmetry and Function Ordering in Finite Model Generation
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-3-031-39144-6_10openalex-snapshot
Symmetry and Dominance Breaking for Pseudo-Boolean Optimization
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-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-66263-3_7openalex-snapshot
An Adaptive Prefix-Assignment Technique for Symmetry Reduction
inferred← citeshttps://doi.org/10.1007/978-3-540-48085-3_6openalex-snapshot
Excluding Symmetries in Constraint-Based Search
inferred← citeshttps://doi.org/10.1007/978-3-540-73580-9_28openalex-snapshot
Solving Difficult SAT Instances Using Greedy Clique Decomposition
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-642-40537-2_4openalex-snapshot
Dealing with Symmetries in Modal Tableaux
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_41openalex-snapshot
Breaking Symmetry with Different Orderings
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/bfb0057437openalex-snapshot
Study of symmetry in qualitative temporal interval networks
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/s10817-006-9040-3openalex-snapshot
Predicting and Detecting Symmetries in FOL Finite Model Search
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00241-3openalex-snapshot
Tractability of cut-free Gentzen type propositional calculus with permutation inference
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/s0304-3975(98)00186-8openalex-snapshot
Tractability of Cut-free Gentzen-type propositional calculus with permutation inference II
inferred← citeshttps://doi.org/10.1023/a:1020533821509openalex-snapshot
Excluding Symmetries in Constraint-Based Search
inferred← citeshttps://doi.org/10.1109/dac.2002.1012719openalex-snapshot
Solving difficult SAT instances in the presence of symmetry
inferred← citeshttps://doi.org/10.1109/eecs.2018.00053openalex-snapshot
Dynamic Symmetry Breaking in SAT using Augmented Clauses with a Polynomial-Time Lexicographic Pruning
inferred← citeshttps://doi.org/10.1109/icmwi.2010.5648194openalex-snapshot
Reasoning by symmetry in non-monotonic inference
inferred← citeshttps://doi.org/10.1109/ictai.2009.38openalex-snapshot
Enhancing Neighbourhood Substitutability Thanks to Singleton Arc Consistency
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/tcad.2003.816218openalex-snapshot
Solving difficult instances of boolean satisfiability in the presence of symmetry
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/372202.372206openalex-snapshot
Automatic symmetry breaking method combined with SAT
inferred← citeshttps://doi.org/10.1145/513918.514102openalex-snapshot
Solving difficult SAT instances in the presence of symmetry
inferred← citeshttps://doi.org/10.1609/aaai.v36i4.20283openalex-snapshot
Certified Symmetry and Dominance Breaking for Combinatorial Optimisation
inferred← citeshttps://doi.org/10.1613/jair.1.14296openalex-snapshot
Certified Dominance and Symmetry Breaking for Combinatorial Optimisation
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.48550/arxiv.2005.08954openalex-snapshot
On the Complexity of Breaking Symmetry
inferred← citeshttps://doi.org/10.58837/chula.the.2018.1248openalex-snapshot
การหกลางความสมมาตรพลวตในปญหาความสอดคลองแบบบลโดยใชประพจนเลอกตอเตมพรอมดวยการเลมตนไมคนหาในเวลาเชงพหนาม
inferred← citeshttps://doi.org/10.70675/41a21d4bz191ez4409za183z754a7064aeafopenalex-snapshot
Raisonnement à partir de contraintes pseudo-booléennes et compilation
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.