Polite Combination of Algebraic Datatypes

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

doi:10.1007/s10817-022-09625-3

Polite Combination of Algebraic Datatypes

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

Department of Computer Science

Bar-Ilan University

Research output: Contribution to journal › Article › 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 how it can be combined with other arbitrary disjoint theories using polite combination. The combination method uses a new, simple, and natural notion of additivity that enables deducing strong politeness from (weak) politeness.

Original language	English
Pages (from-to)	331-355
Number of pages	25
Journal	Journal of Automated Reasoning
Volume	66
Issue number	3
DOIs	https://doi.org/10.1007/s10817-022-09625-3
State	Published - Aug 2022

Keywords

Algebraic datatypes
Automated reasoning
Polite combination
Satisfiability Modulo Theories
Theory combination

All Science Journal Classification (ASJC) codes

Software
Computational Theory and Mathematics
Artificial Intelligence

Access to Document

10.1007/s10817-022-09625-3

Cite this

@article{9af4170494dd4dd694323ee564c40c5a,

title = "Polite Combination 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 how it can be combined with other arbitrary disjoint theories using polite combination. The combination method uses a new, simple, and natural notion of additivity that enables deducing strong politeness from (weak) politeness.",

keywords = "Algebraic datatypes, Automated reasoning, Polite combination, Satisfiability Modulo Theories, Theory combination",

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

note = "Publisher Copyright: {\textcopyright} 2022, The Author(s), under exclusive licence to Springer Nature B.V.",

year = "2022",

month = aug,

doi = "10.1007/s10817-022-09625-3",

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

volume = "66",

pages = "331--355",

journal = "Journal of Automated Reasoning",

issn = "0168-7433",

publisher = "Springer Netherlands",

number = "3",

}

TY - JOUR

T1 - Polite Combination of Algebraic Datatypes

AU - Sheng, Ying

AU - Zohar, Yoni

AU - Ringeissen, Christophe

AU - Lange, Jane

AU - Fontaine, Pascal

AU - Barrett, Clark

PY - 2022/8

Y1 - 2022/8

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 how it can be combined with other arbitrary disjoint theories using polite combination. 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 how it can be combined with other arbitrary disjoint theories using polite combination. The combination method uses a new, simple, and natural notion of additivity that enables deducing strong politeness from (weak) politeness.

KW - Algebraic datatypes

KW - Automated reasoning

KW - Polite combination

KW - Satisfiability Modulo Theories

KW - Theory combination

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

U2 - 10.1007/s10817-022-09625-3

DO - 10.1007/s10817-022-09625-3

M3 - مقالة

SN - 0168-7433

VL - 66

SP - 331

EP - 355

JO - Journal of Automated Reasoning

JF - Journal of Automated Reasoning

IS - 3

ER -

Polite Combination of Algebraic Datatypes

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this