Formal specification language and deduction system for object-oriented models is proposed in this article. It extends ς-calculus introduced by Martín Abadi and Luca Cardelli with propositional connectives, and quantified terms. The first-order type system of ς-calculus serves as typing theory of suggested calculus. Deduction system consists of reduction rules of ς-terms, equality theory of ς-ca...

OBJECTIVE Acute lymphoblastic leukemia (ALL) is the most common malignancy of childhood, representing nearly one third of all pediatric cancers. Currently, the treatment of pediatric ALL is centered on tailoring the intensity of the therapy applied to a patient's risk of relapse, which is linked to the type of leukemia the patient has. Hence, accurate and correct diagnosis of the various leukem...

We present an automated deduction system for equational reasoning combining two different parallelization/distribution schemes: Strategy-compliant parallelization on the level of individual deduction steps (PaReDuX) and distributed cooperation of multiple agents with different search strategies (TEAMWORK). In our experiments we mainly observed a multiplication of the speed-ups of each approach ...

tions in data-mining applications. Induction extracts knowledge in the form of, say, rules or decision trees from existing data, and deduction applies induction results to interpret new data. An intelligent learning database (ILDB) system integrates machine-learning techniques with database and knowledge base technology. It starts with existing database technology and performs both induction an...

We present a natural deduction calculus for the quantified propositional linear-time temporal logic (QPTL) and prove its correctness. The system extends previous natural deduction constructions for the propositional linear-time temporal logic. These developments extend the applicability of the natural deduction to more sophisticated specifications due to the expressive power of QPTL and, on the...

In this paper we introduce a new natural deduction system for the logic of lattices, and a number of extensions of lattice logic with different negation connectives. We provide the class of natural deduction proofs with both a standard inductive definition and a global graph-theoretical criterion for correctness, and we show how normalisation in this system corresponds to cut elimination in the...

In this paper, new definitions of $L$-fuzzy closure operator, $L$-fuzzy interior operator, $L$-fuzzy remote neighborhood system, $L$-fuzzy neighborhood system and $L$-fuzzy quasi-coincident neighborhood system are proposed. It is proved that the category of $L$-fuzzy closure spaces, the category of $L$-fuzzy interior spaces, the category of $L$-fuzzy remote neighborhood spaces, the category of ...