Some classes of sets of vectors of natural numbers are introduced as generalizations of the semi-linear sets, among them the 'simple semi-polynomial sets.' Motivated by verification problems that involve arithmetical constraints, we show results on the intersection of such generalized sets with semi-linear sets, singling out cases where the non-emptiness of intersection is decidable. Starting from these initial results, we list some problems on solvability of arithmetical constraints beyond the semi-linear ones. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Karianto, W., Krieg, A., & Thomas, W. (2006). On intersection problems for polynomially generated sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4052 LNCS, pp. 516–527). Springer Verlag. https://doi.org/10.1007/11787006_44
Mendeley helps you to discover research relevant for your work.