Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

19

CC
2004
Springer

favoriteEmaildiscussreport

122views System Software» more CC 2004»

An Automata-Theoretic Algorithm for Counting Solutions to Presburger Formulas

13 years 10 months ago

An Automata-Theoretic Algorithm for Counting Solutions to Presburger Formulas

Download ftp.cs.unc.edu

We present an algorithm for counting the number of integer solutions to selected free variables of a Presburger formula. We represent the Presburger formula as a deterministic ﬁnite automaton (DFA) whose accepting paths encode the standard binary representations of satisfying free variable values. We count the number of accepting paths in such a DFA to obtain the number of solutions without enumerating the actual solutions. We demonstrate our algorithm on a suite of eight problems to show that it is universal, robust, fast, and scalable.

Erin Parker, Siddhartha Chatterjee

Real-time Traffic

CC 2004 | Deterministic ﬁnite Automaton | Free Variable | Presburger Formula | Programming Languages |

claim paper

Related Content

» Counting Solutions to Presburger Formulas How and Why

» Memory optimization by counting points in integer transformations of parametric polytopes

» Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic

» A New Approach to Model Counting

» Computing the Density of States of Boolean Formulas

» Counting All DCJ Sorting Scenarios

» A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositio...

» Computational Complexity of Constraint Satisfaction

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	CC
Authors	Erin Parker, Siddhartha Chatterjee

Comments (0)