A sound and complete view update procedure for a probabilistic deductive database is formulated using SLDp derivation trees introduced by Ng and Subrahmanian in 8]. In order to reduce the number of valid translations that can satisfy an update request a preference criteria is proposed. Moreover, we introduce a method called-factor to minimize the change eeected by updates in the database.

We study the complexity of data disjunctions in disjunctive deductive databases (DDDBs), i.e., minimal clauses R( c1) _ _ R( ck), k 2, derived from the database in which all atoms involve the same predicate R. We consider deciding existence and uniqueness of a data disjunction, as well as actually computing one, both for propositional (data) and nonground (program) complexity of the database. O...

Even competent programmers make mistakes. Automatic verification can detect errors, but leaves the frustrating task of finding the erroneous line of code to the user. This paper presents an automatic approach for identifying potential error locations in software. It is based on a deductive verification engine, which detects errors in functions annotated with preand post-conditions. Using an aut...

The use of deductive techniques, such as theorem provers, has several advantages in safety verification of hybrid systems. There is often a gap, however, between the type of assistance that a theorem prover requires to make progress on a proof task and the assistance that a system designer is able to provide. To address this deficiency we present an extension to the deductive verification frame...

Recent evidence suggests that interleukin-1beta (IL-1beta), which was originally identified as a proinflammatory cytokine, is also required in the brain for memory processes. We have previously shown that IL-1beta synthesis in the hippocampus is dependent on P2X(7) receptor (P2X(7)R), which is an ionotropic receptor of ATP. To substantiate the role of P2X(7)R in both brain IL-1beta expression a...

A method of deductive learning is proposed to con trol deductive inference Our goal is to improve prob lem solving time by experience when that experience monotonically adds knowledge to the knowledge base Accumulating and exploiting experience are done by the schemes of knowledge migration and knowledge shadowing Knowledge migration generates speci c migrated rules from general migrating rules...

In this paper we present an underspeci ed logic, i.e. a pair consisting of a proper underspeci ed semantic representation formalism and a deductive component that directly operates on these structures. We show how the main features of this formalism can be imported into other existing underspeci ed semantic representation formalisms. We also show that deduction rules may be imported there along...