3 research outputs found

    Certifying Confluence of Almost Orthogonal CTRSs via Exact Tree Automata Completion

    Get PDF
    Suzuki et al. showed that properly oriented, right-stable, orthogonal, and oriented conditional term rewrite systems with extra variables in right-hand sides are confluent. We present our Isabelle/HOL formalization of this result, including two generalizations. On the one hand, we relax proper orientedness and orthogonality to extended proper orientedness and almost orthogonality modulo infeasibility, as suggested by Suzuki et al. On the other hand, we further loosen the requirements of the latter, enabling more powerful methods for proving infeasibility of conditional critical pairs. Furthermore, we formalized a construction by Jacquemard that employs exact tree automata completion for non-reachability analysis and apply it to certify infeasibility of conditional critical pairs. Combining these two results and extending the conditional confluence checker ConCon accordingly, we are able to automatically prove and certify confluence of an important class of conditional term rewrite systems

    1938 - Quarterly Chapter of State Mineralogist\u27s Report XXXIV, California Journal of Mines and Geology

    Get PDF
    Report of the development of mining resources and mining activities in each of the four field districts (Redding, Auburn, San Francisco and Los Angeles) were prepared by the District Engineer.https://digitalcommons.csumb.edu/hornbeck_usa_3_d/1083/thumbnail.jp
    corecore