Deductive Databases

The International Journal of Database Management Systems (IJDMS) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the database management systems & its applications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on understanding Modern developments in this filed and establishing new collaborations in these areas. Authors are solicited to contribute to the journal by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the areas of Database management systems. Topics of interest include, but are not limited to, the following • Constraint Modelling and Processing

The NU-Prolog Deductive Database System Kotagirl Ramamohanarao, John Shepherd, Isaac Ba/bin, Graeme Port, Lee Naish, James Thom, Justin Zobel, Philip Dart Department of Computer Science, University of Melbourne, Parkville, Victoria 3052, Australia Abstract We describe ...

As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a novel reasoning algorithm that reduces a \(\mathcal{SHIQ}\) knowledge base to a disjunctive datalog program while preserving the set of ground consequences. Queries can then be answered in the resulting program while reusing existing and practically proven optimization techniques of deductive databases, such as join-order optimizations or magic sets. Moreover, we use our algorithm to derive precise data complexity bounds: we show that \(\mathcal{SHIQ}\) is data complete for NP, and we identify an expressive fragment of \(\mathcal{SHIQ}\) with polynomial data complexity.

In this paper, we study a new semantics of logic programming and deductive databases. Thepossible model semantics is introduced as a declarative semantics of disjunctive logic programs. The possible model semantics is an alternative theoretical framework to the classical minimal model semantics and provides a flexible inference mechanism for inferring negation in disjunctive logic programs. We also present a proof procedure for the possible model semantics and show that the possible model semantics has an advantage from the computational complexity point of view.

The NU-Prolog Deductive Database System Kotagirl Ramamohanarao, John Shepherd, Isaac Ba/bin, Graeme Port, Lee Naish, James Thom, Justin Zobel, Philip Dart Department of Computer Science, University of Melbourne, Parkville, Victoria 3052, Australia Abstract We describe ...

Contributing authors: Manfred Jeusfeld, Martin Staudt, Hans Nissen, Christoph Quix, Lutz Bauer, Rainer Gallersd̈oerfer, Michael Gebhardt, Matthias Jarke, Thomas List, Ren e Soiron


ConceptBase.cc (in short ConceptBase) is a multi-user deductive object manager intended
for conceptual modeling, metamodeling, and coordination in design environments. The system implements
O-Telos, a dialect of Telos integrating deductive and object-oriented paradigms. It uniformly represents all
information regardless of its abstraction level (data, class, meta class, meta meta class etc.) in a single
data structure called P-facts. The deductive query language is seamlessly integrated into the meta class
hierarchy. Modeling is supported by meta classing, deduction and integrity checking, active rule speci-
fication, functional definition of computation, a module concept, and a rollback mechanism for querying
past database states. These principles are combined orthogonally, e.g. deductive rules can be restricted
to modules, formulated for meta classes, employed in active rules using functional definitions to compute
properties, and be revised without overwriting the earlier definitions. The Java-based user interface CBIva
offers a palette of graphical interfaces, such as an Telos editor and a graph editor. The communication
between the user clients and the object base is organized in a client-server architecture using TCP/IP. The
Java-based command line interface CBShell allows for easy scripting of commands directed to a Concept-
Base server. The CBShell source code can also be used as a programming interface to ConceptBase.

The concept of logic databases can serve as a clear and expressive foundation of various kinds of information systems. However, classical logic languages refer to a single database state, whereas in modern information systems it is necessary to take dynamic behaviour into account. For this purpose, several update languages have been proposed, among them [1,5,6,9,16,17,18,23], which allow to specify complex transitions from one database state to another. From the evaluation point of view, a complex state transition can and should be considered as a transaction. Up to now, the isolation property of transactions has been poorly addressed in the context of logic update languages, although it is an important problem even for classical, sequential transactions (see

The paper proposes a logic framework for modeling the interaction among deductive databases and computing consistent answers to logic queries in a P2P environment. As usual, data are exchanged among peers by using logical rules, called mapping rules. The novelty of our approach is that only data not violating integrity constraints are exchanged. The (declarative) semantics of a P2P system is defined in terms of weak models. Under this semantics only facts not making the local databases inconsistent are imported, and the preferred weak models are those in which peers import maximal sets of facts not violating integrity constraints. An equivalent and alternative characterization of preferred weak model semantics, in terms of prioritized logic programs, is also introduced and the computational complexity of P2P logic queries is investigated.

Abstract: We address the problem of retrieving certain and consistentanswers to queries posed to a mediated data integration system with opensources under the local-as-view paradigm using conjunctive and disjunctiveview definitions. For obtaining certain answers a query program isrun on top of a normal deductive database with choice that defines theclass of minimal legal instances of the integration system under the cautiousstable model semantics. This methodology works for all monotone...

This paper presents an approach to the development of a deductive object-oriented database system, describing the key design decisions and their consequences for implementation. The approach is novel, in that it integrates an object-oriented database system manipulated using an imperative programming language (ROCK) with a logic language for expressing queries and methods (ROLL). The integration is made seamless by deriving both the imperative and logic languages from a single formally defined data model, thereby avoiding impedance mismatches when they are integrated.

SLG resolution uses tabling to evaluate nonfloundering normal logic pr ograms according to the well-founded semantics. The SLG-WAM, which forms the engine of the XSB system, can compute in-memory recursive queries an order of magnitute faster than current deductive databases. At the same time, the SLG-WAM tightly intergrates Prolog code with tabled SLG code, and executes Prolog code with minimal overhead compared to the WAM. As a result, the SLG-WAM brings to logic programming important termination and complexity properties of deductive databases. This article describes the architecture of the SLG-WAM for a powerful class of programs, the class of fixed-order dynamically stratified programs . We offer a detailed description of the algorithms, data structures, and instructions that the SLG-WAM adds to the WAM, and a performance analysis of engine overhead due to the extensions.

DeepTelos is a straightforward extension of the Telos modeling language to allow some form of multi-level modeling. A variant of Telos has been implemented in the ConceptBase system on top of a Datalog engine. Telos defines the concepts of instantiation, specialization and attribution/relations by means of axioms. In addition, the user can define new constructs by deductive rules, integrity constraints, and so-called query classes. In this paper, we tackle the process challenge formulated for the MULTI 2019 workshop to see to which extent DeepTelos is able to represent the requirements of this challenge.

An important problem that arises when updating a deductive database is the one related to integrity constraints maintenance. That is, given a consistent database and an update request, to obtain all possible ways of updating the base facts such that the request is satisfied while consistency of the database is maintained. This problem becomes more complex when view updates may