Canonization for disjoint unions of theories
From MaRDI portal
Publication:2486580
DOI10.1016/J.IC.2004.11.001zbMATH Open1078.68138OpenAlexW2013378402MaRDI QIDQ2486580FDOQ2486580
Authors: Sava Krstić, Sylvain Conchon 
Publication date: 5 August 2005
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2004.11.001
Recommendations
Cites Work
- Simplification by Cooperating Decision Procedures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deciding the word problem in the union of equational theories.
- Unions of non-disjoint theories and combinations of satisfiability procedures
- Deciding Combinations of Theories
- Title not available (Why is that?)
- Combining decision procedures.
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Shostak's decision procedure for combinations of theories
- Title not available (Why is that?)
- The join of equational theories
- Superposition modulo a Shostak theory.
Cited In (9)
- Revisiting the canonicity of canonical triangulations
- Theoretical Aspects of Computing - ICTAC 2004
- Canonized Rewriting and Ground AC Completion Modulo Shostak Theories
- \textsf{CC(X)}: semantic combination of congruence closure with solvable theories
- Solutions of functional equations in Shostak theories
- Building Extended Canonizers by Graph-Based Deduction
- Politeness for the theory of algebraic datatypes
- Canonization for disjoint unions of theories.
- Polite combination of algebraic datatypes
Uses Software
This page was built for publication: Canonization for disjoint unions of theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486580)
