Modular Termination and Combinability for Superposition Modulo Counter Arithmetic
From MaRDI portal
Publication:3172895
DOI10.1007/978-3-642-24364-6_15zbMATH Open1348.68223OpenAlexW2125573666MaRDI QIDQ3172895FDOQ3172895
Christophe Ringeissen, Valerio Senni
Publication date: 7 October 2011
Published in: Frontiers of Combining Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24364-6_15
Cites Work
- Title not available (Why is that?)
- Simplification by Cooperating Decision Procedures
- A rewriting approach to satisfiability procedures.
- Automated deduction -- CADE-22. 22nd international conference on automated deduction, Montreal, Canada, August 2--7, 2009. Proceedings
- Rewriting
- Rewrite-based Equational Theorem Proving with Selection and Simplification
- On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving
- New results on rewrite-based satisfiability procedures
- On Variable-inactivity and Polynomial Formula-Satisfiability Procedures
- Automatic decidability and combinability
- Model-theoretic methods in combined constraint satisfiability
- Theory decision by decomposition
- Data Structures with Arithmetic Constraints: A Non-disjoint Combination
- Automatic Combinability of Rewriting-Based Satisfiability Procedures
- Locality Results for Certain Extensions of Theories with Bridging Functions
- A comprehensive combination framework
- Verifying Balanced Trees
- Decision procedures for algebraic data types with abstractions
- Combining Satisfiability Procedures for Unions of Theories with a Shared Counting Operator
- Combinable Extensions of Abelian Groups
Cited In (2)
This page was built for publication: Modular Termination and Combinability for Superposition Modulo Counter Arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172895)
