09441 Abstracts Collection -- The Constraint Satisfaction Problem: Complexity and Approximability

From 25th to 30th October 2009, the Dagstuhl Seminar 09441 ``The Constraint Satisfaction Problem: Complexity and Approximability\u27\u27 was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

A SAT-based System for Consistent Query Answering

An inconsistent database is a database that violates one or more integrity constraints, such as functional dependencies. Consistent Query Answering is a rigorous and principled approach to the semantics of queries posed against inconsistent databases. The consistent answers to a query on an inconsistent database is the intersection of the answers to the query on every repair, i.e., on every consistent database that differs from the given inconsistent one in a minimal way. Computing the consistent answers of a fixed conjunctive query on a given inconsistent database can be a coNP-hard problem, even though every fixed conjunctive query is efficiently computable on a given consistent database. We designed, implemented, and evaluated CAvSAT, a SAT-based system for consistent query answering. CAvSAT leverages a set of natural reductions from the complement of consistent query answering to SAT and to Weighted MaxSAT. The system is capable of handling unions of conjunctive queries and arbitrary denial constraints, which include functional dependencies as a special case. We report results from experiments evaluating CAvSAT on both synthetic and real-world databases. These results provide evidence that a SAT-based approach can give rise to a comprehensive and scalable system for consistent query answering.Comment: 25 pages including appendix, to appear in the 22nd International Conference on Theory and Applications of Satisfiability Testin

Composition with Target Constraints

It is known that the composition of schema mappings, each specified by source-to-target tgds (st-tgds), can be specified by a second-order tgd (SO tgd). We consider the question of what happens when target constraints are allowed. Specifically, we consider the question of specifying the composition of standard schema mappings (those specified by st-tgds, target egds, and a weakly acyclic set of target tgds). We show that SO tgds, even with the assistance of arbitrary source constraints and target constraints, cannot specify in general the composition of two standard schema mappings. Therefore, we introduce source-to-target second-order dependencies (st-SO dependencies), which are similar to SO tgds, but allow equations in the conclusion. We show that st-SO dependencies (along with target egds and target tgds) are sufficient to express the composition of every finite sequence of standard schema mappings, and further, every st-SO dependency specifies such a composition. In addition to this expressive power, we show that st-SO dependencies enjoy other desirable properties. In particular, they have a polynomial-time chase that generates a universal solution. This universal solution can be used to find the certain answers to unions of conjunctive queries in polynomial time. It is easy to show that the composition of an arbitrary number of standard schema mappings is equivalent to the composition of only two standard schema mappings. We show that surprisingly, the analogous result holds also for schema mappings specified by just st-tgds (no target constraints). This is proven by showing that every SO tgd is equivalent to an unnested SO tgd (one where there is no nesting of function symbols). Similarly, we prove unnesting results for st-SO dependencies, with the same types of consequences.Comment: This paper is an extended version of: M. Arenas, R. Fagin, and A. Nash. Composition with Target Constraints. In 13th International Conference on Database Theory (ICDT), pages 129-142, 201

On The Power of Tree Projections: Structural Tractability of Enumerating CSP Solutions

The problem of deciding whether CSP instances admit solutions has been deeply studied in the literature, and several structural tractability results have been derived so far. However, constraint satisfaction comes in practice as a computation problem where the focus is either on finding one solution, or on enumerating all solutions, possibly projected to some given set of output variables. The paper investigates the structural tractability of the problem of enumerating (possibly projected) solutions, where tractability means here computable with polynomial delay (WPD), since in general exponentially many solutions may be computed. A general framework based on the notion of tree projection of hypergraphs is considered, which generalizes all known decomposition methods. Tractability results have been obtained both for classes of structures where output variables are part of their specification, and for classes of structures where computability WPD must be ensured for any possible set of output variables. These results are shown to be tight, by exhibiting dichotomies for classes of structures having bounded arity and where the tree decomposition method is considered

Mental Health Problems in Parents of Children with Congenital Heart Disease

This review will provide a concise description of mental health problems in parents of children with a (non-syndromic) congenital heart disease (CHD) during different stressful periods. Predictors of these problems and also implications for clinical practice will be mentioned. Having a child with CHD can be very stressful for parents, who have to face overwhelming emotions and also extra physical, financial, and other practical challenges. Parental distress has been reported in 30–80% of parents and appears not to be related to severity of CHD. Parental mental health, parenting, the parent–child relationship, and parental quality of life can all be affected. Parents, and especially mothers, are at risk of psychological distress, anxiety, depression, somatization, hopelessness, and posttraumatic stress symptoms, which in turn may influence mother’s responsiveness. In the long term, the majority of parents adapt successfully to living with a child with CHD, but approximately 40% report a need for psychosocial care. These families may be helped by early psychosocial interventions to alleviate stress and reduce children’s emotional and behavioral problems. A holistic approach to early psychosocial interventions should aim at improving coping and enhance parenting. During routine medical checkups, medical professionals should ask about parental stress, family functioning, and psychosocial functioning of the child and, when needed, adequate psychosocial care should be provided

Answering Non-Monotonic Queries in Relational Data Exchange

Relational data exchange is the problem of translating relational data from a source schema into a target schema, according to a specification of the relationship between the source data and the target data. One of the basic issues is how to answer queries that are posed against target data. While consensus has been reached on the definitive semantics for monotonic queries, this issue turned out to be considerably more difficult for non-monotonic queries. Several semantics for non-monotonic queries have been proposed in the past few years. This article proposes a new semantics for non-monotonic queries, called the GCWA*-semantics. It is inspired by semantics from the area of deductive databases. We show that the GCWA*-semantics coincides with the standard open world semantics on monotonic queries, and we further explore the (data) complexity of evaluating non-monotonic queries under the GCWA*-semantics. In particular, we introduce a class of schema mappings for which universal queries can be evaluated under the GCWA*-semantics in polynomial time (data complexity) on the core of the universal solutions.Comment: 55 pages, 3 figure

University of California Research Seminar Network: A Prospectus

By webcasting the hundreds of seminars presented in the University of California system each week, UC educators hope to enhance the exchange of scientific information for their campuses and create the foundation for an international research seminar network

Four Lessons in Versatility or How Query Languages Adapt to the Web

Exposing not only human-centered information, but machine-processable data on the Web is one of the commonalities of recent Web trends. It has enabled a new kind of applications and businesses where the data is used in ways not foreseen by the data providers. Yet this exposition has fractured the Web into islands of data, each in different Web formats: Some providers choose XML, others RDF, again others JSON or OWL, for their data, even in similar domains. This fracturing stifles innovation as application builders have to cope not only with one Web stack (e.g., XML technology) but with several ones, each of considerable complexity. With Xcerpt we have developed a rule- and pattern based query language that aims to give shield application builders from much of this complexity: In a single query language XML and RDF data can be accessed, processed, combined, and re-published. Though the need for combined access to XML and RDF data has been recognized in previous work (including the W3C’s GRDDL), our approach differs in four main aspects: (1) We provide a single language (rather than two separate or embedded languages), thus minimizing the conceptual overhead of dealing with disparate data formats. (2) Both the declarative (logic-based) and the operational semantics are unified in that they apply for querying XML and RDF in the same way. (3) We show that the resulting query language can be implemented reusing traditional database technology, if desirable. Nevertheless, we also give a unified evaluation approach based on interval labelings of graphs that is at least as fast as existing approaches for tree-shaped XML data, yet provides linear time and space querying also for many RDF graphs. We believe that Web query languages are the right tool for declarative data access in Web applications and that Xcerpt is a significant step towards a more convenient, yet highly efficient data access in a “Web of Data”

Emotional, behavioural problems and cigarette smoking in adolescence: findings of a Greek cross-sectional study

<p>Abstract</p> <p>Background</p> <p>Although several studies have reported findings concerning the association between smoking and emotional/behavioural problems, little research has investigated this association after controlling for confounding factors which have been found to be significantly correlated with both cigarette smoking and emotional/behavioural problems and may have a strong effect on the relationship between adolescents' mental health and smoking. The present study attempted to assess the association between adolescents' smoking status and their emotional/behavioural problems after controlling for a number of possible confounders (i.e. age, gender, parental smoking status, exposure to family smoking, family socioeconomic status, adolescents' leisure time) in a Greek nation-wide school-based sample.</p> <p>Methods</p> <p>Participants completed a questionnaire which retrieved information about age, gender, family socioeconomic status, smoking status, parental smoking, adolescents' leisure time and emotional/behavioural problems. Data were modelled using multiple logistic regression analysis with adolescents' smoking status as the dependent variable.</p> <p>Results</p> <p>A total of 1194 (i.e. 63% response rate) of self-reported questionnaires (40.1% boys, 59.9% girls; 12-18 years old) were returned. Data from 1030 participants with full data were analyzed. Cigarette smoking was strongly associated with higher levels of emotional/behavioural problems (p < 0.001) and the association was not moderated (OR = 1.13, 95% CI: 1.08-1.18) after controlling for the effects of other covariates. Emotional symptoms, conduct problems and hyperactivity/inattention were all significantly associated with adolescents' current smoking.</p> <p>Conclusions</p> <p>This study supports the association between smoking and emotional/behavioural problems among adolescents. Addressing adolescents' needs regarding their emotional/behavioural health could be helpful in the development of effective anti-smoking strategies in school environment and elsewhere.</p