Termination of Logic Programs is a formal method in computational logic that determines whether a logic program terminates under a given computation rule by analyzing the program's derivation sequences to ensure they are finite for all possible queries.
131
Publications
5.7K
Citations
185
Authors
102
Institutions
Publications per year
2017–2026
2
Parents
Publications
131
A kripke-kleene semantics for logic programs*
Melvin Fitting · The Journal of Logic Programming · 1985 · 539 citations
Tabled evaluation with delaying for general logic programs
Weidong Chen, David S. Warren · Journal of the ACM · 1996 · 412 citations · Full text
Propositional modal logic of programs
Michael J. Fischer, Richard E. Ladner · 1977 · 143 citations · Full text
1–5 of 131
Authors
185
- DD
10
h-index
- MB
5
h-index
- AB
5
h-index
- IT
5
h-index
- SG
5
h-index
1–5 of 185
Institutions
102
KU Leuven
Leuven, Belgium
10 h-index
19 publications
1.4K citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
5 h-index
5 publications
60 citations
University of Pisa
Pisa, Italy
5 h-index
8 publications
288 citations
Universitat Politècnica de València
Valencia, Spain
5 h-index
6 publications
158 citations
Stony Brook University
Stony Brook, United States
4 h-index
5 publications
481 citations
RWTH Aachen University
Aachen, Germany
4 h-index
7 publications
210 citations
Observatoire des Sciences de l'Univers de la Réunion
Saint-Denis, Réunion
4 h-index
5 publications
140 citations
University of Calabria
Rende, Italy
4 h-index
13 publications
164 citations
1–8 of 102
Venues
- Theory and Practice of Logic Programming
16 publications · 269 citations
13
h-index
- The Journal of Logic Programming
14 publications · 1.4K citations
11
h-index
- ACM Transactions on Programming Languages and Systems
7 publications · 412 citations
7
h-index
- Theoretical Computer Science
7 publications · 354 citations
7
h-index
- New Generation Computing
6 publications · 289 citations
6
h-index
1–5