2022
DOI: 10.1007/978-3-031-10769-6_15
|View full text |Cite
|
Sign up to set email alerts
|

Term Orderings for Non-reachability of (Conditional) Rewriting

Abstract: We propose generalizations of reduction pairs, well-established techniques for proving termination of term rewriting, in order to prove unsatisfiability of reachability (infeasibility) in plain and conditional term rewriting. We adapt the weighted path order, a merger of the Knuth–Bendix order and the lexicographic path order, into the proposed framework. The proposed approach is implemented in the termination prover , and the strength of our approach is demonstrated through examples and experiments.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
references
References 34 publications
(51 reference statements)
0
0
0
Order By: Relevance