A New Partial Semantics for Disjunctive Deductive Databases

Authors:
Françoise Gire;Corinne Plourde
Affiliations:
Université de Paris I, Centre de Recherche en Informatique, 90 rue de Tobliac, 75634 Paris cedex 13, France. E-mail: gire@univ-paris1.fr;Société ParaGraph, Parc Technopolis, 17 avenue du Parc, 91380 Chilly Mazarin, France. E-mail: plourde@paragraph.fr
Venue:
Fundamenta Informaticae
Year:
2005

Citing 19
Cited 0

Foundations of logic programming

Foundations of logic programming
The alternating fixpoint of logic programs with negation

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Extended stable semantics for normal and disjunctive programs

Logic programming
Negation in rule-based database languages: a survey

Selected papers of the workshop on Deductive database theory
Well-founded semantics coincides with three-valued stable semantics

Fundamenta Informaticae
Generalized disjunctive well-founded semantics for logic programs: procedural semantics

Methodologies for intelligent systems, 5
Complexity aspects of various semantics for disjunctive databases

PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Adding disjunction to datalog (extended abstract)

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation

Information and Computation
Expressive power and complexity of partial models for disjunctive deductive databases

Theoretical Computer Science
Unfounded sets and well-founded semantics for general logic programs

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
On the partial semantics for disjunctive deductive databases

Annals of Mathematics and Artificial Intelligence
Characterizations of the Disjunctive Well-Founded Semantics: Confluent Calculi and Iterated GCWA

Journal of Automated Reasoning
An Alternating Well-Founded Semantics for Query Answering in Disjunctive Databases

FQAS '98 Proceedings of the Third International Conference on Flexible Query Answering Systems
Semantics of Disjunctive Deductive Databases

ICDT '92 Proceedings of the 4th International Conference on Database Theory
Partial Evidential Stable Models for Disjunctive Deductive Databases

LPKR '97 Selected papers from the Third International Workshop on Logic Programming and Knowledge Representation
A Comparative Study of Well-Founded Semantics for Disjunctive Logic Programs

LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
WF³: A Semantics for Negation in Normal Disjunctive Logic Programs

ISMIS '91 Proceedings of the 6th International Symposium on Methodologies for Intelligent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new partial semantics for disjunctive deductive databases that we call disjunctive well-founded semantics. This semantics extends the classical well-founded semantics of normal databases for disjunctive databases. We give a declarative definition as well as a computational procedure for this new semantics. We prove that, in the case of disjunctive positive databases, i.e. disjunctive databases without negation, the disjunctive well-founded semantics coincides with the intersection of the minimal models.