Constraints for Argument Filterings

DOI10.1007/978-3-540-69507-3_50zbMATH Open1131.68468OpenAlexW1531034707MaRDI QIDQ5448809FDOQ5448809

Authors: Harald Zankl, Nao Hirokawa, Aart Middeldorp 

Publication date: 7 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69507-3_50

Recommendations

• SAT Solving for Argument Filterings
• scientific article; zbMATH DE number 1487842
• Argument filterings and usable rules for simply typed dependency pairs
• Rewriting Techniques and Applications
• Automating the dependency pair method.

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Logic in computer science (03B70)

Cited In (5)

• SAT Solving for Argument Filterings
• KBO orientability
• SAT solving for termination proofs with recursive path orders and dependency pairs
• Solving partial order constraints for LPO termination
• Encoding dependency pair techniques and control strategies for maximal completion

This page was built for publication: Constraints for Argument Filterings

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