Termination of Narrowing with Dependency Pairs

In this work, we generalize the Dependency Pairs approach for automated proofs of termination to prove the termination of narrowing.We identify the phenomenon of echoing in infinite narrowing derivations and demonstrate that the new narrowing dependency pairs faithfully capture the shape of such derivations and provide a termination criterion.Iborra López, J. (2008). Termination of Narrowing with Dependency Pairs. http://hdl.handle.net/10251/13622Archivo delegad

Termination of Narrowing: Automated Proofs and Modularity Properties

En 1936 Alan Turing demostro que el halting problem, esto es, el problema de decidir si un programa termina o no, es un problema indecidible para la inmensa mayoria de los lenguajes de programacion. A pesar de ello, la terminacion es un problema tan relevante que en las ultimas decadas un gran numero de tecnicas han sido desarrolladas para demostrar la terminacion de forma automatica de la maxima cantidad posible de programas. Los sistemas de reescritura de terminos proporcionan un marco teorico abstracto perfecto para el estudio de la terminacion de programas. En este marco, la evaluaci on de un t ermino consiste en la aplicacion no determinista de un conjunto de reglas de reescritura. El estrechamiento (narrowing) de terminos es una generalizacion de la reescritura que proporciona un mecanismo de razonamiento automatico. Por ejemplo, dado un conjunto de reglas que denan la suma y la multiplicacion, la reescritura permite calcular expresiones aritmeticas, mientras que el estrechamiento permite resolver ecuaciones con variables. Esta tesis constituye el primer estudio en profundidad de las propiedades de terminacion del estrechamiento. Las contribuciones son las siguientes. En primer lugar, se identican clases de sistemas en las que el estrechamiento tiene un comportamiento bueno, en el sentido de que siempre termina. Muchos metodos de razonamiento automatico, como el analisis de la semantica de lenguajes de programaci on mediante operadores de punto jo, se benefician de esta caracterizacion. En segundo lugar, se introduce un metodo automatico, basado en el marco teorico de pares de dependencia, para demostrar la terminacion del estrechamiento en un sistema particular. Nuestro metodo es, por primera vez, aplicable a cualquier clase de sistemas. En tercer lugar, se propone un nuevo metodo para estudiar la terminacion del estrechamiento desde un termino particular, permitiendo el analisis de la terminacion de lenguajes de programacion. El nuevo metodo generaliza losIborra López, J. (2010). Termination of Narrowing: Automated Proofs and Modularity Properties [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/19251Palanci

Culture collections and biochemistry

This review describes the relationships and links between culture collections, which act as sources of genomes, transcriptomes, proteome, and metabolomes, and fields of research biochemistry that demand their support and help. In addition, the invaluable but not always rewarded efforts of these organizations as a source and conservator of organism diversity is discussed. Biological waste-water treatment, ethanol as a non-finite source of energy, Rhodococcus fascians as the source of a citrus-juice debittering agent, the sporulation of filamentous fungi in liquid medium, and biotransformation with growing and resting cells are processes developed by the authors that demonstrate some of the applications of organisms from culture collections in the general field of biotechnology and related areas, including industrial biochemistry and biocatalytic synthesis

Vehicular Systems Technologies: Challenges and Trends Across Transportation Means

The work is supported by the Spanish Ministry of Science, Innovation and Universities, under the Ramon y Cajal Program (Grant No. RYC-2017-23823) and the project PERSEIDES (Grant No.TIN2017-86885-R); the BBVA Foundation, under the 2018 Leonardo Grant for Researchers and Cultural Creators; and by the European Commission, under the projects IoTCrawler (Grant No. 779852), 5G-MOBIX (Grant No. 825496) and Pharaon (Grant No. 857188). First of all, we would like to thank all researchers who submitted articles to this special issue for their excellent contributions. We are also grateful to all reviewers who helped in the evaluation of the manuscripts and made valuable suggestions to improve the quality of contributions. We would like to acknowledge the editorial board of Electronics, who invited us to guest edit this special issue. We are also grateful to the Electronics Editorial Office staff who worked thoroughly to maintain the rigorous peer-review schedule and timely publication

GOYA: a teleoperated system for blasting applied to ships maintenance

This paper presents the GOYA Project, a teleoperated system for blasting applied to hull cleaning in ship maintenance. The objective of the project is to develop a reliable and cost effective technology regarding hull grit blasting, obtaining a high quality surface preparation together with a dramatic reduction of waste and zero emissions to environment. Present technology for hull cleaning and the problematic in shipbuilding industry are analysed. Selection of blasting technologies and materials is also approached in this paper, showing the different tests carried out to achieve a hull surface cleanliness of SA 2 ½. The desing of the robot is also presented, showing aspects of mechanical, control unit, teleoperation system and blasting head design. It also shows the consecution of a smooth hull surface and the reduction of operation costs atmospheric contamination. It also eliminates the hard working conditions of the operators in the present manual operation. This work is supported by the Spanish government and the European Union (CICYT-FEDER) and is tested in BAZAN Co.The authors want to acknowledge the Spanish government and European Communities for CICYT-FEDER support (1FD97-0823). Additional funds support from BAZAN and Spanish Ministry of Industry (ATYCA)

Gestão e actualização do viário urbano por meio da aplicação web de um SIG

Disponer de un sistema digital integrado de direcciones postales y puntos de interés, con información asociada y georreferenciada, supone una ventaja en la gestión territorial para las administraciones públicas, tanto a nivel municipal como regional y nacional. Aunque la normativa INSPIRE, a través de su artículo 1, unifica los procesos de numeración en las ciudades europeas, es competencia de los gobiernos locales conservar y actualizar la información resultante. En este sentido, no existe en la actualidad una metodología consolidada que se pueda extrapolar a todos los núcleos urbanos europeos. El objetivo de este trabajo ha sido desarrollar un procedimiento para actualizar el callejero del municipio de Mazarrón (Murcia), haciendo uso de tecnología SIG y de la información disponible en el directorio de la IDEE, catastro y las bases de datos municipales. Una vez depurados y unificados estos datos, se ha procedido a su actualización a través de una Aplicación Web cartográfica sincronizada con un SIG de escritorio.Having a digital integrated system of postal address with associated and georeferenced information involve an advantage in the territorial management for public administrations, including local, regional and national level. Although INSPIRE legislation, through its article 1, joins numbering processes of European cities, to renew and to conserve the resulting information will be task of the local government. In this sense, a methodology that can be extrapolated to all urban European nucleuses does not exist. The aim of this work has been to develop a process to update the urban road of the municipality of Mazarrón (Murcia), using GIS technology and available information at the IDEE directory, cadastre and municipal data base. Once the data has been selected, it is updated through a Web Cartographic Application synchronized with a desktop GIS.Ter um endereço postal integrados e pontos de interesse com informações associadas e sistema digital georreferenciada é uma vantagem na gestão do espaço para as administrações públicas, locais, regionais e de nível nacional. Ainda que a legislação INSPIRE através do artigo 1, unifica processos de numeração nas cidades europeias, é da responsabilidade dos governos locais manter e atualizar as informações resultantes. Agora existe umas metodologias consolidadas que podem ser extrapoladas para todas as cidades europeias. O objetivo deste trabalho foi desenvolver um procedimento para atualizar a guía da cidade de Mazarrón (Murcia), utilizando a tecnologia GIS e informações disponíveis no diretório IDEE, registro de terras e bancos de dados municipais. Uma vez unificadas e depuradas estes dados, procedeu-se atualizar através de mapeamento Web sincronizada com GIS desktop

Relative Termination via Dependency Pairs

[EN] A term rewrite system is terminating when no infinite reduction sequences are possible. Relative termination generalizes termination by permitting infinite reductions as long as some distinguished rules are not applied infinitely many times. Relative termination is thus a fundamental notion that has been used in a number of different contexts, like analyzing the confluence of rewrite systems or the termination of narrowing. In this work, we introduce a novel technique to prove relative termination by reducing it to dependency pair problems. To the best of our knowledge, this is the first significant contribution to Problem #106 of the RTA List of Open Problems. We first present a general approach that is then instantiated to provide a concrete technique for proving relative termination. The practical significance of our method is illustrated by means of an experimental evaluation.Open access funding provided by Austrian Science Fund (FWF). We would like to thank Nao Hirokawa, Keiichirou Kusakari, and the anonymous reviewers for their helpful comments and suggestions in early stages of this work.Iborra, J.; Nishida, N.; Vidal Oriola, G.; Yamada, A. (2017). Relative Termination via Dependency Pairs. Journal of Automated Reasoning. 58(3):391-411. https://doi.org/10.1007/s10817-016-9373-5391411583Alarcón, B., Lucas, S., Meseguer, J.: A dependency pair framework for A $$\vee$$ ∨ C-termination. In: WRLA 2010, LNCS, vol. 6381, pp. 36–52. Springer (2010)Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theor. Comput. Sci. 236(1–2), 133–178 (2000)Arts, T., Giesl, J.: A collection of examples for termination of term rewriting using dependency pairs. Technical report AIB-2001-09, RWTH Aachen (2001)Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)Bachmair, L., Dershowitz, N.: Critical pair criteria for completion. J. Symb. Comput. 6, 1–18 (1988)Bonacina, M., Hsiang, J.: On fairness of completion-based theorem proving strategies. In: RTA 1991, LNCS, vol. 488, pp. 348–360. Springer (1991)Dershowitz, N.: Termination of rewriting. J. Symb. Comput. 3(1&2), 69–115 (1987)Endrullis, J., Waldmann, J., Zantema, H.: Matrix interpretations for proving termination of term rewriting. J. Autom. Reason. 40(2–3), 195–220 (2008)Geser, A.: Relative Termination. Dissertation, Fakultät für Mathematik und Informatik. Universität Passau, Germany (1990)Giesl, J., Kapur, D.: Dependency pairs for equational rewriting. In: RTA 2001, LNCS, vol. 2051, pp. 93–107. Springer (2001)Giesl, J., Schneider-Kamp, P., Thiemann, R.: AProVE 1.2: automatic termination proofs in the dependency pair framework. In: IJCAR 2006, LNCS, vol. 4130, pp. 281–286. Springer (2006)Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and improving dependency Pairs. J. Autom. Reason. 37(3), 155–203 (2006)Hirokawa, N., Middeldorp, A.: Dependency pairs revisited. In: RTA 2004, LNCS, vol. 3091, pp. 249–268. Springer (2004)Hirokawa, N., Middeldorp, A.: Polynomial interpretations with negative coefficients. In: AISC 2004, LNAI, vol. 3249, pp. 185–198. Springer (2004)Hirokawa, N., Middeldorp, A.: Tyrolean termination tool: techniques and features. Inf. Comput. 205(4), 474–511 (2007)Hirokawa, N., Middeldorp, A.: Decreasing diagrams and relative termination. J. Autom. Reason. 47(4), 481–501 (2011)Hullot, J.M.: Canonical forms and unification. In: CADE 1980, LNCS, vol. 87, pp. 318–334. Springer (1980)Iborra, J., Nishida, N., Vidal, G.: Goal-directed and relative dependency pairs for proving the termination of narrowing. In: LOPSTR 2009, LNCS, vol. 6037, pp. 52–66. Springer (2010)Iborra, J., Nishida, N., Vidal, G., Yamada, A.: Reducing relative termination to dependency pair problems. In: CADE-25, LNAI, vol. 9195, pp. 163–178. Springer (2015)Kamin, S., Lévy, J.J.: Two generalizations of the recursive path ordering (1980). Unpublished noteKlop, J.W.: Term rewriting systems: a tutorial. Bull. Eur. Assoc. Theor. Comput. Sci. 32, 143–183 (1987)Koprowski, A.: TPA: termination proved automatically. In: RTA 2006, LNCS, vol. 4098, pp. 257–266. Springer (2006)Koprowski, A., Zantema, H.: Proving liveness with fairness using rewriting. In: FroCoS 2005, LNCS, vol. 3717, pp. 232–247. Springer (2005)Korp, M., Sternagel, C., Zankl, H., Middeldorp, A.: Tyrolean termination tool 2. In: RTA 2009, LNCS, vol. 5595, pp. 295–304. Springer (2009)Kusakari, K., Toyama, Y.: On proving AC-termination by AC-dependency pairs. IEICE Trans. Inf. Syst. E84–D(5), 439–447 (2001)Lankford, D.: Canonical algebraic simplification in computational logic. Technical report ATP-25, University of Texas (1975)Marché, C., Urbain, X.: Modular and incremental proofs of AC-termination. J. Symb. Comput. 38(1), 873–897 (2004)Nishida, N., Sakai, M., Sakabe, T.: Narrowing-based simulation of term rewriting systems with extra variables. ENTCS 86(3), 52–69 (2003)Nishida, N., Vidal, G.: Termination of narrowing via termination of rewriting. Appl. Algebra Eng. Commun. Comput. 21(3), 177–225 (2010)Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, London (2002)Slagle, J.: Automated theorem-proving for theories with simplifiers commutativity and associativity. J. ACM 21(4), 622–642 (1974)Thiemann, R., Allais, G., Nagele, J.: On the formalization of termination techniques based on multiset orderings. In: RTA 2012, LIPIcs, vol. 15, pp. 339–354. Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)Vidal, G.: Termination of narrowing in left-linear constructor systems. In: FLOPS 2008, LNCS, vol. 4989, pp. 113–129. Springer (2008)Yamada, A., Kusakari, K., Sakabe, T.: Nagoya termination tool. In: RTA-TLCA 2014, LNCS, pp. 466–475. Springer (2014)Yamada, A., Kusakari, K., Sakabe, T.: A unified ordering for termination proving. Sci. Comput. Program. 111, 110–134 (2015)Zantema, H.: Termination of term rewriting by semantic labelling. Fundam. Inf. 24(1/2), 89–105 (1995)Zantema, H.: Termination. In: Bezem, M., Klop, J. W., de Vrijer, R. (eds.) Term Rewriting Systems, Cambridge Tracts in Theoretical Computer Science, chap. 6, vol. 55, pp. 181–259. Cambridge University Press, Cambridge (2003

An automatic maintenance system for nuclear power plants instrumentation

Maintenance and testing of reactor protection systems is an important cause of unplanned reactor trips due to be commonly carried out in manual mode. The execution of surveillance procedures in this mode entails a great number of manual operations. Automated testing is the answer because it minimises test times and reduces the risk of human errors. GAMA-I is an automatic system for testing the reactor protection instrumentation which is based on VXI instrumentation cards. This system has important advantages over previous ones in terms of easiness to carry out software modifications related to configuration changes in the protection system. The system uses visual programming and the modifications can be implemented by ordinary instrumentation specialists without programming experience.The system has been developed at the Vandellos II Nuclear Power Plant by the I&C groups of Vandellos II, Tecnatom S.A. and ENWESA Servicios S.A. The representation for this project is held by the Spanish Association for the Nuclear Technologic Development (DTN). Financial support for this research was provided by the Electrical and Electronic Research Program (PIE-OCIDE) of the Spanish Ministry of Industry