Symbolic WS1S

8 pages•Published: December 18, 2015

Abstract

We extend weak monadic second-order logic of one successor (WS1S) to symbolic alphabets by
allowing character predicates to range over decidable first order theories and not just finite alphabets.
We call this extension symbolic WS1S (s-WS1S). We then propose two decision procedures for such a
logic: 1) we use symbolic automata to extend the classic reduction from WS1S to finite automata to
our symbolic logic setting; 2) we show that every s-WS1S formula can be reduced to a WS1S formula
that preserves satisfiability, at the price of an exponential blow-up.

Keyphrases: mso, smt, symbolic automata

In: Ansgar Fehnker, Annabelle McIver, Geoff Sutcliffe and Andrei Voronkov (editors). LPAR-20. 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning - Short Presentations, vol 35, pages 59-66.

Links:	https://easychair.org/publications/paper/hHv
	https://doi.org/10.29007/t28j

BibTeX entry

@inproceedings{LPAR-20:Symbolic_WS1S,
  author    = {Loris D'Antoni and Margus Veanes},
  title     = {Symbolic WS1S},
  booktitle = {LPAR-20. 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning - Short Presentations},
  editor    = {Ansgar Fehnker and Annabelle McIver and Geoff Sutcliffe and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {35},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/hHv},
  doi       = {10.29007/t28j},
  pages     = {59-66},
  year      = {2015}}

Download PDF Open PDF in browser