Paraconsistent disjunctive deductive databases

DOI10.1016/0304-3975(92)90214-ZzbMath0745.68042OpenAlexW2000398632WikidataQ126457933 ScholiaQ126457933MaRDI QIDQ1185011

V. S. Subrahmanian

Publication date: 28 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90214-z

Mathematics Subject Classification ID

Database theory (68P15)

Related Items

Quasi-classical reasoning in paraconsistent databases, A paraconsistent relational data model, Unnamed Item, The completeness of gp-resolution for annotated logics, Probabilistic logic programming, \(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\), \(\alpha\)-resolution principle based on first-order lattice-valued logic \(\text{LF}(X)\), On Theorem Proving in Annotated Logics, The value of the four values, Reasoning with Uncertainty in Deductive Databases and Logic Programs, A semantical framework for supporting subjective and conditional probabilities in deductive databases

Cites Work

• Inferring negative information from disjunctive databases
• A semantical analysis of the calculi \(C_n\)
• Paraconsistent logic programming
• On stratified disjunctive programs
• Deduction in non-Horn databases
• On the theory of inconsistent formal systems
• A fixpoint semantics for disjunctive logic programs
• A RING-THEORETIC BASIS FOR LOGIC PROGRAMMING
• On compiling queries in recursive first-order databases
• Maintaining state constraints in relational databases: a proof theoretic basis
• Bilattices and the semantics of logic programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item