An infinite sequence ∆ = 〈∆n(x0, . . . , xn−1, y, ū) : n < ω〉 of possibly infinite sets of formulas in n + 1 variables x0, . . . , xn−1, y and a possibly infinite system of parameters ū is a parameterized graded deduction-detachment (PGDD) system for a deductive system S over a S-theory T if, for every n < ω and for all φ0, . . . , φn−1, ψ ∈ FmΛ, T, φ0, . . . , φn−1 `S ψ iff T `S ∆n(φ0, . . . ,...

Will reading habit influence your life? Many say yes. Reading meta level control for deductive database systems is a good habit; you can develop this habit to be such interesting way. Yeah, reading habit will not only make you have any favourite activity. It will be one of guidance of your life. When reading has become a habit, you will not make it as disturbing activities or as boring activity...

We exploit the spreadsheet metaphor to make deductive problem-solving methods available to the vast population of spreadsheet end users. In particular, we show how the function-based problem-solving capabilities of spreadsheets can be extended to include logical deductive methods in a way that is consistent with the existing spreadsheet “look and feel.” The foundation of our approach is the int...

ROL is a deductive object-oriented database system developed at the University of Regina. It supports important object-oriented features such as object identity, complex objects, classes, class hierarchies, multiple inheritance with overriding and blocking, and schema deenition. It also supports structured values such as functor objects and sets, providing powerful mechanisms for representing b...

A new temporal deductive database system supporting a non-standard model of time is introduced. It consists of Non-standard Temporal Datalog (nstl) and Non-standard Temporal Relational Algebra (nstra). The time line consists of non-standard reals that are of the form 〈r, z〉, where r ∈ R and z ∈ Z, using the natural order. Each real r determines a macro-instant, and each pair 〈r, z〉 defines a mi...

In this paper we describe a distributed environment for the evaluation of data intensive queries through deductive rules. The distributed database query answering system has been developed on the IBM SP (POWERParallel) available in Argonne National Laboratory. Beyond acting as a testbed, experiments with the system demonstrate that it ooers signiicantly improved performance over single processo...

We describe the design and implementation of the Glue-Nail deductive database system. Nail is a purely declarative query language; Glue is a procedural language used for non-query activities. The two languages combined are suucient to write a complete application. Nail and Glue code are both compiled into the target language IGlue. The Nail compiler uses variants of the magic sets algorithm and...

The traditional focus of knowledge engineering has been to acquire knowledge that can be used in deductive inference. Acquiring such knowledge invariably requires users to undergo extensive training. There are, however, aspects of the knowledge necessary for deductive inference that require much less training and sophistication. For example, capturing knowledge involving ground facts and concep...

We present in this paper both a novel theoretically well-founded framework for integrating the treatment of advanced update and rule enforcement problems in deductive databases and the architecture of a new deductive database management system based upon such a framework. Our results extend the query-processing and basic updating functionalities provided by current deductive database systems wi...