Certainty Closure: Reliable Constraint Reasoning with Incomplete or Erroneous Data

Constraint Programming (CP) has proved an effective paradigm to model and solve difficult combinatorial satisfaction and optimisation problems from disparate domains. Many such problems arising from the commercial world are permeated by data uncertainty. Existing CP approaches that accommodate uncertainty are less suited to uncertainty arising due to incomplete and erroneous data, because they do not build reliable models and solutions guaranteed to address the user's genuine problem as she perceives it. Other fields such as reliable computation offer combinations of models and associated methods to handle these types of uncertain data, but lack an expressive framework characterising the resolution methodology independently of the model. We present a unifying framework that extends the CP formalism in both model and solutions, to tackle ill-defined combinatorial problems with incomplete or erroneous data. The certainty closure framework brings together modelling and solving methodologies from different fields into the CP paradigm to provide reliable and efficient approches for uncertain constraint problems. We demonstrate the applicability of the framework on a case study in network diagnosis. We define resolution forms that give generic templates, and their associated operational semantics, to derive practical solution methods for reliable solutions.Comment: Revised versio

Soft Concurrent Constraint Programming

Soft constraints extend classical constraints to represent multiple consistency levels, and thus provide a way to express preferences, fuzziness, and uncertainty. While there are many soft constraint solving formalisms, even distributed ones, by now there seems to be no concurrent programming framework where soft constraints can be handled. In this paper we show how the classical concurrent constraint (cc) programming framework can work with soft constraints, and we also propose an extension of cc languages which can use soft constraints to prune and direct the search for a solution. We believe that this new programming paradigm, called soft cc (scc), can be also very useful in many web-related scenarios. In fact, the language level allows web agents to express their interaction and negotiation protocols, and also to post their requests in terms of preferences, and the underlying soft constraint solver can find an agreement among the agents even if their requests are incompatible.Comment: 25 pages, 4 figures, submitted to the ACM Transactions on Computational Logic (TOCL), zipped file

The transition in hydrogen sensing behavior in non-continuous palladium films

The morphological transition in ultrathin palladium (Pd) films around the percolation threshold and the related transition in hydrogen sensing behavior is investigated.We find that besides the transition from continuous to discontinuous Pd, an intermediate - semicontinuous-state must be considered. It shows hydrogen sensing features of both continuous and discontinuous film types, simultaneously. This study focuses on the discontinuous-semicontinuous transition. Experimental evidence is supported by studying the evolution of the electrical resistance with temperature, under hydrogen exposure and after thermal annealing. The results are highly relevant for the optimization of nanogap based hydrogen sensors

Fast and robust hydrogen sensors based on discontinuous palladium films on polyimide, fabricated on a wafer scale

Fast hydrogen sensors based on discontinuous palladium (Pd) films on supporting polyimide layers, fabricated by a cost-efficient and full-wafer compatible process, are presented. The films, deposited by electron-beam evaporation with a nominal thickness of 1.5 nm, consist of isolated Pd islands that are separated by nanoscopic gaps. On hydrogenation, the volume expansion of Pd brings initially separated islands into contact which leads to the creation of new electrical pathways through the film. The supporting polyimide layer provides both sufficient elasticity for the Pd nanoclusters to expand on hydrogenation and a sufficiently high surface energy for good adhesion of both film and contacting electrodes. The novel order of the fabrication processes involves a dicing step prior to the Pd deposition and stencil lithography for the patterning of microelectrodes. This allows us to preserve the as-deposited film properties. The devices work at room temperature, show response times of a few seconds and have a low power consumption of some tens of nW

Automated Analysis in Feature Modelling and Product Configuration

The automated analysis of feature models is one of the thriving topics of research in the software product line and variability management communities that has attracted more attention in the last years. A recent literature review reported that more than 30 analysis operations have been identi ed and di erent analysis mechanisms have been proposed. Product con guration is a well established research eld with more than 30 years of successful applications in di erent industrial domains. Our hypothesis, that is not really new, is that these two independent areas of research have interesting synergies that have not been fully explored. To try to explore the potential synergies systematically, in this paper we provide a rapid review to bring together these previously disparate streams of work. We de ne a set of research questions and give a preliminary answer to some of them. We conclude that there are many research opportunities in the synergy of these independent areas.Ministerio de Ciencia e Innovación TIN2009- 07366Junta de Andalucía TIC-590

Fuzzy positive primitive formulas

Can non-classical logic contribute to the analysis of complexity in computer science? In this paper, we give an step towards the solution of this open problem, taking a logical model-theoretic approach to the analysis of complexity in fuzzy constraint satisfaction. We study fuzzy positive-primitive sentences, and we present an algebraic characterization of classes axiomatized by these kind of sentences in terms of homomorphisms and finite direct products. The ultimate goal is to study the expressiveness and reasoning mechanisms of non-classical languages, with respect to constraint satisfaction problems and, in general, in modelling decision scenario

Grasp It Loudly! Supporting Actions with Semantically Congruent Spoken Action Words

Evidence for cross-talk between motor and language brain structures has accumulated over the past several years. However, while a significant amount of research has focused on the interaction between language perception and action, little attention has been paid to the potential impact of language production on overt motor behaviour

Criticality Analysis of Activity Networks under Interval Uncertainty

Dedicated to the memory of Professor Stefan Chanas - The extended abstract version of this paper has appeared in Proceedings of 11th International Conference on Principles and Practice of Constraint Programming (CP2005) ("Interval Analysis in Scheduling", Fortin et al. 2005)International audienceThis paper reconsiders the Project Evaluation and Review Technique (PERT) scheduling problem when information about task duration is incomplete. We model uncertainty on task durations by intervals. With this problem formulation, our goal is to assert possible and necessary criticality of the different tasks and to compute their possible earliest starting dates, latest starting dates, and floats. This paper combines various results and provides a complete solution to the problem. We present the complexity results of all considered subproblems and efficient algorithms to solve them