Several AI problems can be conveniently modelled in ASP, and many of them require to enumerate solutions characterized by an optimality property that can be expressed in terms of subset-minimality with respect to some objective atoms. In this context, solutions are often either (i) answer sets or (ii) sets of atoms that enforce the absence of answer sets on the ASP program at hand—such sets are referred to as minimal unsatisfiable subsets (MUSes). In both cases, the required enumeration task is currently not supported by state-of-the-art ASP solvers.
Enumeration of Minimal Models and MUSes in WASP
Alviano M.;Dodaro C.;Fiorentino S.;Ricca F.
2022-01-01
Abstract
Several AI problems can be conveniently modelled in ASP, and many of them require to enumerate solutions characterized by an optimality property that can be expressed in terms of subset-minimality with respect to some objective atoms. In this context, solutions are often either (i) answer sets or (ii) sets of atoms that enforce the absence of answer sets on the ASP program at hand—such sets are referred to as minimal unsatisfiable subsets (MUSes). In both cases, the required enumeration task is currently not supported by state-of-the-art ASP solvers.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.
