Displaying 61 – 80 of 156

Showing per page

A property of the solvable radical in finitely decidable varieties

Paweł M. Idziak, Matthew Valeriote (2001)

Fundamenta Mathematicae

It is shown that in a finitely decidable equational class, the solvable radical of any finite subdirectly irreducible member is comparable to all congruences of the irreducible if the type of the monolith is 2. In the type 1 case we establish that the centralizer of the monolith is strongly solvable.

A reduction-based theorem prover for 3-valued logic.

Gabriel Aguilera Venegas, Inmaculada Pérez de Guzmán, Manuel Ojeda Aciego (1997)

Mathware and Soft Computing

We present a new prover for propositional 3-valued logics, TAS-M3, which is an extension of the TAS-D prover for classical propositional logic. TAS-M3 uses the TAS methodology and, consequently, it is a reduction-based method. Thus, its power is based on the reductions of the size of the formula executed by the F transformation. This transformation dynamically filters the information contained in the syntactic structure of the formula to avoid as much distributions as possible, in order to improve...

A semantical hierarchy for modal formulas.

Salvatore Guccione, Roberto Tortora (1982)

Stochastica

In this paper a semantical partition, relative to Kripke models, is introduced for sets of formulas. Secondly, this partition is used to generate a semantical hierarchy for modal formulas. In particular some results are given for the propositional calculi T and S4.

A system for deduction-based formal verification of workflow-oriented software models

Radosław Klimek (2014)

International Journal of Applied Mathematics and Computer Science

The work concerns formal verification of workflow-oriented software models using the deductive approach. The formal correctness of a model's behaviour is considered. Manually building logical specifications, which are regarded as a set of temporal logic formulas, seems to be a significant obstacle for an inexperienced user when applying the deductive approach. A system, along with its architecture, for deduction-based verification of workflow-oriented models is proposed. The process inference is...

A theorem on implication functions defined from triangular norms.

Didier Dubois, Henri Prade (1984)

Stochastica

Several transformation which enable implication functions in multivalued logics to be generated from conjunctions have been proposed in the literature. It is proved that for a rather general class of conjunctions modeled by triangular norms, the generation process is closed, thus shedding some light on the relationships between seemingly independent classes of implication functions.

A theoretical comparison of disco and CADIAG-II-like systems for medical diagnoses

Tatiana Kiseliova (2006)

Kybernetika

In this paper a fuzzy relation-based framework is shown to be suitable to describe not only knowledge-based medical systems, explicitly using fuzzy approaches, but other ways of knowledge representation and processing. A particular example, the practically tested medical expert system Disco, is investigated from this point of view. The system is described in the fuzzy relation-based framework and compared with CADIAG-II-like systems that are a “pattern” for computer-assisted diagnosis systems based...

A theory of refinement structure of hedge algebras and its applications to fuzzy logic

Nguyen Ho, Huynh Nam (1999)

Banach Center Publications

In [13], an algebraic approach to the natural structure of domains of linguistic variables was introduced. In this approach, every linguistic domain can be interpreted as an algebraic structure called a hedge algebra. In this paper, a refinement structure of hedge algebras based on free distributive lattices generated by linguistic hedge operations will be examined in order to model structure of linguistic domains more properly. In solving this question, we restrict our consideration to the specific...

Currently displaying 61 – 80 of 156