This paper presents a three level architecture for a distributed deductive database system which extends the power of distributed database systems to include deductive capabilities. I t allows both knowledge-based and data-based information to be phared by the sites of a computer network in order to process user queries. The benefits and the possible ways of segregating the rulebase into differ...

The extension of integrity checking methods proposed for deductive relational databases to the case of object-oriented deductive databases ooers new opportunities for more eecient consistency control: a reduction of the search space by ner granularity of updates, and a reduction of runtime integrity checking by incremental maintenance of the executable code generated for evaluating simpliied ru...

This paper presents an extension to deductive databases, called quantified deductive databases, that incorporates universally quantified expressions (in coded form) in the body of rules. Since universally quantified expressions contain negations in their semantics, quantified deductive databases fall under the category of deductive databases with negation. Furthermore, depending on other factor...

Tabling has been acknowledged as a useful technique in the logic programming arena for enhancing both performance and declarative properties of programs. As well, deductive database implementations benefit from this technique for implementing query solving engines. In this paper, we show how unusual operations in deductive systems can be integrated with tabling. Such operations come from relati...

The design, implementation and performance of TwoGroups, a deductive database for the 58,761 groups of order 2n, (n # 8), is described. The system is implemented in NU-Prolog, a Prolog system with built-in functions for creating and using deductive databases. TwoGroups has a set-theoretic query language, which provides users with a familiar notation to access the data. The paper describes the d...

Ontologies in a legal expert system must be processed to suit all possible user cases within the field of law of the system. From the logical premises of a deductive system of express rules of law, legal ontologies may be implied to encompass the combinatorial explosion of possible cases that may lack one or more of the express antecedents in the deductive rule system. Express ontologies in ind...

Systems of conjunction, particularly where the conjunction of noncanonical constituents is involved, are not invariant across the range of natural languages. In this paper, we examine a number of problems involving conjunction and show that one apparent watershed between diierent systems of conjunction corresponds to a distinction in the scope of associativity rules in the landscape of substruc...

The power of deductive systems in general is that programs express what should be done and not how it should be done Nevertheless deductive systems need debugging and explanation facilities Indeed their operational semantics is less abstract than the declarative semantics of the programs If users have to understand all the low level details of the operational semantics much of the bene ts of us...

This chapter presents a framework that uses metaqueries to integrate inductive learning methods with deductive database technologies in the context of knowledge discovery from databases. Metaqueries are second-order predicates or templates, and are used for (1) Guiding deductive data collection, (2) Focusing attention for inductive learning, and (3) Assisting human analysts in the discovery loo...

We show that reifying the rules from hyperedge weights to first-class graph nodes automatically gives us rule expectations in any kind of grammar expressible as a deductive system, without any explicit algorithm for calculating rule expectations (such as the insideoutside algorithm). This gives us expectation maximization training for any grammar class with a parsing algorithm that can be state...