Exploiting the HEF property to check model minimality

Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Fabio Fassetti, Luigi Palopoli

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publication23rd Italian Symposium on Advanced Database Systems, SEBD 2015
PublisherSistemi Evoluti per Basi di Dati (SEBD)
Pages351-357
Number of pages7
ISBN (Electronic)9781510810877
StatePublished - 1 Jan 2015
Externally publishedYes
Event23rd Italian Symposium on Advanced Database Systems, SEBD 2015 - Gaeta, Italy
Duration: 14 Jun 201517 Jun 2015

Publication series

Name23rd Italian Symposium on Advanced Database Systems, SEBD 2015

Conference

Conference23rd Italian Symposium on Advanced Database Systems, SEBD 2015
Country/TerritoryItaly
CityGaeta
Period14/06/1517/06/15

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Exploiting the HEF property to check model minimality'. Together they form a unique fingerprint.

Cite this