Paraconsistent disjunctive deductive databases

DOI10.1016/0304-3975(92)90214-ZzbMATH Open0745.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)

Cites Work

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

Cited In (18)

• A paraconsistent relational data model
• Duality for goal-driven query processing in disjunctive deductive databases
• \(\alpha\)-resolution principle based on first-order lattice-valued logic \(\text{LF}(X)\)
• \(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\)
• Quasi-classical reasoning in paraconsistent databases
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The value of the four values
• Title not available (Why is that?)
• Probabilistic logic programming
• A semantical framework for supporting subjective and conditional probabilities in deductive databases
• Reasoning with Uncertainty in Deductive Databases and Logic Programs
• Title not available (Why is that?)
• On Theorem Proving in Annotated Logics
• Title not available (Why is that?)
• The completeness of gp-resolution for annotated logics
• Title not available (Why is that?)

This page was built for publication: Paraconsistent disjunctive deductive databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1185011)