All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Resolution strategies for fuzzy predicate logic with evaluated syntax

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17610%2F07%3A00000030" target="_blank" >RIV/61988987:17610/07:00000030 - isvavai.cz</a>

  • Alternative codes found

    RIV/61988987:17310/07:00000044 RIV/61988987:17610/07:A1000J0W

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Resolution strategies for fuzzy predicate logic with evaluated syntax

  • Original language description

    The article presents refutational resolution theorem proving system for the Fuzzy Predicate Logic based on the general (non-clausal) resolution rule. The problem of automated reasoning concerning fuzzy logic requires more complex methods in contrast to classical logic. Additionally we present several inference strategies for efficient theorem proving in fuzzy logic based on Detection of Consequent Formulas algorithm. It is possible to combine it with the standard proof search techniques like breadth-first search or linear search.

  • Czech name

    Resolution strategies for fuzzy predicate logic with evaluated syntax

  • Czech description

    The article presents refutational resolution theorem proving system for the Fuzzy Predicate Logic based on the general (non-clausal) resolution rule. The problem of automated reasoning concerning fuzzy logic requires more complex methods in contrast to classical logic. Additionally we present several inference strategies for efficient theorem proving in fuzzy logic based on Detection of Consequent Formulas algorithm. It is possible to combine it with the standard proof search techniques like breadth-first search or linear search.

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JD - Use of computers, robotics and its application

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2007

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    Proceedings of Znalosti 2007

  • ISBN

    978-80-248-1279

  • ISSN

  • e-ISSN

  • Number of pages

    12

  • Pages from-to

    201-212

  • Publisher name

    VŠB-TUO

  • Place of publication

    Ostrava

  • Event location

    Ostrava

  • Event date

    Jan 1, 2007

  • Type of event by nationality

    EUR - Evropská akce

  • UT code for WoS article