In Rough Set Theory, dependency in the knowledge base is an important aspect when drawing inferences about the world. Rough set (inexact set) is defined by using a fixed binary relation (equivalence relation, tolerance relation, similarity relation, etc) to analyze vague, imprecise, inexact problems, which satisfy many interesting properties. The neighborhood based rough set theory is an extens...

Dependency grammar is usually interpreted as equivalent to a strict form of X–bar theory that forbids the stacking of nodes of the same bar level (e.g., N immediately dominating N with the same head). But adequate accounts of one–anaphora and of the semantics of multiple modifiers require such stacking and accordingly argue against dependency grammar. Dependency grammar can be salvaged by reint...

Incomplete information systems are expanded with the significance of objects in order to combine factors such as decision maker’s preferences and prior domain knowledge, etc. In the expanded incomplete information systems, information granules have their own significance, some basic concepts in rough set theory such as accuracy measure, rough entropies of knowledge and a set are both establishe...

This paper studies functional dependencies in Horn theories, both when the theory is represented by its clausal form and when it is de ned as the Horn envelope of a set of models. We provide polynomial algorithms for the recognition of whether a given functional dependency holds in a given Horn theory, as well as polynomial algorithms for the generation of some representative sets of functional...

This paper studies functional dependencies in Horn theories, both when the theory is represented by its clausal form and when it is deened as the Horn envelope of a set of models. We provide polynomial algorithms for the recognition of whether a given functional dependency holds in a given Horn theory, as well as polynomial algorithms for the generation of some representative sets of functional...

Tesnière (1959) is often regarded as the founder of the modern theoretical tradition of dependency grammar, but it is not one well-defined theory. Instead, it comprises several related theories, having some core notions in common. Such a notion is the directed relations between pairs of lexical elements, but the formalism and the criteria for this can vary. The primary goal of this study is to ...

In this paper, we present a database-supported corpus study where we combine automatically obtained linguistic information from a statistical dependency parser, namely the occurrence of a dative argument, with predictions from a theory on the argument structure of German particle verbs with nach. The theory predicts five readings of nach which behave differently with respect to dative licensing...

1 Introduction We are concerned with surface-syntactic parsing of running text. Our main goal is to describe a syntactic analysis of sentences using dependency links that show the head-dependent relations between words. The new dependency parser 1 (Tapanainen and J~ir-vinen, 1997; J~rvinen and Tapanainen, 1997) belongs to a continuous effort to apply rule-based methods to natural languages. It ...