Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

searching for Presburger arithmetic 5 found (43 total)

alternate case: presburger arithmetic

European Association for Theoretical Computer Science (535 words) [view diff] exact match in snippet view article find links to article

on decidability of the theory of addition (which today is called Presburger arithmetic) as a student in 1929. The complete list of the winners is given
Kleene Award (126 words) [view diff] case mismatch in snippet view article find links to article
"Successor-Invariance in the Finite" 2004 Felix Klaedtke "On the Automata Size for Presburger Arithmetic" 2005 Benjamin Rossman "Existential Positive Types and Preservation
Frameworks supporting the polyhedral model (2,887 words) [view diff] case mismatch in snippet view article find links to article
(the algorithms of the Omega Library handle the full language of Presburger Arithmetic, which is O(2^2^2^n)). Thus, it is clearly unrealistic to expect
Automatic parallelization tool (2,259 words) [view diff] case mismatch in snippet view article find links to article
Space Slicing and Free Schedule Framework. The core is based on the Presburger Arithmetic and the transitive closure operation. Loop dependencies are represented
Word equation (4,051 words) [view diff] case mismatch in snippet view article find links to article
"Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility". Logical Methods in Computer Science. 17 (4)