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. Our proof uses a new, simple, and natural notion of additivity, that enables deducing strong politeness from (weak) politeness.
Original language | English |
---|---|
Title of host publication | Proceedings of the 30th International Joint Conference on Artificial Intelligence, IJCAI 2021 |
Editors | Zhi-Hua Zhou |
Publisher | International Joint Conferences on Artificial Intelligence |
Pages | 4829-4833 |
Number of pages | 5 |
ISBN (Electronic) | 9780999241196 |
DOIs | |
State | Published - 2021 |
Event | 30th International Joint Conference on Artificial Intelligence, IJCAI 2021 - Virtual, Online, Canada Duration: 19 Aug 2021 → 27 Aug 2021 |
Publication series
Name | IJCAI International Joint Conference on Artificial Intelligence |
---|---|
ISSN (Print) | 1045-0823 |
Conference
Conference | 30th International Joint Conference on Artificial Intelligence, IJCAI 2021 |
---|---|
Country/Territory | Canada |
City | Virtual, Online |
Period | 19/08/21 → 27/08/21 |
Bibliographical note
Publisher Copyright:© 2021 International Joint Conferences on Artificial Intelligence. All rights reserved.