Graphical AbstractView Large Image Figure ViewerDownload Hi-res image Download (PPT)

Selectional restrictions are semantic sortal constraints imposed on the participants of linguistic constructions to capture contextuallydependent constraints on interpretation. Despite their limitations, selectional restrictions have proven very useful in natural language applications, where they have been used frequently in word sense disambiguation, syntactic disambiguation, and anaphora reso...

We extend ALC with preferential role restrictions as concept constructors, and argue that preferential universal restriction represents a defeasible version of standard universal restriction. The resulting DL is more expressive without adding to the complexity of TBox reasoning. We present a tableau system to compute TBox entailment, show that this notion of entailment is not sufficient when ad...

In graph cleaning problems, brushes clean a graph by traversing it subject to certain rules. Various problems arise, such as determining the minimum number of brushes that are required to clean the entire graph. This number is called the brushing number. Here, we study a new variant of the brushing problem in which one vertex is cleaned at a time, but more than one brush may traverse a dirty ed...

Sorting is one of the most used and well investigated algorithmic problem [1]. Traditional postulation supposes the sorting data archived, and the elementary operation as comparisons of two numbers. In a view of appearance of new processors and applied problems with data streams, sorting changed its face. This changes and generalizations are the subject of investigation in the research below.

When we apply stacked regression to classification we need only discriminant indices which can be negative. In many situations, we want these indices to be positive, e.g., if we want to use them to count posterior probabilities, when we want to use stacked regression to combining classification. In such situation, we have to use least squares regression under the constraint βk ≥ 0, k = 1, 2, . ...

ur K ¨ unstliche Intelligenz, DFKI) with sites in Kaiserslautern and Saarbrücken is a non-profit organization which was founded in 1988. The DFKI conducts application-oriented basic research in the field of artificial intelligence and other related subfields of computer science. The overall goal is to construct systems with technical knowledge and common sense which-by using AI methods-implemen...

This paper argues for non-primary cand s-selectional restrictions of verbs in computing nonprimary predicatives such as resultatives, depictives, and manners. Our discussion is based both on the selection violations in the presence of nonprimary predicates and on the cross-linguistic and language-internal variations of categorial and semantic constraints on nonprimary predicates. We claim that ...