Logic Program Optimization
Logic Program Optimization is a methodological framework within declarative computing that enhances the efficiency and efficacy of logic programs by systematically transforming their syntactic and semantic structures while preserving their logical meaning.
44
Publications
1.5K
Citations
85
Authors
45
Institutions
Publications per year
2017–2026
3
Parents
44
Decidable optimization problems for database logic programs
Stavros S. Cosmadakis, Haim Gaifman, Paris C. Kanellakis et al. · 1988 · 154 citations · Full text
Undecidable optimization problems for database logic programs
Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv et al. · Journal of the ACM · 1993 · 74 citations · Full text
1–5 of 44
85
3
h-index
3
h-index
3
h-index
3
h-index
IBM Research - Thomas J. Watson Research Center, United States
2 publications · 201 citations
2
h-index
1–5 of 85
45
University of Arizona
Tucson, United States
5 h-index
5 publications
144 citations
Hebrew University of Jerusalem
Jerusalem, Israel
3 h-index
4 publications
331 citations
Stony Brook University
Stony Brook, United States
3 h-index
9 publications
207 citations

University of Calabria
Rende, Italy
3 h-index
6 publications
157 citations

Imperial College London
London, United Kingdom
2 h-index
4 publications
54 citations
State University of New York
Albany, United States
2 h-index
2 publications
102 citations

TU Wien
Vienna, Austria
2 h-index
7 publications
227 citations
IBM Research - Almaden
San Jose, United States
2 h-index
2 publications
228 citations
1–8 of 45
3 publications · 69 citations
3
h-index
JACM · 3 publications · 98 citations
3
h-index
2 publications · 30 citations
2
h-index
2 publications · 39 citations
2
h-index
2 publications · 114 citations
2
h-index
1–5