Monadic Decomposition-Reference-Cited by-同舟云学术

Monadic Decomposition

Published:2017-06-02 Issue:2 Volume:64 Page:1-28
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Veanes Margus¹,Bjørner Nikolaj¹,Nachmanson Lev¹,Bereg Sergey²

Affiliation:

1. Microsoft Research, Redmond, WA, USA

2. The University of Texas at Dallas, Richardson, TX, USA

Abstract

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/3040488

Reference73 articles.

1. Modal Languages and Bounded Fragments of Predicate Logic

2. Normal Form Transformations

3. Definable relations and first-order query languages over strings

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Ramsey Quantifiers in Linear Arithmetics;Proceedings of the ACM on Programming Languages;2024-01-05

2. Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02

3. Quantifier elimination for counting extensions of Presburger arithmetic;Lecture Notes in Computer Science;2022

4. Learning Union of Integer Hypercubes with Queries;Computer Aided Verification;2021

5. Monadic Decomposition in Integer Linear Arithmetic;Automated Reasoning;2020