The aim of this paper is the partial axiomatization for firstorder predicate calculus formal system based on first-level universal AND operator. By introducing the universal quantifier and existential quantifier, a predicate calculus formal deductive system ∀ULh∈(0,1] based on 1-level universal AND operator according to propositional calculus formal deductive system ULh∈(0,1] of universal logic...

This paper gives a brief description of the KeY system, a tool written as part of the ongoing KeY project, which is aimed at bridging the gap between (a) OO software engineering methods and tools and (b) deductive verification. The KeY system consists of a commercial CASE tool enhanced with functionality for formal specification and deductive verification.

This is an overview of the knowledge base management system called Kappa, one of the research and development activities performed at ICOT on databases and knowledge bases. The underlying data model is a nested relational model, and some complex data models are constructed and under consideration on the model. Deductive databases are constructed as one of knowledge base mechanisms and further e...

In this paper, we will report on the experience of building a successful industrial application using the LDL++ deductive database as part of the technology transfer process to our sponsor company, Eastman Chemical Company. We will describe the nature of the problems faced by Eastman Chemical Company and show how the LDL++ deductive database technology helps to build an Intelligent Information ...

A pair of deductive systems (S,S’) is Leibniz-linked when S’ is an extension of S and on every algebra there is a map sending each filter of S to a filter of S’ with the same Leibniz congruence. We study this generalization to arbitrary deductive systems of the notion of the strong version of a protoalgebraic deductive system, studied in earlier papers, and of some results recently found for pa...

The recent development of abstract algebraic logic has led to a reconsideration of the universal algebraic theory of ordered algebras from a new perspective. The familiar equational logic of Birkhoff can be naturally viewed as one of the deductive systems that constitute the main object of study in abstract algebraic logic; technically it is a deductive system of dimension two. Large parts of u...

An infinite sequence ∆ = 〈∆n(x0, . . . , xn−1, y, ū) : n < ω〉 of possibly infinite sets of formulas in n + 1 variables x0, . . . , xn−1, y and a possibly infinite system of parameters ū is a parameterized graded deduction-detachment (PGDD) system for a deductive system S over a S-theory T if, for every n < ω and for all φ0, . . . , φn−1, ψ ∈ FmΛ, T, φ0, . . . , φn−1 `S ψ iff T `S ∆n(φ0, . . . ,...

Will reading habit influence your life? Many say yes. Reading meta level control for deductive database systems is a good habit; you can develop this habit to be such interesting way. Yeah, reading habit will not only make you have any favourite activity. It will be one of guidance of your life. When reading has become a habit, you will not make it as disturbing activities or as boring activity...

We exploit the spreadsheet metaphor to make deductive problem-solving methods available to the vast population of spreadsheet end users. In particular, we show how the function-based problem-solving capabilities of spreadsheets can be extended to include logical deductive methods in a way that is consistent with the existing spreadsheet “look and feel.” The foundation of our approach is the int...