Revisiting the Equivalence of Shininess and Politeness
The Nelson-Oppen method  allows the combination of satisfiability procedures of stably infinite theories with disjoint signatures. Due to its importance, several attempts to extend the method to different and wider classes of theories were made. In 2005, it was shown that shiny  and polite  theories could be combined with an arbitrary theory (the relationship between these classes was analysed in ). Later, a stronger notion of polite theory was proposed, see , in order to overcome a subtle issue with a proof in . In this paper, we analyse the relationship between shiny and strongly polite theories in the onesorted case. We show that a shiny theory with a decidable quantifier-free satisfiability problem is strongly polite and provide two different sufficient conditions for a strongly polite theory to be shiny. Based on these results, we derive a combination method for the union of a polite theory with an arbitrary theory.
KeywordsNelson-Oppen method combination of satisfiability procedures polite theories strongly polite theories shiny theories
Unable to display preview. Download preview PDF.
- 7.Tinelli, C., Harandi, M.T.: A new correctness proof of the Nelson-Oppen combination procedure. In: Proceedings of the First International Workshop on Frontiers of Combining Systems (FroCoS 1996). Applied Logic Series, vol. 3, pp. 103–119 (1996)Google Scholar
- 8.Tinelli, C., Harandi, M.T.: Constraint logic programming over unions of constraint theories. Journal of Functional and Logic Programming 1998(6) (1998)Google Scholar