Axiomatizace fuzzy atributové logiky

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F05%3A00002093" target="_blank" >RIV/61989592:15310/05:00002093 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Axiomatizations of fuzzy attribute logic

Popis výsledku v původním jazyce

We study fuzzy attribute logic, i.e. a logic for reasoning about formulas of the form $ARightarrow B$ where $A$ and $B$ are fuzzy sets (non-sharp collections) of attributes. A formula $ARightarrow B$ is true in a data table with fuzzy attributes iff each object having all attributes from $A$ has also all attributes from $B$, membership degrees of $A$ and $B$ playing a role of thresholds. We present a set of axioms and prove syntactico-semantical completeness with respect to the data table semantics. We also prove some derived rules in our axiomatic system. Furthermore, we introduce a notion of a degree to which a fuzzy set $T$ of formulas entails a formula $ARightarrow B$ and prove completeness in Pavelka style (graded completeness) which says thata degree to which $ARightarrow B$ semantically follows from $T$ equals a degree to which $ARightarrow B$ is provable from $T$.

Název v anglickém jazyce

Axiomatizations of fuzzy attribute logic

Popis výsledku anglicky

We study fuzzy attribute logic, i.e. a logic for reasoning about formulas of the form $ARightarrow B$ where $A$ and $B$ are fuzzy sets (non-sharp collections) of attributes. A formula $ARightarrow B$ is true in a data table with fuzzy attributes iff each object having all attributes from $A$ has also all attributes from $B$, membership degrees of $A$ and $B$ playing a role of thresholds. We present a set of axioms and prove syntactico-semantical completeness with respect to the data table semantics. We also prove some derived rules in our axiomatic system. Furthermore, we introduce a notion of a degree to which a fuzzy set $T$ of formulas entails a formula $ARightarrow B$ and prove completeness in Pavelka style (graded completeness) which says thata degree to which $ARightarrow B$ semantically follows from $T$ equals a degree to which $ARightarrow B$ is provable from $T$.

Druh

D - Stať ve sborníku

CEP obor

BD - Teorie informace

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2005

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of 2nd Indian International Conference on Artificial Intelligence

ISBN

0-9727412-1-6

ISSN

—

e-ISSN

—

Počet stran výsledku

2280

Strana od-do

2178-2193

Název nakladatele

Indian International Conference on Artificial Intelligence

Místo vydání

Pune, India

Místo konání akce

Pune, India

Datum konání akce

1. 1. 2005

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—