TY - GEN
T1 - Exploiting the HEF property to check model minimality
AU - Angiulli, Fabrizio
AU - Ben-Eliyahu-Zohary, Rachel
AU - Fassetti, Fabio
AU - Palopoli, Luigi
PY - 2015/1/1
Y1 - 2015/1/1
N2 - This paper presents an algorithm for efficiently checking a given set of atoms to be a minimal model of an input positive disjunctive logic program. This problem is, in general, intractable. Yet, it is quite a relevant in several application domains including, interestingly, stable model computation (for its role in the verification of a current atom set w.r.t. the corresponding program reduct). The algorithm we present is guaranteed to stop in polynomial time with success or a failure; moreover, it is guaranteed to terminate with a success on a strict superset of HEF logic programs.
AB - This paper presents an algorithm for efficiently checking a given set of atoms to be a minimal model of an input positive disjunctive logic program. This problem is, in general, intractable. Yet, it is quite a relevant in several application domains including, interestingly, stable model computation (for its role in the verification of a current atom set w.r.t. the corresponding program reduct). The algorithm we present is guaranteed to stop in polynomial time with success or a failure; moreover, it is guaranteed to terminate with a success on a strict superset of HEF logic programs.
UR - http://www.scopus.com/inward/record.url?scp=84971421779&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84971421779
T3 - 23rd Italian Symposium on Advanced Database Systems, SEBD 2015
SP - 351
EP - 357
BT - 23rd Italian Symposium on Advanced Database Systems, SEBD 2015
PB - Sistemi Evoluti per Basi di Dati (SEBD)
T2 - 23rd Italian Symposium on Advanced Database Systems, SEBD 2015
Y2 - 14 June 2015 through 17 June 2015
ER -