An approach based on Logic Forms and WordNet relationships to Textual Entailment performance

This paper outlines the approach adopted by the PLSI research group at University of Alicante in the PASCAL-2006 second Recognising Textual Entailment challenge. Our system is composed of several components. On the one hand, the first component performs the derivation of the logic forms of the text/hypothesis pairs and, on the other hand, the second component provides us with a similarity score given by the semantic relations between the derived logic forms. In order to obtain this score we apply several measures of similitude and relatedness based on the structure and content of WordNet.

Applying logic forms and statistical methods to CL-SR performance

This paper describes a CL-SR system that employs two different techniques: the first one is based on NLP rules that consist on applying logic forms to the topic processing while the second one basically consists on applying the IR-n statistical search engine to the spoken document collection. The application of logic forms to the topics allows to increase the weight of topic terms according to a set of syntactic rules. Thus, the weights of the topic terms are used by IR-n system in the information retrieval process.

Spin separation in digital ferromagnetic heterostructures

In a study of the ferromagnetic phase of a multilayer digital ferromagnetic semiconductor in the mean-field and effective-mass approximations, we find the exchange interaction to have the dominant energy scale of the problem, effectively controlling the spatial distribution of the carrier spins in the digital ferromagnetic heterostructures. In the ferromagnetic phase, the majority-spin and minority-spin carriers tend to be in different regions of the space (spin separation). Hence, the charge distribution of carriers also changes noticeably from the ferromagnetic to the paramagnetic phase. An example of a design to exploit these phenomena is given here.

An application of fuzzy logic for hardware/software partitioning in embedded systems

Hardware/Software partitioning (HSP) is a key task for embedded system co-design. The main goal of this task is to decide which components of an application are to be executed in a general purpose processor (software) and which ones, on a specific hardware, taking into account a set of restrictions expressed by metrics. In last years, several approaches have been proposed for solving the HSP problem, directed by metaheuristic algorithms. However, due to diversity of models and metrics used, the choice of the best suited algorithm is an open problem yet. This article presents the results of applying a fuzzy approach to the HSP problem. This approach is more flexible than many others due to the fact that it is possible to accept quite good solutions or to reject other ones which do not seem good. In this work we compare six metaheuristic algorithms: Random Search, Tabu Search, Simulated Annealing, Hill Climbing, Genetic Algorithm and Evolutionary Strategy. The presented model is aimed to simultaneously minimize the hardware area and the execution time. The obtained results show that Restart Hill Climbing is the best performing algorithm in most cases.

Logic hybrid simulation-optimization algorithm for distillation design

In this paper, we propose a novel algorithm for the rigorous design of distillation columns that integrates a process simulator in a generalized disjunctive programming formulation. The optimal distillation column, or column sequence, is obtained by selecting, for each column section, among a set of column sections with different number of theoretical trays. The selection of thermodynamic models, properties estimation etc., are all in the simulation environment. All the numerical issues related to the convergence of distillation columns (or column sections) are also maintained in the simulation environment. The model is formulated as a Generalized Disjunctive Programming (GDP) problem and solved using the logic based outer approximation algorithm without MINLP reformulation. Some examples involving from a single column to thermally coupled sequence or extractive distillation shows the performance of the new algorithm.

High selectivity of TiC-CDC for CO2/N2 separation

A series of carbide-derived carbons (CDC) have been prepared starting from TiC and using different chlorine treatment temperatures (500–1200 °C). Contrary to N2 adsorption measurements at −196 °C, CO2 adsorption measurements at room temperature and high pressure (up to 1 MPa) together with immersion calorimetry measurements into dichloromethane suggest that the synthesized CDC exhibit a similar porous structure, in terms of narrow pore volume, independently of the temperature of the reactive extraction treatment used (samples synthesized below 1000 °C). Apparently, these carbide-derived carbons exhibit narrow constrictions were CO2 adsorption under standard conditions (0 °C and atmospheric pressure) is kinetically restricted. The same accounts for a slightly larger molecule as N2 at a lower adsorption temperature (−196 °C), i.e. textural parameters obtained from N2 adsorption measurements on CDC must be underestimated. Furthermore, here we show experimentally that nitrogen exhibits an unusual behavior, poor affinity, on these carbide-derived carbons. CH4 with a slightly larger diameter (0.39 nm) is able to partially access the inner porous structure whereas N2, with a slightly smaller diameter (0.36 nm), does not. Consequently, these CDC can be envisaged as excellent sorbent for selective CO2 capture in flue-gas streams.

Truth Values in t-norm based Systems Many-valued FUZZY Logic

In t-norm based systems many-valued logic, valuations of propositions form a non-countable set: interval [0,1]. In addition, we are given a set E of truth values p, subject to certain conditions, the valuation v is v=V(p), V reciprocal application of E on [0,1]. The general propositional algebra of t-norm based many-valued logic is then constructed from seven axioms. It contains classical logic (not many-valued) as a special case. It is first applied to the case where E=[0,1] and V is the identity. The result is a t-norm based many-valued logic in which contradiction can have a nonzero degree of truth but cannot be true; for this reason, this logic is called quasi-paraconsistent.

Paraconsistent Multivalued Logic and Coincidentia Oppositorum: Evaluation with Complex Numbers

Paraconsistent logic admits that the contradiction can be true. Let p be the truth values and P be a proposition. In paraconsistent logic the truth values of contradiction is . This equation has no real roots but admits complex roots . This is the result which leads to develop a multivalued logic to complex truth values. The sum of truth values being isomorphic to the vector of the plane, it is natural to relate the function V to the metric of the vector space R2. We will adopt as valuations the norms of vectors. The main objective of this paper is to establish a theory of truth-value evaluation for paraconsistent logics with the goal of using in analyzing ideological, mythical, religious and mystic belief systems.