The main problem of this paper is a comparison between different kinds of many-valued and two valued linguistics constructions. We are trying to approximate probabilistic grammars by using ones which contain rational numbers only. Moreover, it is shown that probabilistic grammar can be simulated by regularly controlled grammar.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
This paper is devoted to investigation of the lattice properties of p-consequences. Our main goal is to compare the algebraic features of the lattices composed of all p-consequences and all consequence operations defined on the same propositional language.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.