Politeness for the Theory of Algebraic Datatypes (Extended Abstract)

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

doi:10.24963/ijcai.2021/58

Politeness for the Theory of Algebraic Datatypes (Extended Abstract)

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

Department of Computer Science

Bar-Ilan University

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. 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
Pages	4829-4833
Number of pages	5
ISBN (Electronic)	9780999241196
DOIs	https://doi.org/10.24963/ijcai.2021/58
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

Conference

Conference	30th International Joint Conference on Artificial Intelligence, IJCAI 2021
Country/Territory	Canada
City	Virtual, Online
Period	19/08/21 → 27/08/21

All Science Journal Classification (ASJC) codes

Artificial Intelligence

Access to Document

10.24963/ijcai.2021/58

Cite this

Sheng, Y., Zohar, Y., Ringeissen, C., Lange, J., Fontaine, P., & Barrett, C. (2021). Politeness for the Theory of Algebraic Datatypes (Extended Abstract). In Z.-H. Zhou (Ed.), Proceedings of the 30th International Joint Conference on Artificial Intelligence, IJCAI 2021 (pp. 4829-4833). (IJCAI International Joint Conference on Artificial Intelligence). https://doi.org/10.24963/ijcai.2021/58

@inproceedings{a471e1ff349f489aa70b88a992684f8b,

title = "Politeness for the Theory of Algebraic Datatypes (Extended Abstract)",

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

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

note = "Publisher Copyright: {\textcopyright} 2021 International Joint Conferences on Artificial Intelligence. All rights reserved.; 30th International Joint Conference on Artificial Intelligence, IJCAI 2021 ; Conference date: 19-08-2021 Through 27-08-2021",

year = "2021",

doi = "10.24963/ijcai.2021/58",

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

series = "IJCAI International Joint Conference on Artificial Intelligence",

pages = "4829--4833",

editor = "Zhi-Hua Zhou",

booktitle = "Proceedings of the 30th International Joint Conference on Artificial Intelligence, IJCAI 2021",

}

Sheng, Y, Zohar, Y, Ringeissen, C, Lange, J, Fontaine, P & Barrett, C 2021, Politeness for the Theory of Algebraic Datatypes (Extended Abstract). in Z-H Zhou (ed.), Proceedings of the 30th International Joint Conference on Artificial Intelligence, IJCAI 2021. IJCAI International Joint Conference on Artificial Intelligence, pp. 4829-4833, 30th International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual, Online, Canada, 19/08/21. https://doi.org/10.24963/ijcai.2021/58

Politeness for the Theory of Algebraic Datatypes (Extended Abstract). / Sheng, Ying; Zohar, Yoni; Ringeissen, Christophe et al.
Proceedings of the 30th International Joint Conference on Artificial Intelligence, IJCAI 2021. ed. / Zhi-Hua Zhou. 2021. p. 4829-4833 (IJCAI International Joint Conference on Artificial Intelligence).

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

TY - GEN

T1 - Politeness for the Theory of Algebraic Datatypes (Extended Abstract)

AU - Sheng, Ying

AU - Zohar, Yoni

AU - Ringeissen, Christophe

AU - Lange, Jane

AU - Fontaine, Pascal

AU - Barrett, Clark

PY - 2021

Y1 - 2021

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. Our proof 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. Our proof 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=85125477814&partnerID=8YFLogxK

U2 - 10.24963/ijcai.2021/58

DO - 10.24963/ijcai.2021/58

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

T3 - IJCAI International Joint Conference on Artificial Intelligence

SP - 4829

EP - 4833

BT - Proceedings of the 30th International Joint Conference on Artificial Intelligence, IJCAI 2021

A2 - Zhou, Zhi-Hua

T2 - 30th International Joint Conference on Artificial Intelligence, IJCAI 2021

Y2 - 19 August 2021 through 27 August 2021

ER -

Politeness for the Theory of Algebraic Datatypes (Extended Abstract)

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this