Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: four-valued logics

Sortuj według:

Ogranicz wyniki do:

Issue of the use of construction objects in the point of view of the safety engineering

Baryłka Adam

Modern Engineering

2019

34--41

During periodic inspections, the technical condition and assessment of the suitability of the building object for further safe use are checked by: identification of symptoms of technical wear of the facility and estimation of the impact of this consumption on the functional properties and technical efficiency of the building. The paper proposes an assessment of the technical condition of buildings based on a four-valued logic.

An eight - valued praconsistent logic

Kamide N.

Reports on Mathematical Logic

2014

Vol. 49

3--21

It is known that many-valued paraconsistent logics are useful for expressing uncertain and inconsistency-tolerant reasoning in a wide range of Computer Science. Some four-valued and sixteen-valued logics have especially been well-studied. Some four-valued logics are not so fine-grained, and some sixteen-valued logics are enough fine-grained, but rather complex. In this paper, a natural eight-valued paraconsistent logic rather than four-valued and sixteen-valued logics is introduced as a Gentzen-type sequent calculus. This eight-valued logic is enough fine-grained and sim- pler than sixteen-valued logic. A triplet valuation semantics is introduced for this logic, and the completeness theorem for this semantics is proved. The cut-elimination theorem for this logic is proved, and this logic is shown to be decidable.

Modeling and Reasoning with Paraconsistent Rough Sets

Vitória A., Małuszyński J., Szałas A.

Fundamenta Informaticae

2009

Vol. 97, nr 4

405-438

We present a language for defining paraconsistent rough sets and reasoning about them. Our framework relates and brings together two major fields: rough sets [23] and paraconsistent logic programming [9]. To model inconsistent and incomplete information we use a four-valued logic. The language discussed in this paper is based on ideas of our previous work [21, 32, 22] developing a four-valued framework for rough sets. In this approach membership function, set containment and set operations are four-valued, where logical values are t (true), f (false), i (inconsistent) and u (unknown). We investigate properties of paraconsistent rough sets as well as develop a paraconsistent rule language, providing basic computational machinery for our approach.