Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

27 relations
AlgorithmAnalysis of algorithmsAutomated reasoningAutomated theorem proving

Broader (1)

Logic in computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures
2008
2008
A Characterisation of the Relations Definable in Presburger Arithmetic
Four sub-recursive classes of functions, B, D, BD and BDD are defined, and compared to the classes G0, G1 and G2, originally… 
2008
2008
Craig Interpolation for Quantifier-Free Presburger Arithmetic
Craig interpolation has become a versatile algorithmic tool for improving software verification. Interpolants can, for instance… 
2007
2007
Generic Complexity of Presburger Arithmetic
Fischer and Rabin proved in (Proceedings of the SIAM-AMS Symposium in Applied Mathematics, vol. 7, pp. 27–41, 1974) that the… 
Highly Cited
2005
Highly Cited
2005
LusSy: a toolbox for the analysis of systems-on-a-chip at the transactional level
We describe a toolbox for the analysis of systems-on-a-chip described in SystemC at the transactional level. The tools are able… 
2003
2003
Generic Proof Synthesis for Presburger Arithmetic
We develop in detail a proof-producing implementation of Cooper’s decision procedure for Presburger arithmetic. The algorithm is… 
2000
2000
Petri Nets, Flat Languages and Linear Arithmetic
We present a method for characterizing the least xed-points of a certain class of Datalog programs in Presburger arithmetic. The… 
1984
1984
The Experience of Science
ing the general features that matter from the messy details that do not, and then solving the problem simply and once and for all… 
1966
1966
Automatic error analysis in finite digital computations, using range arithmetic.
1961
1961
Algorithm 66: Invrs
b e g i n p r o c e d u r e RANGESUM (a, b, c, d, e, f); rea l a , b , c , d , e , f ; c o m m e n t The term "range number" was… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)