Combining Combination Properties: An Analysis of Stable Infiniteness, Convexity, and Politeness

Guilherme V. Toledo; Yoni Zohar; Clark Barrett

doi:10.1007/978-3-031-38499-8_30

Combining Combination Properties: An Analysis of Stable Infiniteness, Convexity, and Politeness

Guilherme V. Toledo, Yoni Zohar, Clark Barrett

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

We make two contributions to the study of theory combination in satisfiability modulo theories. The first is a table of examples for the combinations of the most common model-theoretic properties in theory combination, namely stable infiniteness, smoothness, convexity, finite witnessability, and strong finite witnessability (and therefore politeness and strong politeness as well). All of our examples are sharp, in the sense that we also offer proofs that no theories are available within simpler signatures. This table significantly progresses the current understanding of the various properties and their interactions. The most remarkable example in this table is of a theory over a single sort that is polite but not strongly polite (the existence of such a theory was only known until now for two-sorted signatures). The second contribution is a new combination theorem showing that in order to apply polite theory combination, it is sufficient for one theory to be stably infinite and strongly finitely witnessable, thus showing that smoothness is not a critical property in this combination method. This result has the potential to greatly simplify the process of showing which theories can be used in polite combination, as showing stable infiniteness is considerably simpler than showing smoothness.

Original language	English
Title of host publication	Automated Deduction – CADE 29 - 29th International Conference on Automated Deduction, Proceedings
Editors	Brigitte Pientka, Cesare Tinelli
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	522-541
Number of pages	20
ISBN (Print)	9783031384981
DOIs	https://doi.org/10.1007/978-3-031-38499-8_30
State	Published - 2023
Event	Proceedings of the 29th International Conference on Automated Deduction, CADE-29 - Rome, Italy Duration: 1 Jul 2023 → 4 Jul 2023

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	14132 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	Proceedings of the 29th International Conference on Automated Deduction, CADE-29
Country/Territory	Italy
City	Rome
Period	1/07/23 → 4/07/23

Bibliographical note

Publisher Copyright:
© 2023, The Author(s).

Funding

Acknowledgment. I thank Alexander Bentkamp, Stephan Schulz, Mark Summer-field, Petar Vukmirović, and Uwe Waldmann for textual suggestions. This research has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant No. 713999, Matryoshka). This research has also received funding from the Netherlands Organization for Scientific Research (NWO) under the Vidi program (project No. 016.Vidi.189.037, Lean Forward). Partially funded by the Royal Society (International Exchanges, grant number IES\R2\212106) Over the years the work in this talk has been supported by the EPSRC, Leverhulme Trust, ERC, NSF, Cambridge Gates Foundation, Cambridge Trust. Research reported in this paper is partially funded by the EPSRC Fellowship ‘VeTSpec: Verified Trustworthy Software Specification’ (EP/R034567/1). Onderzoek – Vlaanderen (project G070521N) and by the EU ICT-48 2020 project TAILOR (GA 952215). Jakob Nordström was supported by the Swedish Research Council grant 2016-00782 and the Independent Research Fund Denmark grant 9040-00389B. Andy Oertel was supported by the Wallenberg AI, Autonomous Systems and Software Program (WASP) funded by the Knut and Alice Wallenberg Foundation. Acknowledgment. Thanks to the reviewers for their extensive constructive feedback and to Diego Olivier Fernandez Pons for introducing us to MIP pre-solving. The research was partially funded by the Austrian Science Fund (FWF) under project No. T-1306. Acknowledgments. We thank the reviewers for their helpful comments. The research reported here was funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – Projektnummer 465447331. Funded by the European Union (ERC, ExtenDD, project number: 101054714). Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council. Neither the European Union nor the granting authority can be held responsible for them. Jeremias Berg was fully supported by the Academy of Finland under grant 342145. Bart Bogaerts and Dieter Vandesande were supported by Fonds Wetenschappelijk Acknowledgements. This work was partially supported by the National Natural Acknowledgments. This work has been supported by the Czech Ministry of Education, Youth and Sports ERC.CZ project LL1908, and the FIT BUT internal project FIT-S-20-6427. Supported by JSPS KAKENHI Grant Number JP22K11900. Acknowledgments. This work was funded in part by NSF-BSF grant 2110397 (NSF) and 2020704 (BSF) and ISF grant number 619/21. Acknowledgements. This work has been partially funded by the Swedish Research Council (VR) under grant 2018-04727, the Swedish Foundation for Strategic Research (SSF) under the project WebSec (Ref. RIT17-0011), the Wallenberg project UPDATE, and the NSTC QC project under Grant no. NSTC 111-2119-M-001-004-and 112-2119-M-001-006-. Acknowledgements. This work is the result of a research internship hosted at TU Wien and defended at the University of Liège. The authors would like to thank Pascal Fontaine for valuable discussions and comments. We acknowledge funding from the ERC Consolidator Grant ARTIST 101002685 and the FWF SFB project SpyCoDe F8504. Acknowledgments. This project was funded in part by the Deutsche Forschungs-gemeinschaft (DFG) – 378803395 (ConVeY), an Alexander von Humboldt Professorship, and by the AFOSR under grant number FA9550-16-1-0288. Funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) -235950644 (Project GI 274/6-2).

Funders	Funder number
Cambridge Gates Foundation
Czech Ministry of Education, Youth and Sports ERC.CZ	FIT-S-20-6427, LL1908
ExtenDD	101054714
Fonds Wetenschappelijk
NSF-BSF	2020704, 2110397
National Science Foundation
Air Force Office of Scientific Research	FA9550-16-1-0288
Alexander von Humboldt-Stiftung
Horizon 2020 Framework Programme	713999
Engineering and Physical Sciences Research Council	EP/R034567/1
Leverhulme Trust
Royal Society	IES\R2\212106
European Commission
European Commission	ARTIST 101002685
Deutsche Forschungsgemeinschaft	GI 274/6-2, 378803395, 465447331
Japan Society for the Promotion of Science	JP22K11900
Stiftelsen för Strategisk Forskning	RIT17-0011, NSTC 111-2119-M-001-004-and 112-2119-M-001-006
United States-Israel Binational Science Foundation
National Natural Science Foundation of China	62002351, 62032024
Academy of Finland	342145
Austrian Science Fund	F8504, T-1306
Nederlandse Organisatie voor Wetenschappelijk Onderzoek	016
Israel Science Foundation	619/21
Knut och Alice Wallenbergs Stiftelse
Vetenskapsrådet	2018-04727, 2016-00782
Danmarks Frie Forskningsfond	9040-00389B

Keywords

Satisfiability modulo theories
Theory combination
Theory politeness

Access to Document

10.1007/978-3-031-38499-8_30

Cite this

Toledo, G. V., Zohar, Y., & Barrett, C. (2023). Combining Combination Properties: An Analysis of Stable Infiniteness, Convexity, and Politeness. In B. Pientka, & C. Tinelli (Eds.), Automated Deduction – CADE 29 - 29th International Conference on Automated Deduction, Proceedings (pp. 522-541). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14132 LNAI). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-38499-8_30

Toledo, Guilherme V. ; Zohar, Yoni ; Barrett, Clark. / Combining Combination Properties : An Analysis of Stable Infiniteness, Convexity, and Politeness. Automated Deduction – CADE 29 - 29th International Conference on Automated Deduction, Proceedings. editor / Brigitte Pientka ; Cesare Tinelli. Springer Science and Business Media Deutschland GmbH, 2023. pp. 522-541 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{472355ed5966422cb224c656f26bdf32,

title = "Combining Combination Properties: An Analysis of Stable Infiniteness, Convexity, and Politeness",

abstract = "We make two contributions to the study of theory combination in satisfiability modulo theories. The first is a table of examples for the combinations of the most common model-theoretic properties in theory combination, namely stable infiniteness, smoothness, convexity, finite witnessability, and strong finite witnessability (and therefore politeness and strong politeness as well). All of our examples are sharp, in the sense that we also offer proofs that no theories are available within simpler signatures. This table significantly progresses the current understanding of the various properties and their interactions. The most remarkable example in this table is of a theory over a single sort that is polite but not strongly polite (the existence of such a theory was only known until now for two-sorted signatures). The second contribution is a new combination theorem showing that in order to apply polite theory combination, it is sufficient for one theory to be stably infinite and strongly finitely witnessable, thus showing that smoothness is not a critical property in this combination method. This result has the potential to greatly simplify the process of showing which theories can be used in polite combination, as showing stable infiniteness is considerably simpler than showing smoothness.",

keywords = "Satisfiability modulo theories, Theory combination, Theory politeness",

author = "Toledo, {Guilherme V.} and Yoni Zohar and Clark Barrett",

note = "Publisher Copyright: {\textcopyright} 2023, The Author(s).; Proceedings of the 29th International Conference on Automated Deduction, CADE-29 ; Conference date: 01-07-2023 Through 04-07-2023",

year = "2023",

doi = "10.1007/978-3-031-38499-8_30",

language = "אנגלית",

isbn = "9783031384981",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "522--541",

editor = "Brigitte Pientka and Cesare Tinelli",

booktitle = "Automated Deduction – CADE 29 - 29th International Conference on Automated Deduction, Proceedings",

address = "גרמניה",

}

Toledo, GV, Zohar, Y & Barrett, C 2023, Combining Combination Properties: An Analysis of Stable Infiniteness, Convexity, and Politeness. in B Pientka & C Tinelli (eds), Automated Deduction – CADE 29 - 29th International Conference on Automated Deduction, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 14132 LNAI, Springer Science and Business Media Deutschland GmbH, pp. 522-541, Proceedings of the 29th International Conference on Automated Deduction, CADE-29, Rome, Italy, 1/07/23. https://doi.org/10.1007/978-3-031-38499-8_30

Combining Combination Properties: An Analysis of Stable Infiniteness, Convexity, and Politeness. / Toledo, Guilherme V.; Zohar, Yoni; Barrett, Clark.
Automated Deduction – CADE 29 - 29th International Conference on Automated Deduction, Proceedings. ed. / Brigitte Pientka; Cesare Tinelli. Springer Science and Business Media Deutschland GmbH, 2023. p. 522-541 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14132 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Combining Combination Properties

T2 - Proceedings of the 29th International Conference on Automated Deduction, CADE-29

AU - Toledo, Guilherme V.

AU - Zohar, Yoni

AU - Barrett, Clark

PY - 2023

Y1 - 2023

N2 - We make two contributions to the study of theory combination in satisfiability modulo theories. The first is a table of examples for the combinations of the most common model-theoretic properties in theory combination, namely stable infiniteness, smoothness, convexity, finite witnessability, and strong finite witnessability (and therefore politeness and strong politeness as well). All of our examples are sharp, in the sense that we also offer proofs that no theories are available within simpler signatures. This table significantly progresses the current understanding of the various properties and their interactions. The most remarkable example in this table is of a theory over a single sort that is polite but not strongly polite (the existence of such a theory was only known until now for two-sorted signatures). The second contribution is a new combination theorem showing that in order to apply polite theory combination, it is sufficient for one theory to be stably infinite and strongly finitely witnessable, thus showing that smoothness is not a critical property in this combination method. This result has the potential to greatly simplify the process of showing which theories can be used in polite combination, as showing stable infiniteness is considerably simpler than showing smoothness.

AB - We make two contributions to the study of theory combination in satisfiability modulo theories. The first is a table of examples for the combinations of the most common model-theoretic properties in theory combination, namely stable infiniteness, smoothness, convexity, finite witnessability, and strong finite witnessability (and therefore politeness and strong politeness as well). All of our examples are sharp, in the sense that we also offer proofs that no theories are available within simpler signatures. This table significantly progresses the current understanding of the various properties and their interactions. The most remarkable example in this table is of a theory over a single sort that is polite but not strongly polite (the existence of such a theory was only known until now for two-sorted signatures). The second contribution is a new combination theorem showing that in order to apply polite theory combination, it is sufficient for one theory to be stably infinite and strongly finitely witnessable, thus showing that smoothness is not a critical property in this combination method. This result has the potential to greatly simplify the process of showing which theories can be used in polite combination, as showing stable infiniteness is considerably simpler than showing smoothness.

KW - Satisfiability modulo theories

KW - Theory combination

KW - Theory politeness

UR - http://www.scopus.com/inward/record.url?scp=85172226438&partnerID=8YFLogxK

U2 - 10.1007/978-3-031-38499-8_30

DO - 10.1007/978-3-031-38499-8_30

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85172226438

SN - 9783031384981

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 522

EP - 541

BT - Automated Deduction – CADE 29 - 29th International Conference on Automated Deduction, Proceedings

A2 - Pientka, Brigitte

A2 - Tinelli, Cesare

PB - Springer Science and Business Media Deutschland GmbH

Y2 - 1 July 2023 through 4 July 2023

ER -

Toledo GV, Zohar Y, Barrett C. Combining Combination Properties: An Analysis of Stable Infiniteness, Convexity, and Politeness. In Pientka B, Tinelli C, editors, Automated Deduction – CADE 29 - 29th International Conference on Automated Deduction, Proceedings. Springer Science and Business Media Deutschland GmbH. 2023. p. 522-541. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-38499-8_30