Inferring negative information from disjunctive databases
Basic concepts of disjunctive databases are defined. Various rules for inferring negative clauses are compared (open and closed world assumption - OWA and CWA, negation as failure, generalized CWA, extended generalized CWA, extended CWA, perfect model rule - PMR). The criteria of comparison are conciseness, efficiency, consistency, decrease, inclusive interpretation of disjunction and (logical) invariability. Two equivalent definitions of a new inference rule, the ``disjunctive database rule - DDR - are given. The first of them is based on the concept of a closed set of a database (a subset of the Herbrand base for the first order language of the database). The second definition is based on the least fixed point of a mapping from the lattice of Herbrand interpretations for a database into itself. Properties of the DDR are investigated. The results are extended to the class of layered databases (with predicate hierarchy), where the DDR is implemented as a ``negation as positive failure or an ``acyclic negation as positive failure. The effectivity of implementation and the problem of query evaluation are discussed. With respect to the given criteria, DDR compares favourably with the generalized CWA and PMR. DDR offers a straightforward mechanism for exclusive/inclusive interpretation of disjunction and for predicate protection from inference rule application. Some open problems involving disjunctive databases are reviewed.
- A basis for deductive database systems
- A basis for deductive database systems II
- Computing protected circumscription
- Deduction in non-Horn databases
- Deleting Repeated Goals in the Problem Reduction Format
- Horn clause queries and generalizations
- scientific article; zbMATH DE number 4199656 (Why is no real title available?)
- scientific article; zbMATH DE number 3755910 (Why is no real title available?)
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 4185011 (Why is no real title available?)
- On the relationship between circumscription and negation as failure
- The Semantics of Predicate Logic as a Programming Language
- Paraconsistent disjunctive deductive databases
- Interpreting disjunctive logic programs based on a strong sense of disjunction
- An alternative approach to the semantics of disjunctive logic programs and deductive databases
- Autoepistemic logic of knowledge and beliefs
- Weak generalized closed world assumption
- Theory and algorithms for disjunctive deductive databases
- Static semantics for normal and disjunctive logic programs
- On the computational cost of disjunctive logic programming: Propositional case
- Logic programming and reasoning with incomplete information
- Using clausal deductive databases for defining semantics in disjunctive deductive databases
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
- Rules for inferring negative information from disjunctive databases and deductive databases
- Introducing negative information in relational databases
- Manipulation of exclusive disjunctive data in relational databases
- scientific article; zbMATH DE number 1507287 (Why is no real title available?)
- Stable classes and operator pairs for disjunctive programs
- An abductive framework for negation in disjunctive logic programming
- Characterizing D-WFS: confluence and iterated GCWA
- Prolegomena to logic programming for non-monotonic reasoning
- Query evaluation in probabilistic relational databases
- Parsing as non-Horn deduction
- Reasoning under minimal upper bounds in propositional logic
- Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete
This page was built for publication: Inferring negative information from disjunctive databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114440)
