Skip to main content
SpringerLink
Log in

Logical approximation

  • Original paper
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

 The principle approach to the construction of approximating formulas is discussed. We suggest the generalized definition of normal forms in predicate BL-logic and prove the conditional equivalence between a formula and each of its normal forms. Some mutual relations between normal forms will be also established.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. University of Ostrava, Institute for Research and Applications of Fuzzy Modeling, 30. dubna 22, 701 03 Ostrava 1, Czech Republic e-mail: irina.perfilieva@osu.cz, , , , , , CZ

    I. Perfilieva

Authors
  1. I. Perfilieva
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The author thanks to the anonymous reviewer whose remarks helped to improve the readability of the paper.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Perfilieva, I. Logical approximation. Soft Computing 7, 73–78 (2002). https://doi.org/10.1007/s00500-002-0173-y

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-002-0173-y

Search

Navigation