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”

Filters

106 316 (0,135s)

Result

Optimal strategic reasoning with McNaughton functions

The aim of the paper is to explore strategic reasoning in strategic games of two players with an uncountably infinite space of strategies the payoff of which is given by McNaughton functions?functions on the unit interval w...

BA - Obecná matematika

  • 2014
  • Jx
  • Link
Result

Set representations of sigma-complete MV-algebras

We characterize Lukasiewicz tribes, i.e., collections of fuzzy sets that are closed under the standard fuzzy complementation and the Lukasiewicz t-norm with countably many arguments. We introduce sigma-McNaughton functions as the cl...

BA - Obecná matematika

  • 2004
  • O
Result

The Sigma-complete MV-algebras which Have Enough States

We characterize Lukasiewicz tribes, i.e., collections of fuzzy sets that are closed under the standard fuzzy complementation and the Lukasiewicz t-norm with countably many arguments. As a tool, we introduce Sigma-McNaughton functions

JD - Využití počítačů, robotika a její aplikace

  • 2005
  • Jx
Result

Semi-Normal Forms and Functional Representation of Product Fuzzy Logic

By McNaughton theorem, the class of functions representable by formulas of Lukasiewicz logic is the class of piecewise linear functions with integer coefficients. The first goal of this work to find an analogy of the Mc...

BA - Obecná matematika

  • 2004
  • Jx
Result

Some Consequences of Herbrand and McNaughton Theorems in Fuzzy Logic

A constructive proof of McNaughton theorem and the generalization of Herbrand one in fuzzy logic...

BA - Obecná matematika

  • 2000
  • C
Result

Limited context restarting automata and McNaughton families of languages

rewritings. This approach is reminiscent of the notion of McNaughton families of McNaughton families of languages, relating the classes of languages accepted......

IN - Informatika

  • 2012
  • D
  • Link
Result

McNaughton Theorem of Fuzzy Logic from a Data-Mining Point of View

The paper recalls the McNaughton theorem of fuzzy logic and the algorithms underlying its constructive proofs. It then shows how those algorithms can be combined with the algorithm underlying recent extension of the theorem to piecewise-line...

IN - Informatika

  • 2007
  • Jx
Result

Limited context restarting automata and McNaughton families of languages

rewritings. This approach is reminiscent of the notion of McNaughton families...

IN - Informatika

  • 2012
  • D
Result

On the Clases of Languages Accepted by Limited Context Restarting Automata

rewritings. This approach is reminiscent of the notion of McNaughton families of McNaughton families of languages, relating the classes of languages accepted......

IN - Informatika

  • 2014
  • Jx
  • Link
Result

Remark to the Consistency of Fuzzy Theories

In this paper, some consequences of the McNaughton theorem for fuzzy logic are presented, which states that there is a one-to-one correspondence among all pie a c......

BA - Obecná matematika

  • 1999
  • D
  • 1 - 10 out of 106 316