Logic based knowledge processing systems such as PROLOG based expert systems have shown obvious drawbacks in performing conventional database tasks. Knowledge processing by deduction on a large set of given facts can be better performed by a deductive database system based on Horn logic and relational database theory. A concept is presented to extend an existing relational database system to ma...

Disjunctive Deductive Databases (DDDBs) | function-free disjunctive logic programs with negation in rule bodies allowed | have been recently recognized as a powerful tool for knowledge representation and commonsense reasoning. Much research has been spent on issues like semantics and complexity of DDDBs, but the important area of implementing DDDBs has been less addressed so far. However, a tho...

This paper presents a technique for further applications of deductive databases in the eld of natural language processing. Although there were enormous research eeorts on analyzing the semantics of natural languages (NL), especially using Montague grammars (PTQ) for Prolog, corresponding programs for deductive databases are still missing, since range restriction is required in nearly all deduct...

Modular deductive veri cation of software systems is a complex task: the user has to put a lot of e ort in writing module speci cations that t together when verifying the system as a whole. In this paper, we propose a combination of deductive veri cation and software bounded model checking (SBMC), where SBMC is used to support the user in the speci cation and veri cation process, while deductiv...

Outer joins are extended relational algebra operations intended to deal with unknown information represented with null values. This work shows an approach to embed both null values and outer join operations in the deductive database system DES (Datalog Educational System), which uses Datalog as a query language. This system also supports SQL, where views and queries are compiled to Datalog prog...

We report on a case study in using logical frameworks to support the formalization of programming calculi and their application to deduction-based program synthesis. Within a conservative extension of higher-order logic implemented in the Isabelle system, we derived rules for program development that can simulate those of the deductive tableau proposed by Manna and Waldinger. We have used the r...

As a step toward automatic circuit understanding, we have developed a method for parsing circuit topology in a deductive system called Duck. A circuit is viewed as a sentence and its elements as words. Generating circuits with specific functions is represented by deductive rules analogous to definite clause grammars. Using those rules, an object circuit is decomposed into a parse tree of functi...

This paper proposes to answer some questions concerning economy in computation and language by giving a very compact set of deductive rules (based on the so-called Lambek calculus, enriched with an exchange modality) which embodies all the properties of Minimalist Grammars (Stabler, 15]). move is replaced by a logical operation, very similar in its eeects to Form Chain, technically known as the...

Deductive program synthesis systems based on automated theorem proving o er the promise of \correct by construction" software. However, the diÆculty encountered in constructing usable deductive synthesis systems has pr evente d their widespr ead use. A mphion is a realworld, domain-independent programsynthesis system. It is specialized to speci c applications through the creation of an operatio...

A Distributed Deductive Database System consists of many autonomous deductive database systems connected by a computer network to facilitate sharing of both database and rules. The design of a distributed deductive database system diiers from the design of conventional non-distributed deductive database systems. The former requires design of distribution of both the database and rulebase, where...