VP-Fronting in Sardinian: a structural paradox

This paper investigates the phenomena of Inversion and VP-fronting in Sardinian in examples like Dormende sunt sos pitzinnos ?sleeping are the children?. It is argued that the postverbal subject in these constructions cannot occupy the same position as the subject in general cases of Inversion, but raises to a higher position within the clause. This raising operation yields sharply ungrammatical sentences if VP fronting does not apply. However, these can be excluded by postulating general conditions (distinct from the Agree operation) on the structural relations which must hold at spell-out between overt heads and the elements which they license. It is argued that these conditions, along with further provisions which are necessary to accommodate the position of heavy subjects in Inversion constructions, may play a role in facilitating processing

Nonrestrictive Relatives and Growth of Logical Form

Articl

On Left and Right Dislocation: A Dynamic Perspective

The paper argues that by modelling the incremental and left-right process of interpretation as a process of growth of logical form (representing logical forms as trees), an integrated typology of left-dislocation and right-dislocation phenomena becomes available, bringing out not merely the similarities between these types of phenomena, but also their asymmetry. The data covered include hanging topic left dislocation, clitic left dislocation, left dislocation, pronoun doubling, expletives, extraposition, and right node raising, with each set of data analysed in terms of general principles of tree growth. In the light of the success in providing a characterisation of the asymmetry between left and right periphery phenomena, a result not achieved in more wellknown formalisms, the paper concludes that grammar formalisms should model the dynamics of language processing in time.Articl

Distribution Constraints: The Chase for Distributed Data

This paper introduces a declarative framework to specify and reason about distributions of data over computing nodes in a distributed setting. More specifically, it proposes distribution constraints which are tuple and equality generating dependencies (tgds and egds) extended with node variables ranging over computing nodes. In particular, they can express co-partitioning constraints and constraints about range-based data distributions by using comparison atoms. The main technical contribution is the study of the implication problem of distribution constraints. While implication is undecidable in general, relevant fragments of so-called data-full constraints are exhibited for which the corresponding implication problems are complete for EXPTIME, PSPACE and NP. These results yield bounds on deciding parallel-correctness for conjunctive queries in the presence of distribution constraints

#socialiseresponsibly. Analyzing the Rhetorical Structure of Heineken TV Commercials During the Pandemic

This work analyzes the efforts by the company Heineken to address in their marketing campaigns the social responsibility and wellbeing of their customers during the pandemic. By particularly looking at the audio-visual design strategies used in 15 TV commercials produced and published during the years 2020–2022, a multimodal analysis of the filmic montage structures examines how the company establishes a coherent process of core marketing and convinces recipients to socialize responsibly under pandemic conditions. The analysis follows the current trend in empirical multimodality research to pursue analyses of digital corpora with the theories and methods developed in the field. Particularly, it uses an ELAN annotation scheme for the description of specific camera techniques (such as camera distance and perspective) as well as the discourse relations holding between the shots and segments identified in the commercials. The findings show that the company mainly uses one specific type of rhetorical structure, the narrative commentary, that puts the social actors shown in many different scenes into the foreground and therefore strongly focuses on the company's strategy of positive social behavior

Queries with Guarded Negation (full version)

A well-established and fundamental insight in database theory is that negation (also known as complementation) tends to make queries difficult to process and difficult to reason about. Many basic problems are decidable and admit practical algorithms in the case of unions of conjunctive queries, but become difficult or even undecidable when queries are allowed to contain negation. Inspired by recent results in finite model theory, we consider a restricted form of negation, guarded negation. We introduce a fragment of SQL, called GN-SQL, as well as a fragment of Datalog with stratified negation, called GN-Datalog, that allow only guarded negation, and we show that these query languages are computationally well behaved, in terms of testing query containment, query evaluation, open-world query answering, and boundedness. GN-SQL and GN-Datalog subsume a number of well known query languages and constraint languages, such as unions of conjunctive queries, monadic Datalog, and frontier-guarded tgds. In addition, an analysis of standard benchmark workloads shows that most usage of negation in SQL in practice is guarded negation

Inconsistency and Incompleteness in Relational Databases and Logic Programs

The aim of this thesis is to study the role played by negation in databases and to develop data models that can handle inconsistent and incomplete information. We develop models that also allow incompleteness through disjunctive information under both the CWA and the OWA in relational databases. In the area of logic programming, extended logic programs allow explicit representation of negative information. As a result, a number of extended logic programs have an inconsistent semantics. We present a translation of extended logic programs to normal logic programs that is more tolerant to inconsistencies. Extended logic programs have also been used widely in order to compute the repairs of an inconsistent database. We present some preliminary ideas on how source information can be incorporated into the repair program in order to produce a subset of the set of all repairs based on a preference for certain sources over others

X-within-X Structures and the Nature of Categories

This paper discusses the existence of X-within-X structures in language. Constraints to same-category embedding have been the focus in a number of recent studies. These studies follow a long-standing tradition in linguistic theory that assumes a ban on the adjacency of same-category elements. In the present work, data drawn from a typologically broad variety of languages suggest that the postulated constraints are not so robust. It is shown that X-within-X structures do exist in language. In this context, an argument is made in favor of an unrestricted conceptualization of Merge, independent from category distributions, while recursion is taken to be a property of procedures and not of structures. The discussion of X-within-X patterns provides insights with respect to the attested category distributions, the nature of categories, and the language faculty, from a biologically plausible point of view