ML Anthology

Politeness for the Theory of Algebraic Datatypes (Extended Abstract)

Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark W. Barrett
IJCAI 2021 pp. 4829-4833
doi:10.24963/IJCAI.2021/660 /ijcai/2021/sheng2021ijcai-politeness/

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.

PDF IJCAI Semantic Scholar

Cite

Text

Sheng et al. "Politeness for the Theory of Algebraic Datatypes (Extended Abstract)." International Joint Conference on Artificial Intelligence, 2021. doi:10.24963/IJCAI.2021/660

Markdown

[Sheng et al. "Politeness for the Theory of Algebraic Datatypes (Extended Abstract)." International Joint Conference on Artificial Intelligence, 2021.](https://mlanthology.org/ijcai/2021/sheng2021ijcai-politeness/) doi:10.24963/IJCAI.2021/660

BibTeX

@inproceedings{sheng2021ijcai-politeness,
  title     = {{Politeness for the Theory of Algebraic Datatypes (Extended Abstract)}},
  author    = {Sheng, Ying and Zohar, Yoni and Ringeissen, Christophe and Lange, Jane and Fontaine, Pascal and Barrett, Clark W.},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2021},
  pages     = {4829-4833},
  doi       = {10.24963/IJCAI.2021/660},
  url       = {https://mlanthology.org/ijcai/2021/sheng2021ijcai-politeness/}
}