Wyniki wyszukiwania - Biblioteka Nauki

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

2 Buszkowski W.

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Rough Sets and Learning by Unification

100%

Buszkowski W.

tom Vol. 75, nr 1-4

107-121

We apply basic notions of the theory of rough sets, due to Pawlak], to explicate certain properties of unification-based learning algorithms for categorial grammars, introduced in and further developed in e.g]. The outcomes of these algorithms can be used to compute both the lower and the upper approximation of the searched language with respect to the given, finite sample. We show that these methods are also appropriate for other kinds of formal grammars, e.g. context-free grammars and context-sensitive grammars.

On the complexity of some substructural logics

100%

Buszkowski W.

tom No. 43

5-24

We use a syntactic interpretation of MALL in BCI with logical and , defined in [5], to prove the undecidability of the consequence relations for BCI with logical and and BCI with logical or , and the NP-completeness of BCI. Similar results are obtained for a variant of the Lambek calculus.