Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleAugust 2022
Geometric decision procedures and the VC dimension of linear arithmetic theories
LICS '22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer ScienceArticle No.: 59, Pages 1–13https://doi.org/10.1145/3531130.3533372This paper resolves two open problems on linear integer arithmetic (LIA), also known as Presburger arithmetic. First, we give a triply exponential geometric decision procedure for LIA, i.e., a procedure based on manipulating semilinear sets. This ...
- ArticleJune 2013
On the Context-Freeness Problem for Vector Addition Systems
LICS '13: Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer SciencePages 43–52https://doi.org/10.1109/LICS.2013.9Petri nets, or equivalently vector addition systems (VAS), are widely recognized as a central model for concurrent systems. Many interesting properties are decidable for this class, such as bounded ness, reach ability, regularity, as well as context-...
- ArticleMay 2010
On the expressive power of FO[+]
LATA'10: Proceedings of the 4th international conference on Language and Automata Theory and ApplicationsPages 190–201https://doi.org/10.1007/978-3-642-13089-2_16The characterization of the class of FO[+]-definable languages by some generating or recognizing device is still an open problem. We prove that, restricted to bounded languages, this class coincides with the class of semilinear languages. We also study ...
- articleOctober 2006
The complexity of semilinear problems in succinct representation
Computational Complexity (COCO), Volume 15, Issue 3Pages 197–235https://doi.org/10.1007/s00037-006-0213-6We prove completeness results for twenty-three problems in semilinear geometry. These results involve semilinear sets given by additive circuits as input data. If arbitrary real constants are allowed in the circuit, the completeness results are for the ...
- ArticleJuly 2006
Stably computable predicates are semilinear
PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computingPages 292–299https://doi.org/10.1145/1146381.1146425We consider the model of population protocols introduced by Angluin et al. [2], in which anonymous finite-state agents stably compute a predicate of their inputs via two-way interactions in the all-pairs family of communication networks. We prove that ...