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
Parents
140
Decomposable negation normal form
Adnan Darwiche · Journal of the ACM · 2001 · 333 citations
Learning conjunctions of Horn clauses
Dana Angluin, Michael Frazier, Leonard Pitt · Machine Learning · 1992 · 188 citations · Full text
1–5 of 140
251
Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento, Portugal
6 publications · 412 citations
6
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 251
137
Carnegie Mellon University
Pittsburgh, United States
11 h-index
18 publications
2.2K citations
University of Illinois Urbana-Champaign
Urbana, United States
5 h-index
9 publications
647 citations
The University of Texas at Austin
Austin, United States
5 h-index
8 publications
254 citations
Universitat de Lleida
Lleida, Spain
5 h-index
6 publications
303 citations

Centre National de la Recherche Scientifique
Paris, France
5 h-index
6 publications
121 citations
Purdue University West Lafayette
West Lafayette, United States
4 h-index
4 publications
234 citations
University College Dublin
Dublin, Ireland
3 h-index
6 publications
606 citations
Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento
Lisbon, Portugal
3 h-index
5 publications
337 citations
1–8 of 137
9 publications · 522 citations
8
h-index
8 publications · 218 citations
8
h-index
7 publications · 1.5K citations
7
h-index
4 publications · 274 citations
4
h-index
4 publications · 183 citations
4
h-index
1–5