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
The alternating fixpoint of logic programs with negation
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logic programming and databases
Logic programming and databases
The KIWIS knowledge base management system
CAiSE '91 Proceedings of the third international conference on Advanced information systems engineering
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Stationary semantics for disjunctive logic programs and deductive databases
Proceedings of the 1990 North American conference on Logic programming
Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
Preferred extensions are partial stable models
Journal of Logic Programming
Stable and extension class theory for logic programs and default logics
Journal of Automated Reasoning
Adding disjunction to datalog (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Proceedings of the eleventh international conference on Logic programming
A three-valued semantics for deductive databases and logic programs
Journal of Computer and System Sciences
Modular stratification and magic sets for Datalog programs with negation
Journal of the ACM (JACM)
The expressive powers of the logic programming semantics
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The expressive powers of stable models for bound and unbound DATALOG queries
Journal of Computer and System Sciences - special issue on complexity theory
Three-valued formalization of logic programming: is it needed?
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Stable models and non-determinism in logic programs with negation
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
COMPLEX: An Object-Oriented Logic Programming System
IEEE Transactions on Knowledge and Data Engineering
A Deductive Environment for Dealing with Objects and Nonmonotonic Reasoning
IEEE Transactions on Knowledge and Data Engineering
Semantics of Disjunctive Deductive Databases
ICDT '92 Proceedings of the 4th International Conference on Database Theory
Deterministic and Non-Deterministic Stable Model Semantics for Unbound DATALOG Queries
ICDT '95 Proceedings of the 5th International Conference on Database Theory
Generalized Negation As Failure and Semantics of Normal Disjunctive Logic Programs
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Second Order Logic and the Weak Exponential Hierarchies
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
The Expressive Power of Partial Models in Disjunctive Deductive Databases
LID '96 Proceedings of the International Workshop on Logic in Databases
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
On the Computation of Disjunctive Stable Models
DEXA '96 Proceedings of the 7th International Conference on Database and Expert Systems Applications
An Extension to GCWA and Query Evaluation for Disjunctive Deductive Databases
Journal of Intelligent Information Systems
Using clausal deductive databases for defining semantics in disjunctive deductive databases
Annals of Mathematics and Artificial Intelligence
Disjunctive Logic Programming: A Survey and Assessment
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Clausal Deductive Databases and a General Framework for Semantics in Disjunctive Deductive Databases
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
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
A Top-Down Procedure for Disjunctive Well-Founded Semantics
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Comparisons and computation of well-founded semantics for disjunctive logic programs
ACM Transactions on Computational Logic (TOCL)
Optimization of bound disjunctive queries with constraints
Theory and Practice of Logic Programming
Unfolding partiality and disjunctions in stable model semantics
ACM Transactions on Computational Logic (TOCL)
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
A New Partial Semantics for Disjunctive Deductive Databases
Fundamenta Informaticae
Annals of Mathematics and Artificial Intelligence
Composing Normal Programs with Function Symbols
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Analysing and extending well-founded and partial stable semantics using partial equilibrium logic
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
First-Order encodings for modular nonmonotonic datalog programs
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
A New Partial Semantics for Disjunctive Deductive Databases
Fundamenta Informaticae
On the equivalence between logic programming semantics and argumentation semantics
ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
| Hi-index | 0.00 |
Partial stable models for deductive databases, i.e., normal function-free logic programs (also called datalog programs), have two equivalent definitions: one based on 3-valued logics and another based on the notion of unfounded set. The notion of partial stable model has been extended to disjunctive deductive databases using 3-valued logics. In this paper, a characterization of partial stable models for disjunctive datalog programs is given using a suitable extension of the notion of unfounded set. Two interesting sub-classes of partial stable models, M-stable (Maximal-stable) (also called regular models, preferred extension,and maximal stable classes) and L-stable (Least undefined-stable) models, are then extended from normal to disjunctive datalog programs. On the one hand, L-stable models are shown to be the natural relaxation of the notion of total stable model; on the other hand the less strict M-stable models, endowed with a nice modularity property, may be appealing from the programming and computational point of view. M-stable and L-stable models are also compared with the regular models for disjunctive datalog programs recently proposed in the literature.