Combining combination properties: minimal models

DOI10.29007/6QKHMaRDI QIDQ7025199zbMATH OpenFDO

Authors Guilherme V. Toledo, Yoni Zohar

Publication date 19 February 2025

Full work available at URL https://doi.org/10.29007/6QKH

zbMATH Keywords

satisfiability modulo theoriestheory combinationtheory politeness

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites work

• Bitwuzla
• Combining Combination Properties: An Analysis of Stable Infiniteness, Convexity, and Politeness
• Combining Finite Combination Properties: Finite Models and Busy Beavers
• Combining nonstably infinite theories
• Decision procedures. An algorithmic point of view
• Finiteness of the odd perfect and primitive abundant numbers with \(n\) distinct prime factors.
• Frontiers of Combining Systems
• scientific article; zbMATH DE number 217097 (Why is no real title available?)
• scientific article; zbMATH DE number 2086596 (Why is no real title available?)
• Many-sorted equivalence of shiny and strongly polite theories
• On non-computable functions
• Polite theories revisited
• Politeness and stable infiniteness: stronger together
• Revisiting the equivalence of shininess and politeness
• Simplification by Cooperating Decision Procedures
• The MathSAT5 SMT solver
• Weakly equivalent arrays

Cited in

(2)

• Number theory combination: natural density and SMT
• Combining combination properties. I: Nelson-Oppen and politeness

This page was built for publication: Combining combination properties: minimal models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7025199)