Monadic Decomposition

Monadic Decomposition

Monadic predicates play a prominent role in many decidable cases, including decision procedures for symbolic automata. We are here interested in discovering whether a formula can be rewritten into a Boolean combination of monadic predicates. Our setting is quantifier-free formulas whose satisfiabili...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of the ACM 2017-06, Vol.64 (2), p.1-28
Hauptverfasser: Veanes, Margus, Bjørner, Nikolaj, Nachmanson, Lev, Bereg, Sergey
Format: Artikel
Sprache:eng
Schlagworte:
Boolean algebra
Decision making
Decomposition
Linear programming
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Monadic predicates play a prominent role in many decidable cases, including decision procedures for symbolic automata. We are here interested in discovering whether a formula can be rewritten into a Boolean combination of monadic predicates. Our setting is quantifier-free formulas whose satisfiability is decidable, such as linear arithmetic. Here we develop a semidecision procedure for extracting a monadic decomposition of a formula when it exists.
ISSN:0004-5411
1557-735X
DOI:10.1145/3040488