Predictive Labeling with Dependency Pairs Using SAT

DOI10.1007/978-3-540-73595-3_31MaRDI QIDQ3608786zbMATH OpenOpenAlexFDO

Authors Adam Koprowski, Aart Middeldorp

Publication date 6 March 2009

Published in Automated Deduction – CADE-21 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Predictive Labeling
• Innermost termination of rewrite systems by labeling
• POP* and Semantic Labeling Using SAT
• SAT solving for termination proofs with recursive path orders and dependency pairs
• SAT Solving for Argument Filterings

Cited in

(8)

• SAT solving for termination proofs with recursive path orders and dependency pairs
• Innermost termination of rewrite systems by labeling
• Root-Labeling
• Predictive Labeling
• POP* and Semantic Labeling Using SAT
• Transforming SAT into termination of rewriting
• SAT Solving for Argument Filterings
• KBO orientability

Describes a project that uses

Uses Software

• MiniSat
• Tyrolean

This page was built for publication: Predictive Labeling with Dependency Pairs Using SAT

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