Constraint solving over multi-valued logics - application to digital circuits

Due to usage conditions, hazardous environments or intentional causes, physical and virtual systems are subject to faults in their components, which may affect their overall behaviour. In a ‘black-box’ agent modelled by a set of propositional logic rules, in which just a subset of components is externally visible, such faults may only be recognised by examining some output function of the agent. A (fault-free) model of the agent’s system provides the expected output given some input. If the real output differs from that predicted output, then the system is faulty. However, some faults may only become apparent in the system output when appropriate inputs are given. A number of problems regarding both testing and diagnosis thus arise, such as testing a fault, testing the whole system, finding possible faults and differentiating them to locate the correct one. The corresponding optimisation problems of finding solutions that require minimum resources are also very relevant in industry, as is minimal diagnosis. In this dissertation we use a well established set of benchmark circuits to address such diagnostic related problems and propose and develop models with different logics that we formalise and generalise as much as possible. We also prove that all techniques generalise to agents and to multiple faults. The developed multi-valued logics extend the usual Boolean logic (suitable for faultfree models) by encoding values with some dependency (usually on faults). Such logics thus allow modelling an arbitrary number of diagnostic theories. Each problem is subsequently solved with CLP solvers that we implement and discuss, together with a new efficient search technique that we present. We compare our results with other approaches such as SAT (that require substantial duplication of circuits), showing the effectiveness of constraints over multi-valued logics, and also the adequacy of a general set constraint solver (with special inferences over set functions such as cardinality) on other problems. In addition, for an optimisation problem, we integrate local search with a constructive approach (branch-and-bound) using a variety of logics to improve an existing efficient tool based on SAT and ILP.

Constraint reasoning for differential models

The basic motivation of this work was the integration of biophysical models within the interval constraints framework for decision support. Comparing the major features of biophysical models with the expressive power of the existing interval constraints framework, it was clear that the most important inadequacy was related with the representation of differential equations. System dynamics is often modelled through differential equations but there was no way of expressing a differential equation as a constraint and integrate it within the constraints framework. Consequently, the goal of this work is focussed on the integration of ordinary differential equations within the interval constraints framework, which for this purpose is extended with the new formalism of Constraint Satisfaction Differential Problems. Such framework allows the specification of ordinary differential equations, together with related information, by means of constraints, and provides efficient propagation techniques for pruning the domains of their variables. This enabled the integration of all such information in a single constraint whose variables may subsequently be used in other constraints of the model. The specific method used for pruning its variable domains can then be combined with the pruning methods associated with the other constraints in an overall propagation algorithm for reducing the bounds of all model variables. The application of the constraint propagation algorithm for pruning the variable domains, that is, the enforcement of local-consistency, turned out to be insufficient to support decision in practical problems that include differential equations. The domain pruning achieved is not, in general, sufficient to allow safe decisions and the main reason derives from the non-linearity of the differential equations. Consequently, a complementary goal of this work proposes a new strong consistency criterion, Global Hull-consistency, particularly suited to decision support with differential models, by presenting an adequate trade-of between domain pruning and computational effort. Several alternative algorithms are proposed for enforcing Global Hull-consistency and, due to their complexity, an effort was made to provide implementations able to supply any-time pruning results. Since the consistency criterion is dependent on the existence of canonical solutions, it is proposed a local search approach that can be integrated with constraint propagation in continuous domains and, in particular, with the enforcing algorithms for anticipating the finding of canonical solutions. The last goal of this work is the validation of the approach as an important contribution for the integration of biophysical models within decision support. Consequently, a prototype application that integrated all the proposed extensions to the interval constraints framework is developed and used for solving problems in different biophysical domains.

Into a new phase of the research on restructuring of work in the knowledge society: the Third WORKS General Assembly in Sofia (Bulgaria)

The WORKS Project started two years ago (2005), involving the efforts of research institutes of 13 European countries with the main purpose of improving the understanding of the major changes in work in the knowledge-based society, taking account both of global forces and the regional diversity within Europe. This research meeting in Sofia (Bulgaria) aimed to present synthetically the massive amount of data collected in the case studies (occupational and organisational) and with the quantitative research during last year.

Characterization of the volatile fraction emitted by phloems of four pinus species by solid-phase microextraction and gas chromatography–mass spectrometry

Pine forests constitute some of the most important renewable resources supplying timber, paper and chemical industries, among other functions. Characterization of the volatiles emitted by different Pinus species has proven to be an important tool to decode the process of host tree selection by herbivore insects, some of which cause serious economic damage to pines. Variations in the relative composition of the bouquet of semiochemicals are responsible for the outcome of different biological processes, such as mate finding, egg-laying site recognition and host selection. The volatiles present in phloem samples of four pine species, P. halepensis, P. sylvestris, P. pinaster and P. pinea, were identified and characterized with the aim of finding possible host-plant attractants for native pests, such as the bark beetle Tomicus piniperda. The volatile compounds emitted by phloem samples of pines were extracted by headspace solid-phase micro extraction, using a 2 cm 50/30 mm divinylbenzene/carboxen/polydimethylsiloxane table flex solid-phase microextraction fiber and its contents analyzed by high-resolution gas chromatography, using flame ionization and a non polar and chiral column phases. The components of the volatile fraction emitted by the phloem samples were identified by mass spectrometry using time-of-flight and quadrupole mass analyzers. The estimated relative composition was used to perform a discriminant analysis among pine species, by means of cluster and principal component analysis. It can be concluded that it is possible to discriminate pine species based on the monoterpenes emissions of phloem samples.

Dual-phase inkjet printed electrochromic layers based on PTA and WOX/TiO2 nanoparticles for electrochromic applications

Thesis submitted in Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa for the degree of Master in Materials Engineering

Phase behaviour of alternative solvents

Dissertation presented to obtain the Ph.D. degree in Chemistry (Physical Chemistry) at the Instituto de Tecnologia Química e Biológica da Universidade Nova de Lisboa

Modern techniques for constraint solving the CASPER experience

Dissertação apresentada para obtenção do Grau de Doutor em Engenharia Informática, pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

Constraint-based modeling of minimum set covering: application to species differentation

Work presented in the context of the European Master in Computational Logics, as partial requisit for the graduation as Master in Computational Logics

Constraint-based verification of imperative programs

work presented in the context of the European Master’s program in Computational Logic, as the partial requirement for obtaining Master of Science degree in Computational Logic

Linear amplification with multiple nonlinear devices

Dissertação para obtenção do Grau de Mestre em Engenharia Electrotécnica e Computadores

Probabilistic constraint reasoning

Dissertação apresentada para obtenção do Grau de Doutor em Engenharia Informática, pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

Coherence and phase locking disruption in electromyograms of patients with amyotrophic lateral sclerosis

Dissertação para obtenção do Grau de Mestre em Engenharia Biomédica

Constraint-based modelling of mixed microbial populations: Application to polyhydroxyalkanoates production

Dissertação para obtenção do Grau de Doutor em Engenharia Química e Bioquímica

Constraint reasoning with local search for continuous optimization

Optimization is a very important field for getting the best possible value for the optimization function. Continuous optimization is optimization over real intervals. There are many global and local search techniques. Global search techniques try to get the global optima of the optimization problem. However, local search techniques are used more since they try to find a local minimal solution within an area of the search space. In Continuous Constraint Satisfaction Problems (CCSP)s, constraints are viewed as relations between variables, and the computations are supported by interval analysis. The continuous constraint programming framework provides branch-and-prune algorithms for covering sets of solutions for the constraints with sets of interval boxes which are the Cartesian product of intervals. These algorithms begin with an initial crude cover of the feasible space (the Cartesian product of the initial variable domains) which is recursively refined by interleaving pruning and branching steps until a stopping criterion is satisfied. In this work, we try to find a convenient way to use the advantages in CCSP branchand- prune with local search of global optimization applied locally over each pruned branch of the CCSP. We apply local search techniques of continuous optimization over the pruned boxes outputted by the CCSP techniques. We mainly use steepest descent technique with different characteristics such as penalty calculation and step length. We implement two main different local search algorithms. We use “Procure”, which is a constraint reasoning and global optimization framework, to implement our techniques, then we produce and introduce our results over a set of benchmarks.

O impacto da fase pré-analítica nos resultados : de que modo a fase pré-analítica pode interferir nos resultados de um trabalho de investigação

RESUMO: O impacto da fase pré-analítica nos resultados é o objectivo do nosso trabalho. Considera-se que esta fase é a mais importante no procedimento do teste no laboratório e que as variáveis independentes do laboratório são difíceis de controlar porque existem várias condicionantes quer dos profissionais, quer do doente, que por vezes não possibilita atribuir a importância desejada para que os resultados sejam fiáveis. De que modo a fase pré-analítica pode interferir nos resultados de um trabalho de investigação. Para podermos avaliar este processo é necessário considerar outra condicionante, nomeadamente, o facto de o teste ser realizado em laboratórios específicos com a qualidade certificada mas que não intervêm na colheita, manuseamento, armazenamento e transporte da amostra, procedimentos importantes que traduzem uma boa gestão da amostra na fase pré-analítica, necessária para a fiabilidade dos resultados dos estudos de investigação clínica.------------------ABSTRACT: The impact of pre-analytical phase in the results is the objective of our work Knowing that, this is the most important stage in the procedure of testing in the laboratory and because the independent variables the laboratory are difficult to control because these are several limitations of both the professional and the patient, sometimes does not assign importance to that desired result are reliable. How the pre-analytical phase can interfere with the result of a research work, there is another constraint to consider the testing process to be performed in individual laboratory with certified quality, but not involved in harvesting, handing, storage and transport of the sample, important procedures that translate a good sample management in the preanalytical phase, necessary for the reliability of results of clinical research studies.