Local Symmetries in Propositional Logic

@inproceedings{Arai2000LocalSI,
  title={Local Symmetries in Propositional Logic},
  author={Noriko H. Arai and Alasdair Urquhart},
  booktitle={TABLEAUX},
  year={2000}
}
The symmetry rule in propositional logic allows the exploitation of symmetries present in a problem. In the context of resolution, the rule enables the shortening of refutations by using symmetries present in an initial set of clauses. These symmetries can be local or global. The present paper proves that the local symmetry rule is strictly more powerful than the global symmetry rule. It also exhibits sets of clauses that show exponential lower bounds for the local symmetry rule, where the… 
The Complexity of Resolution with Generalized Symmetry Rules
TLDR
The use of homomorphisms yields a strictly more powerful system than the use of symmetries by exhibiting an infinite sequence of sets of clauses for which the consideration of global homomorphicisms allows exponentially shorter proofs than the considerationof local symmetry.
Reasoning by symmetry in non-monotonic inference
TLDR
The notion of symmetry is extended to that non classical logics such as preferential logics, X-logics and default logICS, then a new symmetry inference rule is given for the X- logics and the default logics to show how symmetry reasoning is profitable for these logics.
Resolution with Symmetry Rule applied to Linear Equations
This paper considers the length of resolution proofs when using Krishnamurthy’s classic symmetry rules. We show that inconsistent linear equation systems of bounded width over a fixed finite field Fp
Symmetry and Non-monotonic Inference
TLDR
The notion of symmetry is extended to non classical logics such as preferential logics and X-logics, which usually manipulate incomplete information and need to include uncertainty to reason on knowledge with exceptions and non-monotonicity.
Without Loss of Generality - Symmetric Reasoning for Resolution Systems (Invited Talk)
TLDR
The concepts of symmetry and homomorphism rules are reviewed and various questions and results that arise in that context are discussed.
Symmetry in Constraint Programming
Number of Variables for Graph Identification and the Resolution of GI Formulas
We show that the number of variables and the quantifier depth needed to distinguish a pair of graphs by first-order logic sentences exactly match the complexity measures of clause width and positive
Number of Variables for Graph Differentiation and the Resolution of GI Formulas
We show that the number of variables and the quantifier depth needed to distinguish a pair of graphs by first-order logic sentences exactly match the complexity measures of clause width and positive
Homomorphisms of conjunctive normal forms
Proof Complexity and SAT Solving
This chapter gives an overview of proof complexity and connections to SAT solving, focusing on proof systems such as resolution, Nullstellensatz, polynomial calculus, and cutting planes
...
...

References

SHOWING 1-10 OF 26 REFERENCES
The Symmetry Rule in Propositional Logic
Short proofs are narrow—resolution made simple
We develop a general strategy for proving width lower bounds, which follows Haken's original proof technique but is now simple and clear. It reveals that large width is implied by certain natural
The Intractability of Resolution
Hard examples for resolution
Exponential lower bounds are proved for the length-of-resolution refutations of sets of disjunctions constructed from expander graphs, using the method of Tseitin. Since these sets of clauses encode
The Complexity of Finite Functions
  • R. Boppana, M. Sipser
  • Computer Science
    Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity
  • 1990
Lower Bounds for Resolution and Cutting Plane Proofs and Monotone Computations
  • P. Pudlák
  • Mathematics, Computer Science
    J. Symb. Log.
  • 1997
We prove an exponential lower bound on the length of cutting plane proofs. The proof uses an extension of a lower bound for monotone circuits to circuits which compute with real numbers and use
Handbook of Theoretical Computer Science
TLDR
The Handbook of Theoretical Computer Science provides professionals and students with a comprehensive overview of the main results and developments in this rapidly evolving field.
Many hard examples for resolution
TLDR
A randomly chosen family of clauses of size k over n variables is unsatisfiable, but every resolution proof of its unsatisfiability must generate at least (1 + ε)<supscrpt><italic>n</italic></sups Crpt> clauses.
...
...