Evaluating Datalog via Tree Automata and Cycluits

We investigate parameterizations of both database instances and queries that make query evaluation fixed-parameter tractable in combined complexity. We show that clique-frontier-guarded Datalog with stratified negation (CFG-Datalog) enjoys bilinear-time evaluation on structures of bounded treewidth for programs of bounded rule size. Such programs capture in particular conjunctive queries with simplicial decompositions of bounded width, guarded negation fragment queries of bounded CQ-rank, or two-way regular path queries. Our result is shown by translating to alternating two-way automata, whose semantics is defined via cyclic provenance circuits (cycluits) that can be tractably evaluated.Comment: 56 pages, 63 references. Journal version of "Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version)" at arXiv:1612.04203. Up to the stylesheet, page/environment numbering, and possible minor publisher-induced changes, this is the exact content of the journal paper that will appear in Theory of Computing Systems. Update wrt version 1: latest reviewer feedbac

Developing a creative cluster in a post-industrial city: CIDS and Manchester

This paper takes the establishment and demise of Manchester’s Creative Industries Development Service as an exemplary case study for the ways in which creative industry policy has intersected with urban economic policy over the last decade. It argues that the creative industries required specific kinds of economic development agencies which would be able to act as ‘intermediary’ between the distinct languages of policy makers and ‘creatives’. The paper discusses the tensions inherent in such an approach and how CIDS attempted to manage them. It suggests that which particular circumstances might have intervened the main reason for the demise of the CIDS was the domination of the ‘economic’ over the ‘cultural logic’ both of which are embedded within the creative industries policy discourse