59 research outputs found

    Cops and CoCoWeb: Infrastructure for Confluence Tools

    Get PDF
    In this paper we describe the infrastructure supporting confluence tools and competitions: Cops, the confluence problems database, and CoCoWeb, a convenient web interface for tools that participate in the annual confluence competition

    Reducing relative termination to dependency pair problems

    Full text link
    The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-21401-6_11Relative termination, a generalized notion of termination, has been used in a number of different contexts like proving the confluence of rewrite systems or analyzing the termination of narrowing. In this paper, we introduce a new 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. The practical significance of our method is illustrated by means of an experimental evaluation.Germán Vidal is partially supported by the EU (FEDER) and the Spanish Ministerio de Economía y Competitividad under grant TIN2013-44742-C4-R and by the Generalitat Valenciana under grant PROMETEOII201/013. Akihisa Yamadais supported by the Austrian Science Fund (FWF): Y757Iborra, J.; Nishida, N.; Vidal Oriola, GF.; Yamada, A. (2015). Reducing relative termination to dependency pair problems. En Automated Deduction - CADE-25. Springer. 163-178. https://doi.org/10.1007/978-3-319-21401-6_11S163178Alarcón, B., Lucas, S., Meseguer, J.: A dependency pair framework for A \vee C-termination. In: Ölveczky, P.C. (ed.) WRLA 2010. LNCS, vol. 6381, pp. 35–51. Springer, Heidelberg (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)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. Reasoning 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: Middeldorp, A. (ed.) RTA 2001. LNCS, vol. 2051, pp. 93–107. Springer, Heidelberg (2001)Giesl, J., Schneider-Kamp, P., Thiemann, R.: AProVE 1.2: automatic termination proofs in the dependency pair framework. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 281–286. Springer, Heidelberg (2006)Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and improving dependency pairs. J. Autom. Reasoning 37(3), 155–203 (2006)Hirokawa, N., Middeldorp, A.: Polynomial interpretations with negative coefficients. In: Buchberger, B., Campbell, J. (eds.) AISC 2004. LNCS (LNAI), vol. 3249, pp. 185–198. Springer, Heidelberg (2004)Hirokawa, N., Middeldorp, A.: Dependency pairs revisited. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 249–268. Springer, Heidelberg (2004)Hirokawa, N., Middeldorp, A.: Decreasing diagrams and relative termination. J. Autom. Reasoning 47(4), 481–501 (2011)Hullot, J.M.: Canonical forms and unification. CADE-5. LNCS, vol. 87, pp. 318–334. Springer, Heidelberg (1980)Iborra, J., Nishida, N., Vidal, G.: Goal-directed and relative dependency pairs for proving the termination of narrowing. In: De Schreye, D. (ed.) LOPSTR 2009. LNCS, vol. 6037, pp. 52–66. Springer, Heidelberg (2010)Kamin, S., Lévy, J.J.: Two generalizations of the recursive path ordering (1980, unpublished note)Klop, J.W.: Term rewriting systems: a tutorial. Bull. Eur. Assoc. Theor. Comput. Sci. 32, 143–183 (1987)Koprowski, A., Zantema, H.: Proving liveness with fairness using rewriting. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol. 3717, pp. 232–247. Springer, Heidelberg (2005)Koprowski, A.: TPA: termination proved automatically. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 257–266. Springer, Heidelberg (2006)Korp, M., Sternagel, C., Zankl, H., Middeldorp, A.: Tyrolean termination tool 2. In: Treinen, R. (ed.) RTA 2009. LNCS, vol. 5595, pp. 295–304. Springer, Heidelberg (2009)Lankford, D.: Canonical algebraic simplification in computational logic. Technical report ATP-25, University of Texas (1975)Liu, J., Dershowitz, N., Jouannaud, J.-P.: Confluence by critical pair analysis. In: Dowek, G. (ed.) RTA-TLCA 2014. LNCS, vol. 8560, pp. 287–302. Springer, Heidelberg (2014)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-Verlag, London (2002)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: Garrigue, J., Hermenegildo, M.V. (eds.) FLOPS 2008. LNCS, vol. 4989, pp. 113–129. Springer, Heidelberg (2008)Yamada, A., Kusakari, K., Sakabe, T.: Nagoya termination tool. In: Dowek, G. (ed.) RTA-TLCA 2014. LNCS, vol. 8560, pp. 466–475. Springer, Heidelberg (2014)Yamada, A., Kusakari, K., Sakabe, T.: A unified ordering for termination proving. Sci. Comput. Program. (2014). doi: 10.1016/j.scico.2014.07.009Zantema, H.: Termination of term rewriting by semantic labelling. Fundamenta Informaticae 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, vol. 55, pp. 181–259. Cambridge University Press, Cambridge (2003

    Health information seeking on the Internet: a double divide? Results from a representative survey in the Paris metropolitan area, France, 2005–2006

    Get PDF
    <p>Abstract</p> <p>Background</p> <p>The Internet is a major source of information for professionals and the general public, especially in the field of health. However, despite ever-increasing connection rates, a digital divide persists in the industrialised countries. The objective of this study was to assess the determinants involved in: 1) having or not having Internet access; and 2) using or not using the Internet to obtain health information.</p> <p>Methods</p> <p>A cross-sectional survey of a representative random sample was conducted in the Paris metropolitan area, France, in the fall of 2005 (n = 3023).</p> <p>Results</p> <p>Close to 70% of the adult population had Internet access, and 49% of Internet users had previously searched for medical information. Economic and social disparities observed in online health information seeking are reinforced by the economic and social disparities in Internet access, hence a double divide. While individuals who reported having a recent health problem were less likely to have Internet access (odds ratio (OR): 0.72, 95% confidence interval (CI): 0.53–0.98), it is they who, when they have Internet access, are the most likely to search for health information (OR = 1.44, 95% CI = 1.11–1.87).</p> <p>Conclusion</p> <p>In the French context of universal health insurance, access to the Internet varies according to social and socioeconomic status and health status, and its use for health information seeking varies also with health beliefs, but not to health insurance coverage or health-care utilisation. Certain economic and social inequalities seem to impact cumulatively on Internet access and on the use of the Internet for health information seeking. It is not obvious that the Internet is a special information tool for primary prevention in people who are the furthest removed from health concerns. However, the Internet appears to be a useful complement for secondary prevention, especially for better understanding health problems or enhancing therapeutic compliance.</p

    The academic–vocational divide in three Nordic countries : implications for social class and gender

    Get PDF
    In this study we examine how the academic–vocational divide is manifested today in Finland, Iceland and Sweden in the division between vocationally (VET) and academicallyoriented programmes at the upper-secondary school level. The paper is based on a critical re-analysis of results from previous studies; in it we investigate the implications of this divide for class and gender inequalities. The theoretical lens used for the synthesis is based on Bernstein´s theory of pedagogic codes. In the re-analysis we draw on previous studies of policy, curriculum and educational praxis as well as official statistics. The main conclusions are that contemporary policy and curriculum trends in all three countries are dominated by a neo-liberal discourse stressing principles such as “market relevance” and employability. This trend strengthens the academic–vocational divide, mainly through an organisation of knowledge in VET that separates it from more general and theoretical elements. This trend also seems to affect VET students’ transitions in terms of reduced access to higher education, particularly in male-dominated programmes. We also identify low expectations for VET students, manifested through choice of textbooks and tasks, organisation of teacher teams and the advice of career counsellors.Peer reviewe

    A tool proving well-definedness of streams using termination tools

    No full text
    A stream specification is a set of equations intended to define a stream, that is, an infinite sequence over a given data type. In [5] a transformation from such a stream specification to a TRS is defined in such a way that termination of the resulting TRS implies that the stream specification admits a unique solution. In this tool description we present how proving such well-definedness of several interesting boolean stream specifications can be done fully automatically using present powerful tools for proving TRS termination

    A Tool Proving Well-Definedness of Streams Using Termination Tools

    No full text

    Stereoselective synthesis of pyrrolidinyl glycines from nitrones: complementarity of nucleophilic addition and 1,3-dipolar cycloaddition

    No full text
    4 pages, 4 schemes, 2 figures.-- et al.Epimeric pyrrolidinyl glycines, a sort of conformationally constrained α,β-diaminoacids, were stereoselectively prepared using complementary approaches based on nitrone chemistry. Nucleophilic additions to pyrrolidinyl nitrones and 1,3-dipolar cycloadditions of l-serine derived nitrones to form the corresponding hydroxylamines and isoxazolidines, respectively, provided key intermediates for the synthesis of the target compounds. Whereas the nucleophilic addition route afforded the syn adduct, the 1,3-dipolar cycloaddition approach furnished the precursor for the preparation of the corresponding anti compound.We thank the Ministerio de Educacion y Ciencia (MEC, Project CTQ2004-0421), the European Union (Project TRIoH, LSHB-CT-2003-503480), and the Regional Government of Aragon (DGA) for financial support. I.D. thanks DGA for a pre-doctoral grant.Peer reviewe
    corecore