2026-07-25T03:15:22Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:15555 2024-03-06T10:55:35Z ddc:004 open_access

Confluence of Conditional Rewriting in Logic Form Gutiérrez, Raúl Lucas, Salvador Vítores, Miguel Confluence Program analysis Rewriting-based systems We characterize conditional rewriting as satisfiability in a Herbrand-like model of terms where variables are also included as fresh constant symbols extending the original signature. Confluence of conditional rewriting and joinability of conditional critical pairs is characterized similarly. Joinability of critical pairs is then translated into combinations of (in)feasibility problems which can be efficiently handled by a number of automatic tools. This permits a more efficient use of standard results for proving confluence of conditional term rewriting systems, most of them relying on auxiliary proofs of joinability of conditional critical pairs, perhaps with additional syntactical and (operational) termination requirements on the system. Our approach has been implemented in a new system: CONFident . Its ability to (dis)prove confluence of conditional term rewriting systems is witnessed by means of some benchmarks comparing our tool with existing tools for similar purposes. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Raúl Gutiérrez and Salvador Lucas and Miguel Vítores 2021 Is Part Of LIPIcs, Volume 213, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2021.44 urn:nbn:de:0030-drops-155553 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2021.44 eng https://creativecommons.org/licenses/by/4.0/legalcode