Hostname: page-component-745bb68f8f-s22k5 Total loading time: 0 Render date: 2025-02-11T02:57:50.805Z Has data issue: false hasContentIssue false
  • English
  • Français

Minimal founded semantics for disjunctive logic programs and deductive databases

Published online by Cambridge University Press:  06 January 2004

FILIPPO FURFARO ,
GIANLUIGI GRECO  and
SERGIO GRECO
FILIPPO FURFARO
Affiliation:
DEIS, Università della Calabria, 87030 Rende, Italy (e-mail: filippo.furfaro@deis.unical.it)
GIANLUIGI GRECO
Affiliation:
DEIS, Università della Calabria, 87030 Rende, Italy (e-mail: gianluigi.greco@deis.unical.it)
SERGIO GRECO
Affiliation:
DEIS, Università della Calabria, 87030 Rende, Italy (e-mail: greco@deis.unical.it)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded, generalizes stable model semantics for normal (i.e. non-disjunctive) programs, but differs from disjunctive stable model semantics (the extension of stable model semantics for disjunctive programs). Compared with disjunctive stable model semantics, minimal founded semantics seems to be more intuitive, it gives meaning to programs which are meaningless under stable model semantics and is no harder to compute. More specifically, minimal founded semantics differs from stable model semantics only for disjunctive programs having constraint rules or rules working as constraints. We study the expressive power of the semantics, and show that for general disjunctive datalog programs it has the same power as disjunctive stable model semantics.

Type
Regular Papers
Information
Theory and Practice of Logic Programming , Volume 4 , Issue 1-2 , January 2004 , pp. 75 - 93
Copyright
© 2004 Cambridge University Press