The complexity of reusing and modifying rulebases
Pages 316 - 330
Abstract
This paper develops a method for reusing and modifying deductive databases. Such methods are needed when new rulebased applications differ only slightly from existing ones or when an application is to be incrementally updated. In order to facilitate reuse, we extend deductive databases by the concept of predicate substitution. In this way, during query evaluation, not only variables, but also predicates can be substituted. This paper continues our earlier work on predicate substitution in two directions: (i We extend the concept to a wider class of rulebase modifications, and (ii) we estblish tight bounds on the data complexity of Datalog augmented with substitution, showing it to be EXPTIME-complete. Predicate substitution thus increases the power of Datalog to express database queries. The paper presents a proof theory and model theory for the language, including a fixpoint semantics.
References
[1]
K.R. Apt and M.H. Van Emden. Contributions to the Theory of Logic Programming. Journal of the ACM, 29(3):841-862, 1982.
[2]
A.J. Bonner. The complexity of reusing and modifying rulebases. Technical report, Computer Systems Research Institute, University of Toronto, Toronto, Ont, Canada MSS 1A1, 1991. in preparation.
[3]
A.J. Bonnet. Hypothetical Reasoning in Deductive Databases. PhD thesis, Department of Computer Science, Rutgers University, New Brunswick, NJ 08903, USA, October 1991. Published as Rutgers Technical Report DCS-TR-283.
[4]
A.J. Bonnet and T. Imielinski. The Reuse and Modification of Rulebases by Predicate Substitution. In Proceedings o/ the International Conference on Extending Database Technology (EDBT), pages 437-451, Fondazione Cini, Venice, Italy, March 26-30 1990.
[5]
A.K. Chandra, D. Kozen, and L.J. Stockmeyer. Alternation. Journal of the A CM, 28:114-133, 1981.
[6]
W. Chen, M. Kifer, and D.S. Warren. HiIog: A First-Order Semantics for HigherqOrder Logic Programming Constructs. In Proceedings of the North American Conference on Logic Programming (NACLP), pages 1090-1114, 1989.
[7]
J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
[8]
C.S. Kwok and M. Sergot. Implicit Definiton of Logic Programs. In Proceedings of the 5th International Conference on Logic Programming (ICLP), pages 374-385.
[9]
A. Tarski. A Lattice-Theoretical Fixpoint Theorem and its Applications. Pacific Journal of Mathematics, 5:285-309, 1955.
[10]
M.H. Van Emden and R.A. Kowalski. The Semantics of Predicate Logic as a Programming Language. Journal of the A CM, 23(4):733-742, 1976.
Index Terms
- The complexity of reusing and modifying rulebases
Recommendations
Reusing and Modifying Rulebases by Predicate Substitution
Special issue: dedicated to the memory of Paris KanellakisWe propose a method for reusing and modifying a deductive database. The need for such techniques occurs when new rulebased applications differ only slightly from existing ones or when an application is to be incrementally updated. Such techniques are ...
Expressiveness and complexity of graph logic
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provides the simplest setting in which to explore such results for spatial ...
On the Complexity of Explicit Modal Logics
Proceedings of the 14th Annual Conference of the EACSL on Computer Science LogicExplicit modal logic was introduced by S. Artemov. Whereas the traditional modal logic uses atoms □F with a possible semantics "F is provable", the explicit modal logic deals with atoms of form t:F, where t is a proof polynomial denoting a specific ...
Comments
Information & Contributors
Information
Published In
Copyright © 1992 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 July 1992
Check for updates
Qualifiers
- Article
Conference
Acceptance Rates
Overall Acceptance Rate 642 of 2,707 submissions, 24%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 218Total Downloads
- Downloads (Last 12 months)39
- Downloads (Last 6 weeks)4
Reflects downloads up to 01 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in