In this paper we study the operation of incremental data extraction from declarative knowledge bases and the problem of decomposability of data in such KBs, by viewing them as first-order logical theories. The operation of incremental data extraction is closely connected with query reformulation in information retrieval and data integration, while the decomposability problem is important in the...

The role of morphological, semantic, and form-based factors in the early stages of visual word recognition was investigated across different SOAs in a masked priming paradigm, focusing on English derivational morphology. In a first set of experiments, stimulus pairs co-varying in morphological decomposability and in semantic and orthographic relatedness were presented at three SOAs (36, 48, and...

In many countries, recruiting and promotion procedures in the public sector would appear to leave less room for gender discrimination than in the private sector. Using data for Spain in 1977 and 1992, this paper explores the consequences of these practices for gender segregation in those occupations where there is a private and a public sector of a minimum size. In particular, an additive index...

Let p be an odd prime. In this paper we study the relationship between degeneracy and decomposability in abelian crossed products. In particular we construct an indecomposable abelian crossed product division algebra of exponent p and index p. The algebra we construct is generic in the sense of [AS78] and has the property that its underlying abelian crossed product is a decomposable division al...

We introduce in this paper two new, complete propositional languages and study their properties in terms of (1) their support for polytime operations and (2) their ability to represent boolean functions compactly. The new languages are based on a structured version of decomposability—a property that underlies a number of tractable languages. The key characteristic of structured decomposability ...

We address two sets of long-standing open questions in linear algebra and probability theory, from a computational complexity perspective: stochastic matrix divisibility, and divisibility and decomposability of probability distributions. We prove that finite divisibility of stochastic matrices is an NP-complete problem, and extend this result to nonnegative matrices, and completely-positive tra...