Skip to main navigation Skip to search Skip to main content

Two Generalizations of Shininess

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Shininess is one of the main theory combination methods in Satisfiability Modulo Theories. We present two infinite families of generalizations of it: one involving a property between gentleness and shininess, which helps us see gentleness itself as a variation of shininess; and another having no further computability requirements on the weaker theory, in addition dropping the need for smoothness. We prove these methods sharp, and compare them with existing methods.

Original languageEnglish
Title of host publicationLogic, Language, Information, and Computation - 32nd International Workshop, WoLLIC 2026, Proceedings
EditorsPatricia Johann, Ruy de Queiroz
PublisherSpringer Science and Business Media Deutschland GmbH
Pages97-110
Number of pages14
ISBN (Print)9783032334855
DOIs
StatePublished - 2027
Event32nd International Workshop on Logic, Language, Information and Computation, WoLLIC 2026 - Lima, Peru
Duration: 3 Aug 20266 Aug 2026

Publication series

NameLecture Notes in Computer Science
Volume16757 LNCS

Conference

Conference32nd International Workshop on Logic, Language, Information and Computation, WoLLIC 2026
Country/TerritoryPeru
CityLima
Period3/08/266/08/26

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Two Generalizations of Shininess'. Together they form a unique fingerprint.

Cite this