Axiomatizations and Computability of Weighted Monadic Second-Order Logic

Weighted monadic second-order logic is a weighted extension of monadic second-order logic that captures exactly the behaviour of weighted automata. Its semantics is parameterized with respect to a semiring on which the values that weighted formulas output are evaluated. Gastin and Monmege (2018) gav...

Full description

Bibliographic Details

Published in:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 1 - 13
Main Authors:	Achilleos, Antonis, Pedersen, Mathias Ruggaard
Format:	Conference Proceeding
Language:	English
Published:	IEEE 29.06.2021
Subjects:	Automata axiomatization Complexity theory Computer science Model checking monadic second-order logic satisfiability Semantics Syntactics weighted automata weighted logic
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!