Abstract
Algebraic datatypes, and among them lists and trees, have attracted a lot of interest in automated reasoning and Satisfiability Modulo Theories (SMT). Since its latest stable version, the SMT-LIB standard defines a theory of algebraic datatypes, which is currently supported by several mainstream SMT solvers. In this paper, we study this particular theory of datatypes and prove that it is strongly polite, showing also how it can be combined with other arbitrary disjoint theories using polite combination. Our results cover both inductive and finite datatypes, as well as their union. The combination method uses a new, simple, and natural notion of additivity, that enables deducing strong politeness from (weak) politeness.
Original language | English |
---|---|
Title of host publication | Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Proceedings |
Editors | Nicolas Peltier, Viorica Sofronie-Stokkermans |
Publisher | Springer |
Pages | 238-255 |
Number of pages | 18 |
ISBN (Print) | 9783030510732 |
DOIs | |
State | Published - 2020 |
Externally published | Yes |
Event | 10th International Joint Conference on Automated Reasoning, IJCAR 2020 - Virtual, Online Duration: 1 Jul 2020 → 4 Jul 2020 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 12166 LNAI |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 10th International Joint Conference on Automated Reasoning, IJCAR 2020 |
---|---|
City | Virtual, Online |
Period | 1/07/20 → 4/07/20 |
Bibliographical note
Publisher Copyright:© 2020, Springer Nature Switzerland AG.