Deduction trees and the view update problem in indefinite deductive databases
From MaRDI portal
Publication:1367079
DOI10.1023/A:1005779507994zbMATH Open0882.68055OpenAlexW1552875135MaRDI QIDQ1367079FDOQ1367079
Publication date: 4 February 1998
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1005779507994
Recommendations
Cited In (7)
- Complexity of Views: Tree and Cyclic Schemas
- Advances in Databases and Information Systems
- View updates in stratified disjunctive databases
- Model theoretic approach to view updates in deductive databases
- Title not available (Why is that?)
- Computing only minimal answers in disjunctive deductive databases
- The View-Update Problem for Indefinite Databases
This page was built for publication: Deduction trees and the view update problem in indefinite deductive databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367079)