Foundations of logic programming
Foundations of logic programming
A translation language complete for database update and specification
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Lecture notes in computer science on ICDT '88
Hypothetical datalog: complexity and expressibility
Lecture notes in computer science on ICDT '88
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
A logic-based language for database updates
Foundations of deductive databases and logic programming
Procedural and declarative database update languages
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Database updates in logic programming
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
First-Order Dynamic Logic
A Production Rule-Based Approach to Deductive Databases
Proceedings of the Fourth International Conference on Data Engineering
Deductive database languages: problems and solutions
ACM Computing Surveys (CSUR)
Extending Datalog with Declarative Updates
Journal of Intelligent Information Systems
Static Analysis of Logical Languages with Deferred Update Semantics
IEEE Transactions on Knowledge and Data Engineering
Extending Datalog with Deductive Databases
DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
| Hi-index | 0.01 |
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.