The Generalized Multiset Ordering is NP-Complete

MaRDI QIDQ7361065FDO

Authors René Thiemann, Lukas Schmidinger

Publication date 20 April 2022

Cites work

• Unnamed Publication
• On the formalization of termination techniques based on multiset orderings
• SAT solving for termination proofs with recursive path orders and dependency pairs
• Termination of rewriting

This page was built for software: The Generalized Multiset Ordering is NP-Complete