Decidability

Decidability is a formal property of a decision problem within a computational model, distinguishing it from other semantic properties by the existence of an effective procedure that always halts and correctly determines whether any given instance of the problem belongs to the language or satisfies the logical formula under the rules of the system.

475

Publications

22.6K

Citations

713

Authors

371

Institutions

Publications per year

2017–2026

46

Authors

713

  1. DC
    Diego Calvanese

    Free University of Bozen-Bolzano, Italy

    7 publications · 245 citations

    7

    h-index

  2. VC
    Véronique Cortier

    Laboratoire Lorrain de Recherche en Informatique et ses Applications, France

    7 publications · 209 citations

    7

    h-index

  3. MM
    Marco Montali

    Free University of Bozen-Bolzano, Italy

    6 publications · 128 citations

    6

    h-index

  4. SD
    Stéphanie Delaune

    Centre National de la Recherche Scientifique, France

    6 publications · 215 citations

    6

    h-index

  5. SD
    Stéphane Demri

    Centre National de la Recherche Scientifique, France

    6 publications · 98 citations

    6

    h-index

1–5 of 713

Venues

  1. Journal of Symbolic Logic

    28 publications · 1.2K citations

    18

    h-index

  2. Theoretical Computer Science

    21 publications · 643 citations

    16

    h-index

  3. Logical Methods in Computer Science

    LMCS · 10 publications · 210 citations

    10

    h-index

  4. Fundamenta Informaticae

    10 publications · 166 citations

    10

    h-index

  5. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 12 publications · 215 citations

    10

    h-index

1–5