Positivism vs minimalism in deductive databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
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
On the relationship between circumscription and negation as failure
Artificial Intelligence
Weak generalized closed world assumption
Journal of Automated Reasoning
Journal of the ACM (JACM)
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Tie-breaking semantics and structural totality
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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 complexity of propositional closed world reasoning and circumscription
Journal of Computer and System Sciences
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
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
Complexity aspects of various semantics for disjunctive databases
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations
Fundamenta Informaticae
Hi-index | 0.00 |
Two main approaches have been followed in the literature to give a semantics to non-Horn databases. The first one is based on considering the set of rules composing the programs as inference rules and interpreting the negation in the body as failure to prove. The other approach is based on the so-called closed-world assumption and its objective is to define a stronger notion of consequence from a theory than the classical one, where, very roughly, negative information can be inferred whenever its positive counterpart cannot be deduced from the theory. In this work we generalize the semantics for negation in logic programs, putting together the constructive nature of the rule-based deductive databases with the syntax-independence of the closed-world reasoning rules. These generalized semantics are shown to be a well-motivated and well-founded alternative to closed-world assumptions since they enjoy nice semantic and computational properties.