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
Parents
217
Stephen Muggleton · New Generation Computing · 1991 · 945 citations
Uniform proofs as a foundation for logic programming
Dale Miller, Gopalan Nadathur, Frank Pfenning et al. · Annals of Pure and Applied Logic · 1991 · 576 citations
Computing, Computer Science, Logic +16
1–5 of 217
358
8
h-index
6
h-index
5
h-index
5
h-index
4
h-index
1–5 of 358
171
Arizona State University
Tempe, United States
7 h-index
13 publications
502 citations

Imperial College London
London, United Kingdom
6 h-index
7 publications
126 citations

Cornell University
Ithaca, United States
6 h-index
8 publications
407 citations
University of Illinois Urbana-Champaign
Urbana, United States
6 h-index
11 publications
808 citations
University of Pennsylvania
Philadelphia, United States
5 h-index
7 publications
1.5K citations
KU Leuven
Leuven, Belgium
5 h-index
10 publications
181 citations
Carnegie Mellon University
Pittsburgh, United States
4 h-index
9 publications
1K citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
6 publications
177 citations
1–8 of 171
Repository · 8 publications · 191 citations
8
h-index
8 publications · 953 citations
8
h-index
5 publications · 386 citations
5
h-index
Conference · 5 publications · 265 citations
5
h-index
4 publications · 223 citations
4
h-index
1–5