article

Presburger arithmetic with unary predicates is P¹₁ complete

Author:

Joseph Y. HalpernAuthors Info & Claims

Journal of Symbolic Logic, Volume 56, Issue 2

Pages 637 - 642

https://doi.org/10.2307/2274706

Published: 01 October 1991 Publication History

Abstract

No abstract available.

Cited By

View all

Boigelot BFontaine PVergain B(2023)Universal First-Order Quantification over AutomataImplementation and Application of Automata10.1007/978-3-031-40247-0_6(91-102)Online publication date: 19-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-40247-0_6
Boigelot BFontaine PVergain B(2023)Decidability of Difference Logic over the Reals with Uninterpreted Unary PredicatesAutomated Deduction – CADE 2910.1007/978-3-031-38499-8_31(542-559)Online publication date: 1-Jul-2023
https://dl.acm.org/doi/10.1007/978-3-031-38499-8_31
Voigt M(2021)Decidable First-Order Fragments of Linear Rational Arithmetic with Uninterpreted PredicatesJournal of Automated Reasoning10.1007/s10817-020-09567-865:3(357-423)Online publication date: 1-Mar-2021
https://dl.acm.org/doi/10.1007/s10817-020-09567-8
Show More Cited By

Index Terms

Presburger arithmetic with unary predicates is P¹₁ complete
1. Computing methodologies
  1. Symbolic and algebraic manipulation
2. Theory of computation
  1. Logic
  2. Models of computation
    1. Computability

Recommendations

Bounds on the automata size for Presburger arithmetic

Automata provide a decision procedure for Presburger arithmetic. However, until now only crude lower and upper bounds were known on the sizes of the automata produced by the automata-based approach for Presburger arithmetic. In this article, we give an ...
On the use of non-deterministic automata for presburger arithmetic
CONCUR'10: Proceedings of the 21st international conference on Concurrency theory

A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithmetic based on quantifier elimination is known (roughly, there is a double-exponential ...
Optimal Simulations between Unary Automata

We consider the problem of computing the costs---{ in terms of states---of optimal simulations between different kinds of finite automata recognizing unary languages. Our main result is a tight simulation of unary n-state two-way nondeterministic ...

Comments

Information & Contributors

Information

Published In

Journal of Symbolic Logic Volume 56, Issue 2

June 1991

364 pages

ISSN:0022-4812

Issue’s Table of Contents

Publisher

Association for Symbolic Logic, Inc.

United States

Publication History

Published: 01 October 1991

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

28
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 02 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Boigelot BFontaine PVergain B(2023)Universal First-Order Quantification over AutomataImplementation and Application of Automata10.1007/978-3-031-40247-0_6(91-102)Online publication date: 19-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-40247-0_6
Boigelot BFontaine PVergain B(2023)Decidability of Difference Logic over the Reals with Uninterpreted Unary PredicatesAutomated Deduction – CADE 2910.1007/978-3-031-38499-8_31(542-559)Online publication date: 1-Jul-2023
https://dl.acm.org/doi/10.1007/978-3-031-38499-8_31
Voigt M(2021)Decidable First-Order Fragments of Linear Rational Arithmetic with Uninterpreted PredicatesJournal of Automated Reasoning10.1007/s10817-020-09567-865:3(357-423)Online publication date: 1-Mar-2021
https://dl.acm.org/doi/10.1007/s10817-020-09567-8
Badihi SAkinotcho FLi YRubin JDevanbu PCohen MZimmermann T(2020)ARDiff: scaling program equivalence checking via iterative abstraction and refinement of common codeProceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering10.1145/3368089.3409757(13-24)Online publication date: 8-Nov-2020
https://dl.acm.org/doi/10.1145/3368089.3409757
Gao CChen TWu Z(2019)Separation Logic with Linearly Compositional Inductive Predicates and Set Data ConstraintsSOFSEM 2019: Theory and Practice of Computer Science10.1007/978-3-030-10801-4_17(206-220)Online publication date: 27-Jan-2019
https://dl.acm.org/doi/10.1007/978-3-030-10801-4_17
Speranski S(2017)Notes on the Computational Aspects of Kripke's Theory of TruthStudia Logica10.1007/s11225-016-9694-8105:2(407-429)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1007/s11225-016-9694-8
Alberti FGhilardi SPagani E(2017)Cardinality constraints for arrays (decidability results and applications)Formal Methods in System Design10.1007/s10703-017-0279-651:3(545-574)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1007/s10703-017-0279-6
Alberti FGhilardi SPagani E(2016)Counting Constraints in Flat Array FragmentsProceedings of the 8th International Joint Conference on Automated Reasoning - Volume 970610.1007/978-3-319-40229-1_6(65-81)Online publication date: 27-Jun-2016
https://dl.acm.org/doi/10.1007/978-3-319-40229-1_6
Alberti FGhilardi SSharygina N(2015)Decision Procedures for Flat Array PropertiesJournal of Automated Reasoning10.1007/s10817-015-9323-754:4(327-352)Online publication date: 1-Apr-2015
https://dl.acm.org/doi/10.1007/s10817-015-9323-7
Alberti FGhilardi SSharygina N(2015)A New Acceleration-Based Combination Framework for Array PropertiesProceedings of the 10th International Symposium on Frontiers of Combining Systems - Volume 932210.1007/978-3-319-24246-0_11(169-185)Online publication date: 21-Sep-2015
https://dl.acm.org/doi/10.1007/978-3-319-24246-0_11
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Bounds on the automata size for Presburger arithmetic

On the use of non-deterministic automata for presburger arithmetic

Optimal Simulations between Unary Automata

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations