The configurable SAT solver challenge (CSSC) (Q502389): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(15 intermediate revisions by 7 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Paramils / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SMAC / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MiniSat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: KLEE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: irace / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Treengeling / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SATenstein / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Sparrow2Riss / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: auto-sklearn / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962929300 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59585860 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1505.01221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Abstraction of Software Verification Conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting Cardinality Constraints in CNF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Testing and Debugging of SAT and QBF Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and applications of satisfiability testing -- SAT 2012. 15th international conference, Trento, Italy, June 17--20, 2012. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-driven answer set solving: from theory to practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward leaner binary-clause reasoning in a satisfiability solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient CNF Simplification Based on Binary Implication Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ParamILS: An Automatic Algorithm Configuration Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm runtime prediction: methods \& evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocked Clause Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: SATenstein: automatically building local search SAT solvers from components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and applications of satisfiability testing -- SAT 2009. 12th international conference, SAT 2009, Swansea, UK, June 30--July 3, 2009. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2786915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and applications of satisfiability testing -- SAT 2011. 14th international conference, SAT 2011, Ann Arbor, MI, USA, June 19--22, 2011. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Captain Jack: New Variable Selection Heuristics in Local Search for SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Resolution Complexity of Graph Non-isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank

Latest revision as of 06:53, 13 July 2024

scientific article
Language Label Description Also known as
English
The configurable SAT solver challenge (CSSC)
scientific article

    Statements

    The configurable SAT solver challenge (CSSC) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 January 2017
    0 references
    0 references
    propositional satisfiability
    0 references
    algorithm configuration
    0 references
    empirical evaluation
    0 references
    competition
    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
    0 references
    0 references
    0 references