In this paper we introduce AASExts, an algorithm for computing semi–stable extensions. We improve techniques developed for other semantics, notably preferred semantics, as well as leverage recent advances in All-SAT community. We prove our proposed algorithm is sound and complete, we describe the experiments to select the most appropriate encoding to adopt, and we show empirically that our implementation significantly outperforms even sophisticated ASP-based and SAT-based reduction approaches on existing benchmarks.
An Efficient Algorithm for Semi-stable Extensions
Cerutti F.;Giacomin M.;Vallati M.;Zanetti T.
2021-01-01
Abstract
In this paper we introduce AASExts, an algorithm for computing semi–stable extensions. We improve techniques developed for other semantics, notably preferred semantics, as well as leverage recent advances in All-SAT community. We prove our proposed algorithm is sound and complete, we describe the experiments to select the most appropriate encoding to adopt, and we show empirically that our implementation significantly outperforms even sophisticated ASP-based and SAT-based reduction approaches on existing benchmarks.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
