9 search results - page 1 / 2 » An Automata-Theoretic Algorithm for Counting Solutions to Pr... |
CC
2004
Springer
13 years 10 months ago
2004
Springer
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 fin...
PLDI
1994
ACM
13 years 9 months ago
1994
ACM
CASES
2006
ACM
13 years 11 months ago
2006
ACM
Memory size reduction and memory accesses optimization are crucial issues for embedded systems. In the context of affine programs, these two challenges are classically tackled by ...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
SAT
2005
Springer
13 years 10 months ago
2005
Springer
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...