Non-clausal Resolution Theorem Proving for Fuzzy Description Logic

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17610%2F06%3A00000009" target="_blank" >RIV/61988987:17610/06:00000009 - isvavai.cz</a>
Alternative codes found
RIV/61988987:17310/06:00000012 RIV/61988987:17610/06:A1000DDO
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Non-clausal Resolution Theorem Proving for Fuzzy Description Logic
Original language description
The article presents refutational resolution theorem proving system for the Fuzzy Description Logic based on the general (non-clausal) resolution rule. There is also presented a unification algorithm handling existentiality without the need of skolemization. This formalism integrates previously created provers for classical description logic and for fuzzy predicate logic. The problem of automated reasoning concerning fuzzy logic requires more complex methods in contrast to classical logic. Presented formalism overcomes the key unsolvable obstacle - clausal normal form generation (in fuzzy logic) - by introduction of generally applicable inference rule (working with general formulas not only clauses).
Czech name
Neklauzulární rezoluční dokazování ve fuzzy deskripční logice
Czech description
Rezoluční princip aplikovaný pro fuzzy deskripční logiku

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

Article name in the collection
SOFSEM 2006 : Theory and practice of computer science ? 32nd conference on current trends in theory and practice of computer science
ISBN
80-903298-4-5
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
1-12
Publisher name
Institute of Computer Science, Czech Academy of Sciences
Place of publication
Praha
Event location
Měřín
Event date
Jan 1, 2006
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)