Minimal founded semantics for disjunctive logic programs and deductive databases

Authors:
Filippo Furfaro;Gianluigi Greco;Sergio Greco
Affiliations:
DEIS, Università della Calabria, 87030 Rende, Italy (e-mail: filippo.furfaro@deis.unical.it);DEIS, Università della Calabria, 87030 Rende, Italy (e-mail: gianluigi.greco@deis.unical.it);DEIS, Università della Calabria, 87030 Rende, Italy (e-mail: greco@deis.unical.it)
Venue:
Theory and Practice of Logic Programming
Year:
2004

Citing 17
Cited 2

Inferring negative information from disjunctive databases

Journal of Automated Reasoning
Towards a theory of declarative knowledge

Foundations of deductive databases and logic programming
On the declarative semantics of deductive databases and logic programs

Foundations of deductive databases and logic programming
Weak generalized closed world assumption

Journal of Automated Reasoning
Autoepistemic logic

Journal of the ACM (JACM)
Foundations of disjunctive logic programming

Foundations of disjunctive logic programming
Complexity aspects of various semantics for disjunctive databases

PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The expressive powers of the logic programming semantics

Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation

Information and Computation
The expressive powers of stable models for bound and unbound DATALOG queries

Journal of Computer and System Sciences - special issue on complexity theory
Disjunctive datalog

ACM Transactions on Database Systems (TODS)
Expressive power and complexity of partial models for disjunctive deductive databases

Theoretical Computer Science
Optimization of disjunctive queries

Proceedings of the 1999 international conference on Logic programming
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Binding Propagation in Disjunctive Databases

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
On Indefinite Databases and the Closed World Assumption

Proceedings of the 6th Conference on Automated Deduction
The complexity of relational query languages (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing

Optimization of bound disjunctive queries with constraints

Theory and Practice of Logic Programming
Logic programming languages for databases and the web

A 25-year perspective on logic programming

Quantified Score

Hi-index	0.00

Visualization

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.