Use of logical models for proving infeasibility in term rewriting

Abstract Given a (Conditional) Rewrite System R and terms s and t, we consider the following problem: is there a substitution σ instantiating the variables in s and t such that the reachability test σ ( s ) → R ⁎ σ ( t ) succeeds? If such a substitution does not exist, we say that the problem is infeasible; otherwise, we call it feasible. Similarly, we can consider reducibility, involving a single rewriting step. In term rewriting, a number of important problems involve such infeasibility tests (e.g., confluence and termination analysis). We show how to recast infeasibility tests into the problem of finding a model of a set of (first-order) sentences representing the operational semantics of R together with some additional sentences representing the considered property which is formulated as an infeasibility test.

[1]  Aart Middeldorp.  Call by need computations to root-stable form , 1997, POPL '97.

[2]  Enno Ohlebusch,et al.  Advanced Topics in Term Rewriting , 2002, Springer New York.

[3]  Salvador Lucas,et al.  Analysis of Rewriting-Based Systems as First-Order Theories , 2017, LOPSTR.

[4]  José Meseguer,et al.  Normal forms and normal theories in conditional rewriting , 2016, J. Log. Algebraic Methods Program..

[5]  Jürgen Giesl,et al.  Termination of term rewriting using dependency pairs , 2000, Theor. Comput. Sci..

[6]  Christian Sternagel,et al.  Certifying Confluence of Almost Orthogonal CTRSs via Exact Tree Automata Completion , 2016, FSCD.

[7]  José Meseguer,et al.  2D Dependency Pairs for Proving Operational Termination of CTRSs , 2014, WRLA.

[8]  Raúl Gutiérrez,et al.  A Semantic Criterion for Proving Infeasibility in Conditional Rewriting ∗ , 2017 .

[9]  Hans Hermes,et al.  Introduction to mathematical logic , 1973, Universitext.

[10]  Jürgen Giesl,et al.  Proving and Disproving Termination of Higher-Order Functions , 2005, FroCoS.

[11]  José Meseguer,et al.  Dependency pairs for proving termination properties of conditional term rewriting systems , 2017, J. Log. Algebraic Methods Program..

[12]  Takahito Aoto,et al.  Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering , 2013, FroCos.

[13]  Chang Liu,et al.  Term rewriting and all that , 2000, SOEN.

[14]  José Meseguer,et al.  Models for Logics and Conditional Constraints in Automated Proofs of Termination , 2014, AISC.

[15]  Raúl Gutiérrez,et al.  Automatic Synthesis of Logical Models for Order-Sorted First-Order Theories , 2018, Journal of Automated Reasoning.

[16]  Aart Middeldorp,et al.  Approximating Dependency Graphs Using Tree Automata Techniques , 2001, IJCAR.

[17]  José Meseguer,et al.  Operational termination of conditional term rewriting systems , 2005, Inf. Process. Lett..