Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-23T20:11:27.469Z 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: [email protected])
GIANLUIGI GRECO
Affiliation:
DEIS, Università della Calabria, 87030 Rende, Italy (e-mail: [email protected])
SERGIO GRECO
Affiliation:
DEIS, Università della Calabria, 87030 Rende, Italy (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)