ACM Home Page
Please provide us with feedback. Feedback
Declarative expression of deductive database updates
Full text PdfPdf (934 KB)
Source Symposium on Principles of Database Systems archive
Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems table of contents
Philadelphia, Pennsylvania, United States
Pages: 93 - 100  
Year of Publication: 1989
ISBN:0-89791-308-6
Author
S. Manchanda  Department of Computer Science, University of Arizona, Tucson, AZ
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGMOD: ACM Special Interest Group on Management of Data
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 24,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/73721.73730
What is a DOI?

ABSTRACT

An update can be specified as a single database state transition, or as a sequence of queries and database state transitions. We give an extension of Datalog for expressing both types of update specifications on a logic database. The extension supports the simple and intuitive expression of basic update operations, hypothetical reasoning and update procedures. The extension possesses a possible-world semantics, and a sound and complete proof theory. Soundness and completeness is proved by showing that an update procedure can be mapped into a semantically equivalent Pure Prolog program. This means that the semantic and proof-theoretic results of Pure Prolog can be mapped into similar results for the Datalog extension.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
Abi88
 
ABW87
AV87
AV88
 
Bac88
Hamid Bacha. Meta-Prolog Design and Implementation. In Proceedings of the Fifth International Conference and Symposium of Logic Programming, pages 1371--1402, M1T Press, 1988.
 
BK82
K.A. Bowen and R. A. Kowalski. Amalgamating Language and Metalanguage in Logic Programming. In K. L. Clark and S. A. Taemlund, editors, Logic Programming, Academic Press, 1982.
 
Bon88
 
CH85
A. Chandra and D. Harel. Horn Clause Queries and Generalizations. Journal of Logic Programming, 1:1- -15, 1985.
 
dS88
 
GR84
D.M. Gabbay and U. Reyle. N-Prolog: An Extension of Prolog with Hypothetical Implications. Journal of Logic Programming, 1(4), December 1984.
 
Har79
 
JW84
 
Kri63
S. Kripke. Semantical Considerations on Modal Logic. Acta Philosophica Fennica, 16:83--94, 1963.
 
Mil86
Dale Miller. A Theory of Modules for Logic Programming. In Proceedings of the 1986 Symposium on Logic Programming, Salt Lake City, Utah, September 1986.
 
MSW86
Sanjay Manchanda, Soumtira Sengupta, and David S. Warren. Concurrent Updates in a Prolog Database System. Technical Report 86/28, SUNY at Stony Brook, StonyBrook, NY 11794, December 1986.
 
MW87
NK88
 
NTR87
Lee Naish, James A. Thorn, and Kotagiri Ramamohanarao. Concurrent Database Updates in Prolog. In International Conference on Logic Programming, pages 178--195, Melbourne, 1987.
 
Rei84
R. Reiter. Towards a Logical Reconstruction of Relational Database Theory. In M.Brodie, J. Myopoulos, and J. Schmidt, editors, On Conceptual Modelling, Springer-Verlag, 1984.
 
Tho88
James A. Thorn. A Declarative Approach to Database Updates. Technical Report 1/88, Department of Comuter Science, Royal Melbourne Institute of Technology, Melbourne 3001, 1988.
 
Ull88
 
War84
David Scott Warren. Database Updates in Pure Prolog. In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 244--253, ICOT, 1984.



Peer to Peer - Readers of this Article have also read: