Rewrite-Based Decision Procedures

DOI10.1016/j.entcs.2006.11.042zbMath1277.68238OpenAlexW2023447392MaRDI QIDQ2864358

Maria Paola Bonacina, Mnacho Echenim

Publication date: 6 December 2013

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.11.042

zbMATH Keywords

\(T\)-decision proceduresrewrite-based inference systems

Mathematics Subject Classification ID

Related Items (3)

On deciding satisfiability by theorem proving with speculative inferences ⋮ Locality Results for Certain Extensions of Theories with Bridging Functions ⋮ Theory decision by decomposition

Uses Software

• CVC Lite
• CVC

Cites Work

• M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures
• A rewriting approach to satisfiability procedures.
• Rewrite-Based Satisfiability Procedures for Recursive Data Structures
• Computer Aided Verification
• Computer Aided Verification
• Frontiers of Combining Systems
• Theory and Applications of Satisfiability Testing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Rewrite-Based Decision Procedures