Horn Clause Solving

Horn Clause Solving is a methodological framework within automated reasoning that specializes in determining the satisfiability of logical formulas expressed as Horn clauses, which are definite clauses with at most one positive literal, thereby enabling efficient inference through resolution-based techniques.

140

Publications

7.2K

Citations

251

Authors

137

Institutions

Publications per year

2017–2026

24

Authors

251

  1. JM
    João Marques‐Silva

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

    6 publications · 412 citations

    6

    h-index

  2. GF
    Grigory Fedyukovich

    Florida State University, United States

    5 publications · 126 citations

    5

    h-index

  3. JH
    John Hooker

    Carnegie Mellon University, United States

    5 publications · 299 citations

    5

    h-index

  4. JG
    Jean Gallier

    University of Pennsylvania, United States

    4 publications · 1.1K citations

    4

    h-index

  5. FM
    Felip Manyà

    Artificial Intelligence Research Institute, Spain

    4 publications · 125 citations

    4

    h-index

1–5 of 251

Venues

  1. Journal of Automated Reasoning

    9 publications · 522 citations

    8

    h-index

  2. Theoretical Computer Science

    8 publications · 218 citations

    8

    h-index

  3. The Journal of Logic Programming

    7 publications · 1.5K citations

    7

    h-index

  4. Artificial Intelligence

    4 publications · 274 citations

    4

    h-index

  5. 4

    h-index

1–5