First-order Logic Programming

First-Order Logic Programming is a formal computational paradigm within logic programming that uses first-order logic as its foundational language, distinguishing itself by allowing quantification over individuals but not over predicates or functions, thereby enabling the representation of relations and rules through Horn clauses grounded in first-order predicate calculus.

217

Publications

11.1K

Citations

358

Authors

171

Institutions

Publications per year

2017–2026

16

Authors

358

  1. DM
    Dale Miller

    University of Pennsylvania, United States

    8 publications · 1K citations

    8

    h-index

  2. GN
    Gopalan Nadathur

    Duke University, United States

    6 publications · 881 citations

    6

    h-index

  3. JL
    Joohyung Lee

    Arizona State University, United States

    5 publications · 242 citations

    5

    h-index

  4. SM
    Stephen Muggleton

    Imperial College London, United Kingdom

    5 publications · 1.3K citations

    5

    h-index

  5. TS
    Torsten Schaub

    University of Potsdam, Germany

    4 publications · 236 citations

    4

    h-index

1–5 of 358

Venues

  1. arXiv (Cornell University)

    Repository · 8 publications · 191 citations

    8

    h-index

  2. The Journal of Logic Programming

    8 publications · 953 citations

    8

    h-index

  3. Theoretical Computer Science

    5 publications · 386 citations

    5

    h-index

  4. International Conference on Logic Programming

    Conference · 5 publications · 265 citations

    5

    h-index

  5. SLP

    4 publications · 223 citations

    4

    h-index

1–5