Functional dependencies have been used in query optimisation for decades. Moreover, if two domains have a natural ordering of their elements, a functional dependency of them can potentially preserve these orderings, i.e. be a monotonic function. This monotonicity can be exploited by query optimizers. Recently, such monotonic functional dependencies have been termed order dependencies. In this p...

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...

The possibility is pursued that a single mental program underlies both sentence comprehension and generation. The Horn-logic formalism is exploited here to modelize the mental representation of the linguistic knowledge, as a bundle of constraints rather than as a patchwork of procedures. A notion of dependency in a Horn program is defined so that eliminating dependency amounts to solving the pr...

Pure Horn clauses have also been called (among others) functional dependencies, strong association rules, or simply implications. We survey the mathematical theory of implications with an emphasis on the progress made in the last 30 years.

The study of integrity constraints has been identified as one of the major challenges in XML database research. The main difficulty is finding a balance between the expressiveness and the existence of automated reasoning tools. We investigate a previous proposal for functional dependencies in XML (XFDs) that is based on homomorphisms between data trees and schema trees. We demonstrate that reas...

Most linguistic theories since Chomsky (1973) have hypothesized that longdistance dependencies crossing multiple clauses are mediated by intermediate structures. This paper provides a new source of evidence for the existence of such intermediate structures: reading times during online sentence comprehension. The experiment presented here compares reading times for two structures involving the l...

The paper focuses on the notion of (surface) syntactic subject in Serbian within the syntactic dependency framework of the MeaningText linguistic theory. Properties of the subject are described and its text implementations illustrated with data from a variety of contemporary texts. 1 The Problem Stated The aim of this paper is to describe and illustrate, from a syntactic dependency viewpoint, t...

Recent solvers for quantified boolean formulas (QBF) use a clause learning method based on a procedure proposed by Giunchiglia et al. (JAIR 2006), which avoids creating tautological clauses. Recently, an exponential worst case for this procedure has been shown by Van Gelder (CP 2012). That paper introduced QBF Pseudo Unit Propagation (QPUP) for non-tautological clause learning in a limited sett...

The Poverty of the Stimulus (PoS) argument holds that children do not receive enough evidence to infer the existence of core aspects of language, such as the dependence of linguistic rules on hierarchical phrase structure. We reevaluate one version of this argument with a Bayesian model of grammar induction, and show that a rational learner without any initial language-specific biases could lea...

The Libra Toolkit is a collection of algorithms for learning and inference with discrete probabilistic models, including Bayesian networks, Markov networks, dependency networks, and sum-product networks. Compared to other toolkits, Libra places a greater emphasis on learning the structure of tractable models in which exact inference is efficient. It also includes a variety of algorithms for lea...