SAT competition 2020 (Q2060693): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5148371 / 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: SAT competition 2020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT race 2015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2845506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ultimately Incremental SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental inprocessing in SAT solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning as satisfiability: parallel plans and algorithms for plan search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining computational complexity from characteristic ‘phase transitions’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for computing backbones of propositional formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Between SAT and UNSAT: The Fundamental Difference in CDCL SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Rate Based Branching Heuristic for SAT Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chronological backtracking / rank
 
Normal rank
Property / cites work
 
Property / cites work: CrystalBall: gazing in the black box of SAT solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clause vivification by unit propagation in CDCL SAT solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truth Assignments as Conditional Autarkies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing new phase selection heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Static Symmetry Breaking for SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trail saving on backtrack / rank
 
Normal rank
Property / cites work
 
Property / cites work: HordeSat: A Massively Parallel Portfolio SAT Solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent Clause Strengthening / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lazy Clause Exchange Policy for Parallel SAT Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3639756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable SAT solving in the cloud / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and algorithms for the construction and analysis of systems. 14th international conference, TACAS 2008, held as part of the joint European conferences on theory and practice of software, ETAPS 2008, Budapest, Hungary, March 29--April 6, 2008. Proceedings / rank
 
Normal rank

Latest revision as of 12:25, 27 July 2024

scientific article
Language Label Description Also known as
English
SAT competition 2020
scientific article

    Statements

    SAT competition 2020 (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 December 2021
    0 references
    0 references
    SAT
    0 references
    Boolean satisfiability
    0 references
    SAT competition
    0 references
    SAT solvers
    0 references
    empirical evaluation
    0 references
    benchmarking
    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
    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
    0 references