An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction

23 p. -- An extended abstract of this work appears in the proceedings of the 2012 ACM/IEEE Symposium on Logic in Computer Science

Museos, memoria y turismo

Cap. 1. Museos y patrimonio: de la distancia retórica a la interlocución democrática. Iñaki Díaz Balerdi. Cap. 2. Au coeur des conflits entre memoire, histoire et developpement economique, les nouveaux enjeux des musees de société aujourd’hui. François Hubert. Cap. 3. Elites, Instituciones Públicas, identidad cultural y turismo en los orígenes del Museo Municipal de Donostia-San Sebastián. Iñaki Arrieta Urtizberea. Cap. 4. Los orígenes de la museografía etnográfica en Cataluña: el Arxiu-Museu Folklòric de Ripoll. Oriol Beltran Costa. Cap. 5. Museo de la Pesca en Palamós: espacio para la memoria de los pescadores. Miquel Martí i Llambrich. Cap. 6. Arqueología y museos en Gipuzkoa; las experiencias del Centro de Estudios ARKEOLAN (1986-2005). Mª Mercedes Urteaga Artigas. Cap. 7. Penser un Musée des Confluences: un autre discours sur soi et les autres que soi. Thierry Valentin. Cap. 8. Turismo cultural y museos: oportunidades de desarrollo comunes. El caso de Cesis, Letonia. María Fernández Sabau. Cap. 9. La gestión y el uso turístico de los museos: la experiencia de Barcelona. Jordi Juan Tresserras y Juan Carlos Matamala. Cap. 10. Museos, turismo y desarrollo local en el norte de Portugal: el Ecomuseo del Barroso. Xerardo Pereiro. Cap. 11. Turismo y patrimonio cultural en las pequeñas y medianas ciudades: el Barri Vell de Girona y el Museu d’Art de Girona. Josep Manuel Rueda Torres.

About tree-depth

In this work I present recent scientific papers related to the concept of tree-depth: different characterizations, a game theoretic approach to it and recently discovered applications. The focus in this work is presenting all the ideas in a self-contained way, such that they can be easily understood with little previous knowledge. Apart from that all the ideas are presented in a homogeneous way with clear examples and all the lemmas, some of which didn’t have proofs in the papers, are presented with rigorous proofs.

Restricciones de igualdad sobre el dominio de los naturales

El objetivo de este proyecto consiste en implementar una aplicación que busca todos los modelos de una fórmula recibida como entrada. Esta fórmula de entrada pertenece a la lógica NatEq, la cual es un subconjunto de la lógica de primer orden. Esta lógica consta de un sólo predicado, que es la igualdad. Además, no contiene símbolos de funciones, incluye los cuantificadores universal y existencial, y se interpreta sobre el dominio de los números naturales N.

Treewidth: theory and applications to computer science

This report is an introduction to the concept of treewidth, a property of graphs that has important implications in algorithms. Some basic concepts of graph theory are presented in the first chapter for those readers that are not familiar with the notation. In Chapter 2, the definition of treewidth and some different ways of characterizing it are explained. The last two chapters focus on the algorithmic implications of treewidth, which are very relevant in Computer Science. An algorithm to compute the treewidth of a graph is presented and its result can be later applied to many other problems in graph theory, like those introduced in the last chapter.

Beyond Q-Resolution and Prenex Form: a Proof System for Quantified Constraint Satisfaction

We consider the quanti fied constraint satisfaction problem (QCSP) which is to decide, given a structure and a first-order sentence (not assumed here to be in prenex form) built from conjunction and quanti fication, whether or not the sentence is true on the structure. We present a proof system for certifying the falsity of QCSP instances and develop its basic theory; for instance, we provide an algorithmic interpretation of its behavior. Our proof system places the established Q-resolution proof system in a broader context, and also allows us to derive QCSP tractability results.