All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

SAT Competition 2020

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F21%3A00354411" target="_blank" >RIV/68407700:21730/21:00354411 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1016/j.artint.2021.103572" target="_blank" >https://doi.org/10.1016/j.artint.2021.103572</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.artint.2021.103572" target="_blank" >10.1016/j.artint.2021.103572</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    SAT Competition 2020

  • Original language description

    The SAT Competitions constitute a well-established series of yearly open international algorithm implementation competitions, focusing on the Boolean satisfiability (or propositional satisfiability, SAT) problem. In this article, we provide a detailed account on the 2020 instantiation of the SAT Competition, including the new competition tracks and benchmark selection procedures, overview of solving strategies implemented in top-performing solvers, and a detailed analysis of the empirical data obtained from running the competition.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GJ20-06390Y" target="_blank" >GJ20-06390Y: Powering Automatic Theorem Provers by Machine Learning</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2021

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Artificial Intelligence

  • ISSN

    0004-3702

  • e-ISSN

    1872-7921

  • Volume of the periodical

    301

  • Issue of the periodical within the volume

    December

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    25

  • Pages from-to

  • UT code for WoS article

    000701810200009

  • EID of the result in the Scopus database

    2-s2.0-85113141914