Term Rewriting and Applications
From MaRDI portal
Publication:5703869
DOI10.1007/b135673zbMath1078.68661OpenAlexW2504734884MaRDI QIDQ5703869
Albert Oliveras, Robert Nieuwenhuis
Publication date: 11 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b135673
Related Items
Search-Space Partitioning for Parallelizing SMT Solvers, Knuth-Bendix completion of theories of commuting group endomorphisms, NP-completeness of small conflict set generation for congruence closure, Weakly Equivalent Arrays, On rewriting rules in Mizar, A pearl on SAT and SMT solving in Prolog, Ground Interpolation for the Theory of Equality, Congruence Closure in Intensional Type Theory, Modular SMT Proofs for Fast Reflexive Checking Inside Coq, Combination of convex theories: modularity, deduction completeness, and explanation, E-matching for Fun and Profit
