Polite Theories Revisited

DOI10.1007/978-3-642-16242-8_29zbMath1306.68147OpenAlexW2133570754MaRDI QIDQ4933320

Clark Barrett, Dejan Jovanović

Publication date: 12 October 2010

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16242-8_29

Mathematics Subject Classification ID

Logic in computer science (03B70) Mechanization of proofs and logical operations (03B35)

Related Items (15)

Sharing Is Caring: Combination of Theories ⋮ Satisfiability Modulo Theories ⋮ A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited ⋮ Reasoning about vectors: satisfiability modulo a theory of sequences ⋮ Combining stable infiniteness and (strong) politeness ⋮ A Rewriting Approach to the Combination of Data Structures with Bridging Theories ⋮ Being careful about theory combination ⋮ Many-sorted equivalence of shiny and strongly polite theories ⋮ Unnamed Item ⋮ Politeness and combination methods for theories with bridging functions ⋮ A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT ⋮ Politeness and stable infiniteness: stronger together ⋮ Polite combination of algebraic datatypes ⋮ Politeness for the theory of algebraic datatypes ⋮ Reasoning about vectors using an SMT theory of sequences

This page was built for publication: Polite Theories Revisited