A deductive system S (in the sense of Tarski) is Fregean if the relation of interderivability, relative to any given theory T , i.e., the binary relation between formulas { 〈α, β〉 : T, α `S β and T, β `S α }, is a congruence relation on the formula algebra. The multiterm deduction-detachment theorem is a natural generalization of the deduction theorem of the classical and intuitionistic proposi...

This paper describes a Deductive Object-Oriented Database (DOOD) system that is built on top of an active Object-Oriented Database (OODB) system. The system, named DEVICE, uses the primitives of the latter, like active rules, simple and complex events, to integrate deductive and production rules. The integration is based on the emulation of deductive rules by special purpose if-then-else produc...

The notion of deductive database is generalized by extending the rst-order language, used to formulate facts, rules and constraints, to a rst-order language involving time operators. A deductive database based on such an extended language is called temporal. In this paper, we rst introduce two additional time operators, one to reference past tenses, the other to reference future tenses. Then, t...

We review in this paper both a framework for integrating the treatment of advanced update problems in deductive databases and the architecture of the FOLRE deductive database management system prototype, which extends the basic updating facilities provided by current deductive database systems. The distinguishing feature of our approach is the underlying integrative framework used to specify an...

In this paper we present O-DEVICE, a deductive object-oriented knowledge base system for reasoning over OWL documents. O-DEVICE imports OWL documents into the CLIPS production rule system by transforming OWL ontologies into an object-oriented schema of the CLIPS Object-Oriented Language (COOL) and instances of OWL classes into COOL objects. The purpose of this transformation is to be able to us...

This paper illustrates a prototype system, called GPRS, supporting the Generalized Production Rules database language (GPR for short). The language GPR integrates, in a unified framework, active rules, which allow the specification of event driven computations on data, and deductive rules, which can be used to derive intentional relations in the style of logic programming. The prototype realize...