The computational complexity of the decision procedures for Presburger arithmetic /
This work studies the computational complexity of the decision procedures for Presburger Arithmetic (PA) and specific subclasses of this logical theory. Lower bound and upper bound results for unrestricted PA and for subclasses, defined by restricting the quantifier prefix, are surveyed. $PA sb{m}$,...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
McGill University
1993
|
| Subjects: | |
| Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=69589 |