Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 25 for “"Deductive databases"”.

  1. Reasoning with contradictory deductive databases

    Thesis (Ph. D.)--Michigan State University. Department of Computer Science, 1994

    msu Repository record for Reasoning with contradictory deductive databases (opens in a new tab)

  2. Negation in logic and deductive databases

    This thesis studies negation in logic and deductive databases. Among other things, two kinds of negation are discussed in detail: strong negation and nonmonotonic negation. In the logic part, we have constructed a first-order logic CF 0 of strong negation with bounded quantifiers. The logic is …

    whiterose Download PDF for Negation in logic and deductive databases (opens in a new tab)

  3. DJ: Bridging Java and Deductive Databases

    … to manage data effectively. While relational databases have been the industry standard for the past quarter century, recent growth in data volumes and complexity requires novel data management solutions. These trends revitalized the interest in deductive databases and highlighted the need for …

    vt Repository record for DJ: Bridging Java and Deductive Databases (opens in a new tab)

  4. Extending magic sets techniques to deductive databases with uncertainty

    … of goal structure, we extend these techniques to deductive databases with uncertainty in the context of the parametric framework (PF). In our endeavor, we develop the generalized magic sets and generalized supplementary magic sets techniques, and establish their correctness. We have implemented …

    concordia Download PDF for Extending magic sets techniques to deductive databases with uncertainty (opens in a new tab)

  5. On efficient fixpoint computation of deductive databases with uncertainty

    … been proposed to manage uncertain information in deductive databases and expert systems. These proposals address fundamental issues of modeling, semantics, query processing and optimization. However, there have been fewer reports on efficient implementation of such frameworks. In this research, we …

    concordia Download PDF for On efficient fixpoint computation of deductive databases with uncertainty (opens in a new tab)

  6. Towards a generalized theory of deductive databases with uncertainty

    … is identified as a challenging issue in databases [SSU91]. Logic database programming, with its declarative advantage and its powerful top-down and bottom-up query processing techniques has attracted the attention of researchers, and numerous logic frameworks with uncertainty have been …

    concordia Download PDF for Towards a generalized theory of deductive databases with uncertainty (opens in a new tab)

  7. INTEGRITY CONSTRAINT CHECKING OF TRANSACTIONS FOR RELATIONAL AND DEDUCTIVE DATABASES

    … are treated in detail, namely, the relational databases and the deductive databases. Integrity constraints are rules which data in a database are to be observed. The integrity constraint checking problem for transactions is to find an algorithm to improve the checking of a given set of …

    nus Repository record for INTEGRITY CONSTRAINT CHECKING OF TRANSACTIONS FOR RELATIONAL AND DEDUCTIVE DATABASES (opens in a new tab) Download file for INTEGRITY CONSTRAINT CHECKING OF TRANSACTIONS FOR RELATIONAL AND DEDUCTIVE DATABASES (opens in a new tab)

  8. Studies on the Optimization of Query Processing in Deductive Databases

    本文データは平成22年度国立国会図書館の学位論文(博士)のデジタル化実施により作成された画像ファイルを基にpdf変換したものである

    kyoto Repository record for Studies on the Optimization of Query Processing in Deductive Databases (opens in a new tab)

  9. Recursive query optimization in deductive databases via proof-tree transformations

    Uses the proof-tree transformation technique to study two different recursive query optimization problems: 1-boundedness, and, stage preserving linearizability.

    concordia Download PDF for Recursive query optimization in deductive databases via proof-tree transformations (opens in a new tab)

  10. PROOFS OF EQUALITY IN DEDUCTIVE DATABASE SYSTEMS

    Deductive databases extend traditional databases by integrating logic-based inference rules, offering capabilities beyond simple data retrieval and enabling complex queries and data derivations. These systems are especially valuable for applications that require inferring new relationships and …

    cornell Repository record for PROOFS OF EQUALITY IN DEDUCTIVE DATABASE SYSTEMS (opens in a new tab)

  11. A HIGH-ORDER LOGIC FOR OBJECT-ORIENTED LOGIC PROGRAMMING

    Deductive and object-oriented databases are two important extensions of the traditional database technology. Deductive databases extend the expressive power of traditional databases by means of recursion and declarative querying. Object-oriented databases extend the data modelling power of …

    nus Repository record for A HIGH-ORDER LOGIC FOR OBJECT-ORIENTED LOGIC PROGRAMMING (opens in a new tab) Download file for A HIGH-ORDER LOGIC FOR OBJECT-ORIENTED LOGIC PROGRAMMING (opens in a new tab)

  12. Optimizations for model computation based on partial instantiation

    … have been presented for efficiently evaluating deductive databases and logic programs. It has been shown that mixed integer programming methods can ef fectively support minimal model, stable model and well-founded model semantics for ground deductive databases. However, the “groundness” …

    ubc Repository record for Optimizations for model computation based on partial instantiation (opens in a new tab) Download PDF for Optimizations for model computation based on partial instantiation (opens in a new tab)

  13. Query processing and optimization in deductive databasses with certainty constraints

    … to represent and reason about uncertainty in deductive databases. Based on the way in which uncertainties are associated with the facts and rules in programs, these frameworks have been classified into: "annotation based" (AB) and "implication based" (IB). [Shi05] has investigated the relative …

    concordia Download PDF for Query processing and optimization in deductive databasses with certainty constraints (opens in a new tab)

  14. Indefinite and maybe information in deductive relational databases

    … then used to implement a subclass of indefinite deductive databases. A special class of non-Horn rules, called I-rules, is defined. An additional operator, called project-union, which is a further extension to the extended projection operator is presented. The project-union operator is used to …

    iastate Repository record for Indefinite and maybe information in deductive relational databases (opens in a new tab)

  15. On the design and implementation of a top-down datalog interpreter in C++

    … programming paradigm. Datalog is the language of deductive databases, obtained by extending the basic relational database model with the reasoning capability, that is, one can not only query about the facts stored explicitly in the database but also query about derived facts. Datalog provides the …

    concordia Download PDF for On the design and implementation of a top-down datalog interpreter in C++ (opens in a new tab)

  16. KLM-Style Defeasible Reasoning for Datalog

    … language, designed for querying large deductive databases. Syntactically, it can be viewed as a computationally feasible fragment of firstorder logic, so this continues a recent line of work in which the Klm framework is lifted to more expressive languages.

    cape-town Repository record for KLM-Style Defeasible Reasoning for Datalog (opens in a new tab)

  17. Deciding Second-order Logics using Database Evaluation Techniques

    … use of advanced implementation techniques for Deductive databases and for Logic Programs, in particular the use of tabling, yields a considerable improvement in performance over more traditional approaches. We also explore various optimizations of the proposed technique, in particular we …

    waterloo Repository record for Deciding Second-order Logics using Database Evaluation Techniques (opens in a new tab)

Page 1 of 2