• Classified by Research Topic • Sorted by Date • Classified by Publication Type •
A Fast and Accurate ASP Counting Based Network Reliability Estimator.
Mohimenul Kabir, and Kuldeep S. Meel.
In Proceedings of International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR), June 2023.
The quantification of system reliability is fundamental to the assessment of a system’ssafety and resilience, and has been of interest to decision-makers. Since quantifying thesystem reliability is shown to be computationally intractable, researchers aim to find ap-proximations. Existing approaches to approximate reliability either suffer from poor scal-ability or lack of correctness guarantees. Answer Set Programming (ASP) is a powerfultool for knowledge representation that can specify complex combinatorial problems. Inrecent years, the new applications of ASP have propelled the emergence of well-engineeredASP systems. This paper proposes a new ASP counting based framework, RelNet-ASP,to approximate or estimate the reliability of a system or network. The framework reducesthe problem of reliability estimation to an approximate model counting problem on ASPprograms, offering formal guarantees of the estimated reliability. The experimental eval-uation demonstrates that RelNet-ASP outperforms state-of-the-art techniques in terms ofboth runtime performance and accuracy.
@inproceedings{KM23,
title={A Fast and Accurate ASP Counting Based Network Reliability Estimator},
author={Kabir, Mohimenul and Meel, Kuldeep S.},
abstract={The quantification of system reliability is fundamental to the assessment of a system’s
safety and resilience, and has been of interest to decision-makers. Since quantifying the
system reliability is shown to be computationally intractable, researchers aim to find ap-
proximations. Existing approaches to approximate reliability either suffer from poor scal-
ability or lack of correctness guarantees. Answer Set Programming (ASP) is a powerful
tool for knowledge representation that can specify complex combinatorial problems. In
recent years, the new applications of ASP have propelled the emergence of well-engineered
ASP systems. This paper proposes a new ASP counting based framework, RelNet-ASP,
to approximate or estimate the reliability of a system or network. The framework reduces
the problem of reliability estimation to an approximate model counting problem on ASP
programs, offering formal guarantees of the estimated reliability. The experimental eval-
uation demonstrates that RelNet-ASP outperforms state-of-the-art techniques in terms of
both runtime performance and accuracy.},
year={2023},
month=jun,
booktitle=LPAR,
bib2html_rescat={Counting},
bib2html_pubtype={Refereed Conference},
bib2html_dl_pdf={../Papers/lpar23-km.pdf},
}
Generated by bib2html.pl (written by Patrick Riley with layout from Sanjit A. Seshia ) on Sun Apr 14, 2024 11:15:51