Disjunctive Completion
Disjunctive Completion is a formal method in abstract interpretation that extends an abstract domain to explicitly represent disjunctions of abstract elements, thereby enabling more precise analysis of programs with branching behavior by capturing multiple execution paths separately.
9
Publications
216
Citations
20
Authors
13
Institutions
Publications per year
2017–2026
1
Parents
9
Disjunctive Answer Set Programming via Satisfiability
Yuliya Lierler · 2005 · 45 citations
Elementary Sets for Logic Programs
Martin Gebser, Joohyung Lee, Yuliya Lierler · arXiv (Cornell University) · 2023 · 21 citations · Full text
1–5 of 9
20
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 20
13

University of Pisa
Pisa, Italy
1 h-index
2 publications
102 citations
University of Potsdam
Potsdam, Germany
1 h-index
1 publications
21 citations
University of Chinese Academy of Sciences
Beijing, China
1 h-index
2 publications
36 citations

Chinese Academy of Sciences
Beijing, China
1 h-index
6 publications
108 citations
Beijing Museum of Natural History
Beijing, China
1 h-index
1 publications
18 citations
Institute of Botany
Beijing, China
1 h-index
6 publications
108 citations
University of Vienna
Vienna, Austria
1 h-index
1 publications
18 citations
Friedrich-Alexander-Universität Erlangen-Nürnberg
Erlangen, Germany
1 h-index
1 publications
45 citations
1–8 of 13
ENTCS · 1 publications · 16 citations
1
h-index
Repository · 1 publications · 14 citations
1
h-index
1 publications · 51 citations
1
h-index
1 publications · 18 citations
1
h-index
1 publications · 11 citations
1
h-index
1–5