View in EDS

Combining Combination Properties, Part I: Nelson-Oppen and Politeness.

Saved in:
Bibliographic Details
Title: Combining Combination Properties, Part I: Nelson-Oppen and Politeness.
Authors: Toledo, Guilherme V.1 (AUTHOR) guivtoledo@gmail.com, Zohar, Yoni1 (AUTHOR) yoni206@gmail.com, Barrett, Clark2 (AUTHOR) barrett@cs.stanford.edu
Source: Journal of Automated Reasoning. Jun2026, Vol. 70 Issue 1, p1-60. 60p.
Subjects: Model theory, Satisfiability (Computer science), Boolean functions
Abstract: This is the first part of an analysis of the interplay between multiple properties that are related to combination methodologies for theories in the field of satisfiability modulo theories. We here focus on Nelson-Oppen and polite theory combinations, leading to a total of five model-theoretic properties to be considered: stable infiniteness, smoothness, finite witnessability, strong finite witnessability, and convexity. Our first result is an improvement on polite theory combination, showing that it is possible when only assuming stable infiniteness and strong finite witnessability, and thus implying smoothness is not a prerequisite for this method. Second, we provide examples of Boolean combinations of the aforementioned 5 properties whenever they are possible (e.g., a theory that admits all the properties, a theory that admits none, etc.), sharp in the sense that no theories within simpler signatures may exhibit the exact same properties, and prove which combinations cannot occur. Among these examples, the most surprising one is that of a polite yet not strongly polite theory in one sort, a combination whose previous example in the literature was two-sorted. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Automated Reasoning is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 190436624
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Combining Combination Properties, Part I: Nelson-Oppen and Politeness.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Toledo%2C+Guilherme+V%2E%22">Toledo, Guilherme V.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> guivtoledo@gmail.com</i><br /><searchLink fieldCode="AR" term="%22Zohar%2C+Yoni%22">Zohar, Yoni</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> yoni206@gmail.com</i><br /><searchLink fieldCode="AR" term="%22Barrett%2C+Clark%22">Barrett, Clark</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> barrett@cs.stanford.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Automated+Reasoning%22">Journal of Automated Reasoning</searchLink>. Jun2026, Vol. 70 Issue 1, p1-60. 60p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Model+theory%22">Model theory</searchLink><br /><searchLink fieldCode="DE" term="%22Satisfiability+%28Computer+science%29%22">Satisfiability (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Boolean+functions%22">Boolean functions</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This is the first part of an analysis of the interplay between multiple properties that are related to combination methodologies for theories in the field of satisfiability modulo theories. We here focus on Nelson-Oppen and polite theory combinations, leading to a total of five model-theoretic properties to be considered: stable infiniteness, smoothness, finite witnessability, strong finite witnessability, and convexity. Our first result is an improvement on polite theory combination, showing that it is possible when only assuming stable infiniteness and strong finite witnessability, and thus implying smoothness is not a prerequisite for this method. Second, we provide examples of Boolean combinations of the aforementioned 5 properties whenever they are possible (e.g., a theory that admits all the properties, a theory that admits none, etc.), sharp in the sense that no theories within simpler signatures may exhibit the exact same properties, and prove which combinations cannot occur. Among these examples, the most surprising one is that of a polite yet not strongly polite theory in one sort, a combination whose previous example in the literature was two-sorted. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Automated Reasoning is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=190436624
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10817-025-09746-5
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 60
        StartPage: 1
    Subjects:
      – SubjectFull: Model theory
        Type: general
      – SubjectFull: Satisfiability (Computer science)
        Type: general
      – SubjectFull: Boolean functions
        Type: general
    Titles:
      – TitleFull: Combining Combination Properties, Part I: Nelson-Oppen and Politeness.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Toledo, Guilherme V.
      – PersonEntity:
          Name:
            NameFull: Zohar, Yoni
      – PersonEntity:
          Name:
            NameFull: Barrett, Clark
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 06
              Text: Jun2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 01687433
          Numbering:
            – Type: volume
              Value: 70
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Journal of Automated Reasoning
              Type: main
ResultId 1