Politeness for the Theory of Algebraic Datatypes

Ying Sheng; Yoni Zohar; Christophe Ringeissen; Jane Lange; Pascal Fontaine; Clark Barrett

doi:https://doi.org/10.1007/978-3-030-51074-9_14

Politeness for the Theory of Algebraic Datatypes

Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark Barrett

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

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
Pages	238-255
Number of pages	18
DOIs	https://doi.org/10.1007/978-3-030-51074-9_14
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

Conference

Conference	10th International Joint Conference on Automated Reasoning, IJCAR 2020
City	Virtual, Online
Period	1/07/20 → 4/07/20

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

https://doi.org/10.1007/978-3-030-51074-9_14

Cite this

Sheng, Y., Zohar, Y., Ringeissen, C., Lange, J., Fontaine, P., & Barrett, C. (2020). Politeness for the Theory of Algebraic Datatypes. In N. Peltier, & V. Sofronie-Stokkermans (Eds.), Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Proceedings (pp. 238-255). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12166 LNAI). https://doi.org/10.1007/978-3-030-51074-9_14

Sheng, Ying ; Zohar, Yoni ; Ringeissen, Christophe et al. / Politeness for the Theory of Algebraic Datatypes. Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Proceedings. editor / Nicolas Peltier ; Viorica Sofronie-Stokkermans. 2020. pp. 238-255 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{57ccaf9f89064aa392afdcdad4000442,

title = "Politeness for the Theory of Algebraic Datatypes",

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.",

author = "Ying Sheng and Yoni Zohar and Christophe Ringeissen and Jane Lange and Pascal Fontaine and Clark Barrett",

note = "Publisher Copyright: {\textcopyright} 2020, Springer Nature Switzerland AG.; 10th International Joint Conference on Automated Reasoning, IJCAR 2020 ; Conference date: 01-07-2020 Through 04-07-2020",

year = "2020",

doi = "https://doi.org/10.1007/978-3-030-51074-9_14",

language = "الإنجليزيّة",

isbn = "9783030510732",

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

pages = "238--255",

editor = "Nicolas Peltier and Viorica Sofronie-Stokkermans",

booktitle = "Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Proceedings",

}

Sheng, Y, Zohar, Y, Ringeissen, C, Lange, J, Fontaine, P & Barrett, C 2020, Politeness for the Theory of Algebraic Datatypes. in N Peltier & V Sofronie-Stokkermans (eds), Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12166 LNAI, pp. 238-255, 10th International Joint Conference on Automated Reasoning, IJCAR 2020, Virtual, Online, 1/07/20. https://doi.org/10.1007/978-3-030-51074-9_14

Politeness for the Theory of Algebraic Datatypes. / Sheng, Ying; Zohar, Yoni; Ringeissen, Christophe et al.
Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Proceedings. ed. / Nicolas Peltier; Viorica Sofronie-Stokkermans. 2020. p. 238-255 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12166 LNAI).

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

TY - GEN

T1 - Politeness for the Theory of Algebraic Datatypes

AU - Sheng, Ying

AU - Zohar, Yoni

AU - Ringeissen, Christophe

AU - Lange, Jane

AU - Fontaine, Pascal

AU - Barrett, Clark

PY - 2020

Y1 - 2020

N2 - 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.

AB - 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.

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

U2 - https://doi.org/10.1007/978-3-030-51074-9_14

DO - https://doi.org/10.1007/978-3-030-51074-9_14

M3 - منشور من مؤتمر

SN - 9783030510732

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

SP - 238

EP - 255

BT - Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Proceedings

A2 - Peltier, Nicolas

A2 - Sofronie-Stokkermans, Viorica

T2 - 10th International Joint Conference on Automated Reasoning, IJCAR 2020

Y2 - 1 July 2020 through 4 July 2020

ER -

Sheng Y, Zohar Y, Ringeissen C, Lange J, Fontaine P, Barrett C. Politeness for the Theory of Algebraic Datatypes. In Peltier N, Sofronie-Stokkermans V, editors, Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Proceedings. 2020. p. 238-255. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: https://doi.org/10.1007/978-3-030-51074-9_14

Politeness for the Theory of Algebraic Datatypes

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this