— the undecidability of provability in propositional linear logic (LL), thanks to a reduction from the halting problem in Minsky machines proved by Lincoln, Mitchell, Scedrov, and Shankar [1992], who initiated much of this line of work, — the decidability of the !-Horn fragment of multiplicative exponential linear logic, proved by Kanovich [1995] by reduction to reachability in vector addition ...

Often, when dealing with real-world recognition problems, we do not need, and often cannot have, knowledge of the entire set possible classes that might appear during operational testing. In such cases, need to think robust classification methods able deal "unknown" properly reject samples belonging never seen training. Notwithstanding, existing classifiers date were mostly developed for closed...

the prediction of lithology is necessary in all areas of petroleum engineering. this means that todesign a project in any branch of petroleum engineering, the lithology must be well known. supportvector machines (svm’s) use an analytical approach to classification based on statistical learningtheory, the principles of structural risk minimization, and empirical risk minimization. in thisresearc...