Solving partial order constraints for LPO termination

zbMATH Open1172.68484MaRDI QIDQ3620437FDOQ3620437

Authors: Michael Codish, V. Lagoon, Peter J. Stuckey 

Publication date: 14 April 2009

Recommendations

• Solving Partial Order Constraints for LPO Termination
• SAT solving for termination proofs with recursive path orders and dependency pairs
• Proving Termination Using Recursive Path Orders and SAT Solving
• SAT Solving for Argument Filterings
• Constraints for Argument Filterings

zbMATH Keywords

Boolean satisfiabilityterm rewrite systemslexicographic path orders

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (3)

• SAT Solving for Argument Filterings
• SAT solving for termination proofs with recursive path orders and dependency pairs
• Solving Partial Order Constraints for LPO Termination

Uses Software

• MiniSat

This page was built for publication: Solving partial order constraints for LPO termination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3620437)