First-Order Queries on Finite Structures Over the Reals
SIAM Journal on Computing
Representing Arithmetic Constraints with Finite Automata: An Overview
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Automatic Presentations of Structures
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Presburger arithmetic with bounded quantifier alternation
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
An effective decision procedure for linear arithmetic over the integers and reals
ACM Transactions on Computational Logic (TOCL)
Theory of Computation (Texts in Computer Science)
Theory of Computation (Texts in Computer Science)
Bounds on the automata size for Presburger arithmetic
ACM Transactions on Computational Logic (TOCL)
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
LIRA: handling constraints of linear arithmetics over the integers and the reals
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Automatic structures of bounded degree revisited
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
| Hi-index | 0.00 |
The decision problem of various logical theories can be decided by automata-theoretic methods. Notable examples are Presburger arithmetic FO(Z,+,