Presburger arithmetic

Known as: Presberger arithmetic, Pressburger arithmetic 
Presburger arithmetic is the first-order theory of the natural numbers with addition, named in honor of Mojżesz Presburger, who introduced it in 1929… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1973-2018
010203019732018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Craig interpolation has become a key ingredient in many symbolic model checkers, serving as an approximative replacement for… (More)
  • table 1
Is this relevant?
2006
2006
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines Boolean algebras of sets of… (More)
  • figure 8
  • figure 13
  • figure 12
Is this relevant?
2004
2004
ion-based Satisfiability Solving of Presburger Arithmetic Daniel Kroening, Joël Ouaknine Sanjit Seshia, Ofer Strichman 
  • figure 2
  • table 1
Is this relevant?
2004
2004
Automata provide an effective mechanization of decision procedures for Presburger arithmetic. However, only crude lower and upper… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We consider automata with counters whose values are updated according to signals sent by the environment. A transition can be red… (More)
  • figure 2
  • figure 3
  • figure 13
  • figure 15
  • figure 19
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We present a new symbolic model checker which conservatively evaluates safety and liveness properties on innnite-state programs… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We show that the use of nite automata provides a decision procedure for Presburger Arithmetic with optimal worst case complexity. 
Is this relevant?
Highly Cited
1995
Highly Cited
1995
This paper introduces a finite-automata based representation of Presburger arithmetic definable sets of integer vectors. The… (More)
  • figure 2
Is this relevant?
Highly Cited
1978
Highly Cited
1978
This paper concerns both the complexity aspects of PA and the pragmatics of improving algorithms for dealing with restricted… (More)
Is this relevant?
1973
1973
We consider the first-order theory whose language has as nonlogical symbols the constant symbols 0 and 1, the binary relation… (More)
Is this relevant?