Download PDFOpen PDF in browser

Combining Combination Properties: Minimal Models

17 pagesPublished: May 26, 2024

Abstract

This is a part of an ongoing research project, with the aim of finding the connections between properties related to theory combination in Satisfiability Modulo Theories. In pre- vious work, 7 properties were analyzed: convexity, stable infiniteness, smoothness, finite witnessability, strong finite witnessability, the finite model property, and stable finiteness. The first two properties are related to Nelson-Oppen combination, the third and fourth to polite combination, the fifth to strong politeness, and the last two to shininess. However, the remaining key property of shiny theories, namely, the ability to compute the cardinal- ities of minimal models, was not yet analyzed. In this paper we study this property and its connection to the others.

Keyphrases: Satisfiability Modulo Theories, theory combination, Theory Politeness

In: Nikolaj Bjorner, Marijn Heule and Andrei Voronkov (editors). Proceedings of 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 100, pages 19--35

Links:
BibTeX entry
@inproceedings{LPAR2024:Combining_Combination_Properties_Minimal,
  author    = {Guilherme V. Toledo and Yoni Zohar},
  title     = {Combining Combination Properties: Minimal Models},
  booktitle = {Proceedings of 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  editor    = {Nikolaj Bj\{\textbackslash{}o\}rner and Marijn Heule and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {100},
  pages     = {19--35},
  year      = {2024},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/9KKC},
  doi       = {10.29007/6qkh}}
Download PDFOpen PDF in browser