Combining stable infiniteness and (strong) politeness

DOI10.1007/s10817-023-09684-0OpenAlexW4387034993MaRDI QIDQ6053847

Clark Barrett, Cesare Tinelli, Ying Sheng, Yoni Zohar, Andrew Reynolds, Christophe Ringeissen

Publication date: 24 October 2023

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-023-09684-0

zbMATH Keywords

satisfiability modulo theoriestheory combinationpolite combination

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites Work

• Unnamed Item
• Unnamed Item
• Many-sorted equivalence of shiny and strongly polite theories
• Combining nonstably infinite theories
• Politeness and stable infiniteness: stronger together
• Politeness for the theory of algebraic datatypes
• Revisiting the Equivalence of Shininess and Politeness
• Combinations of Theories for Decidable Fragments of First-Order Logic
• Simplification by Cooperating Decision Procedures
• Polite Theories Revisited
• Logics in Artificial Intelligence
• Frontiers of Combining Systems
• Combined Satisfiability Modulo Parametric Theories