On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
Journal of the ACM (JACM)
Complexity aspects of various semantics for disjunctive databases
PODS '93 Proceedings of the twelfth 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
ACM Transactions on Database Systems (TODS)
Expressive power and complexity of partial models for disjunctive deductive databases
Theoretical Computer Science
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Default Logic as a Query Language
IEEE Transactions on Knowledge and Data Engineering
Binding Propagation in Disjunctive Databases
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Minimal Founded Semantics for Disjunctive Logic Programming
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
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
Query Optimization of Disjunctive Databases with Constraints through Binding Propagation
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Disjunctive Logic Programming: A Survey and Assessment
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Minimal Founded Semantics for Disjunctive Logic Programming
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
| Hi-index | 0.00 |
In this paper, we propose a new 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, the minimal founded semantics seems to be, in some case, more intuitive, it gives meaning to programs which are meaningless under stable model semantics and it is not harder to compute. We study the expressive power of the semantics and show that for general disjunctive datalog programs it has the same power of disjunctive stable model semantics. We also present a variation of the minimal founded semantics, called strongly founded which on stratified programs coincide with the perfect model semantics.