Revisiting the Equivalence of Shininess and Politeness

DOI10.1007/978-3-642-45221-5_15zbMath1433.03021OpenAlexW103385263MaRDI QIDQ2870128

Filipe Casal, João Rasga

Publication date: 17 January 2014

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-45221-5_15

zbMATH Keywords

combination of satisfiability proceduresNelson-Oppen methodpolite theoriesshiny theoriesstrongly polite theories

Mathematics Subject Classification ID

Logic in computer science (03B70) Mechanization of proofs and logical operations (03B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Combining stable infiniteness and (strong) politeness ⋮ Many-sorted equivalence of shiny and strongly polite theories ⋮ Politeness and stable infiniteness: stronger together

This page was built for publication: Revisiting the Equivalence of Shininess and Politeness