\texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver (Q1037644): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(12 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: BerkMin / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Jerusat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PBS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SAT competition / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: March_eq / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Walksat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Velev SAT Benchmarks / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Shatter / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SATO / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10601-008-9060-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003590658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of cutting-plane proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An accurate and scalable collaborative recommender / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STRIPS: A new approach to the application of theorem proving to problem solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3743300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BerkMin: A fast and robust SAT-solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs for tricky formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4707784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution cannot polynomially simulate compressed-BFS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for resolution and cutting plane proofs and monotone computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Lex Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution lower bounds for the weak pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating bounded model checking of safety properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The symmetry rule in propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. / rank
 
Normal rank
Property / cites work
 
Property / cites work: General Symmetry Breaking Constraints / rank
 
Normal rank

Latest revision as of 05:02, 2 July 2024

scientific article
Language Label Description Also known as
English
\texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
scientific article

    Statements

    \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver (English)
    0 references
    0 references
    0 references
    16 November 2009
    0 references
    0 references
    Boolean satisfiability
    0 references
    SAT
    0 references
    SymChaff
    0 references
    complete multi-class symmetry
    0 references
    global symmetry
    0 references
    high-level representation
    0 references
    planning
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references