Satisfiability Problem

The Satisfiability Problem is the formal decision problem of determining whether a given temporal logic formula admits at least one model or timeline in which the formula holds true, distinguishing it from related verification tasks by focusing on existence rather than universal validity or realizability.

1.5K

Publications

89.7K

Citations

2.2K

Authors

780

Institutions

Publications per year

2017–2026

194

Authors

2.2K

  1. JM
    João Marques‐Silva

    Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento, Portugal

    32 publications · 2.8K citations

    23

    h-index

  2. BS
    Bart Selman

    Cornell University, United States

    18 publications · 4.6K citations

    17

    h-index

  3. MA
    Mohd. Asyraf Mansor

    Universiti Sains Malaysia, Malaysia

    20 publications · 606 citations

    16

    h-index

  4. KA
    Karem A. Sakallah

    University of Michigan, United States

    17 publications · 2.7K citations

    16

    h-index

  5. MS
    Mohd Shareduwan Mohd Kasihmuddin

    Universiti Sains Malaysia, Malaysia

    18 publications · 567 citations

    15

    h-index

1–5 of 2.2K

Venues

  1. Artificial Intelligence

    22 publications · 2.5K citations

    21

    h-index

  2. Journal of the ACM

    JACM · 22 publications · 5.5K citations

    20

    h-index

  3. Journal of Artificial Intelligence Research

    JAIR · 25 publications · 1.1K citations

    19

    h-index

  4. SIAM Journal on Computing

    20 publications · 2.1K citations

    18

    h-index

  5. arXiv (Cornell University)

    Repository · 35 publications · 897 citations

    18

    h-index

1–5