Combining Sets with Integers

机译：用整数组合集

获取原文

获取外文期刊封面目录资料

页面导航

摘要
著录项
引文网络
相似文献
相关主题

摘要

We present a decision procedure for a constraint language combining stratified sets of ur-elements with integers in the presence of a cardinality operator. Our decision procedure is an extension of the Nelson-Oppen combination method specifically tailored to the combination domain of sets, integers, and ur-elements.

机译：我们在基数运算符在存在的情况下，为一个约束语言与整数组合的约束语言组合的决策过程。我们的决策程序是纳尔逊对比组合方法的扩展，专门针对集合，整数和UR元素的组合域来定制。

著录项

来源
《International Conference on Frontiers of Combining Systems》|2002年||共14页
会议地点
作者
Calogero G. Zarba;
展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种
中图分类 TP18-53;
关键词

相似文献

外文文献
中文文献
专利

1. A conjecture on integer arithmetic which implies that there is an algorithm which to each Diophantine equation assigns an integer which is greater than the heights of integer (non-negative integer, rational) solutions, if these solutions form a finite set [J] . K. A. Germina, R. Sebastian International mathematical forum . 2013,第1a4期

机译：关于整数算术的猜想，这意味着有一个算法可以为每个Diophantine方程分配一个整数，该整数要大于整数（非负整数，有理数）解的高度（如果这些解形成有限集）
2. A conjecture on integer arithmetic which implies that there is an algorithm which to each Diophantine equation assigns an integer which is greater than the heights of integer (non-negative integer, rational) solutions, if these solutions form a finite set [J] . K. A. Germina, R. Sebastian International mathematical forum . 2013,第1a4期

机译：关于整数算术的猜想，这意味着有一个算法可以为每个Diophantine方程分配一个整数，该整数要大于整数（非负整数，有理数）解的高度（如果这些解形成有限集）
3. Combined half-integer Bessel-like beams: A set of solutions of the wave equation [J] . Davud Hebri, Saifollah Rasouli Physical Review, A . 2018,第4aPta2期

机译：组合半整数贝塞尔的光束：波浪方程的一组解
4. Combining Sets with Integers [C] . Calogero G. Zarba International Conference on Frontiers of Combining Systems . 2002

机译：用整数组合集
5. Integer Programming Formulation for Contention Aware Connected Dominating Set in Wireless Multi-Hop Network [D] . Nawrin Ferdous, Chowdhury. 2020

机译：整数编程配方，用于争用为无线多跳网络中的主导主导集合
6. On Sets of Integers Which Contain No Three Terms in Arithmetical Progression [O] . F. A. Behrend 1946

机译：关于在算术级数中不包含三项的整数集
7. Is there an algorithm which takes as input a Diophantine equation, returns an integer, and this integer is greater than the number of integer solutions, if the solution set is finite? [O] . Tyszka, Apoloniusz 2014

机译：是否存在一个算法，将Diophantine方程作为输入，返回一个整数，该整数大于整数解决方案，如果解决方案集是有限的？
8. Inequalities for the Number of Integers in the Sum of Sets of Positive Integers. [R] . Warren, R. H. 1974

机译：正整数集合中整数个数的不等式。

Combining Sets with Integers

摘要

著录项

引文网络

相似文献

相关主题

期刊订阅