Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Fundamenta Informaticae

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: paraconsistent reasoning

Sortuj według:

Ogranicz wyniki do:

Multi-Party Persuasion : a Paraconsistent Approach

Dunin-Kęplicz B., Powała A.

Fundamenta Informaticae

2018

Vol. 158, nr 1/3

1--39

Some conflicts appearing in multi-agent settings may be resolved via communication. In this paper, besides conflicts of opinions, paradigmatically resolved by a persuasion dialogue, we study semantically deeper conflicts reaching to motivations of opinions. This investigation led us to discerning deep persuasion dialogues aiming at the resolution of conflicting motivations of opinions. In our overall research program we focus on realistic modeling of agency. This includes a proper representation of agents' ignorance and inconsistencies, appearing in their informational stance. Therefore, our formal framework TalkLOG, designed to provide and embed different forms of dialogues, employs a 4-valued logic with two additional logical values, unknown and inconsistent. Within TalkLOG soundness and completeness of persuasion was proved by comparing the outcomes of the persuasion dialogues performed by n-agents with the outcomes obtained by merging knowledge of these n agents. In this context the key point was a proper construction of this merge operator. Another critical issue is complexity of agents' communication, which is typically interleaved with reasoning in the context of multi-agent or autonomous systems. In TalkLOG tractability of both aspects is obtained thanks to the implementation tool: rule-based 4-valued query language 4QL.

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.