Transforming orthogonal inductive definition sets into confluent term rewrite systems

• Published in: Journal of logical and algebraic methods in programming Vol. 127; p. 100779
• Main Authors: Zhang, Shujun, Nishida, Naoki
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 01.06.2022
• Subjects: Dependency pair; First-order logic; Inductive theorem; Program transformation; Term rewriting; Termination; Term rewriting; Inductive theorem; First-order logic; Termination; Dependency pair; Program transformation
• ISSN: 2352-2208
• DOI: 10.1016/j.jlamp.2022.100779

In this paper, we transform an orthogonal inductive definition set, which is a set of productions for inductive predicates, into a confluent term rewrite system such that a quantifier-free sequent is valid w.r.t. the inductive definition set if and only if an equation representing the sequent is an inductive theorem of the term rewrite system. To this end, we first propose a transformation of an orthogonal inductive definition set into a confluent term rewrite system that is equivalent to the inductive definition set in the sense of evaluating ground formulas. Then, we show that termination of the inductive definition set is proved by the generalized subterm criterion if and only if termination of the transformed term rewrite system is so. Finally, we show that the transformed term rewrite system with some rewrite rules for sequents has the expected property. In addition, we show a termination criterion for the union of term rewrite systems whose termination is proved by the generalized subterm criterion. •We propose a transformation of an orthogonal IDS into a confluent TRS that is equivalent to the IDS in the sense of evaluating ground formulas.•We show that termination of the IDS is proved by the generalized subterm criterion iff termination of the transformed TRS is so.•We show that a QF sequent is valid w.r.t. the IDS iff an equation for the sequent is an inductive theorem of the TRS with some rewrite rules for sequents.•We show a termination criterion for the union of TRSs whose termination is proved by the generalized subterm criterion.