期刊文献+

A Survey on Algorithms for Computing Comprehensive Gröbner Systems and Comprehensive Gröbner Bases 被引量:3

原文传递
导出
摘要 Weispfenning in 1992 introduced the concepts of comprehensive Gr?bner system/basis of a parametric polynomial system, and he also presented an algorithm to compute them. Since then,this research ?eld has attracted much attention over the past several decades, and many effcient algorithms have been proposed. Moreover, these algorithms have been applied to many different ?elds,such as parametric polynomial equations solving, geometric theorem proving and discovering, quanti?er elimination, and so on. This survey brings together the works published between 1992 and 2018, and we hope that this survey is valuable for this research area. Weispfenning in 1992 introduced the concepts of comprehensive Gr?bner system/basis of a parametric polynomial system, and he also presented an algorithm to compute them. Since then,this research ?eld has attracted much attention over the past several decades, and many effcient algorithms have been proposed. Moreover, these algorithms have been applied to many different ?elds,such as parametric polynomial equations solving, geometric theorem proving and discovering, quanti?er elimination, and so on. This survey brings together the works published between 1992 and 2018, and we hope that this survey is valuable for this research area.
出处 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2019年第1期234-255,共22页 系统科学与复杂性学报(英文版)
基金 supported in part by the CAS Project QYZDJ-SSW-SYS022 the National Natural Science Foundation of China under Grant No.61877058 the Strategy Cooperation Project AQ-1701
  • 相关文献

参考文献5

二级参考文献37

  • 1杨路,侯晓荣,夏壁灿.A complete algorithm for automated discovering of a class of inequality-type theorems[J].Science in China(Series F),2001,44(1):33-49. 被引量:24
  • 2B. Elspas, M. W. Green, K. N. Levitt, and R. J. Waldinger, Research in Interactive Program-Proving Techniques, Stanford Research Institute, Menlo Park, California, USA, May 1972.
  • 3S. German and B. Wegbreit, A synthesizer of inductive assertions, IEEE Transactions on Software Engineering, 1975, 1(1): 68-75.
  • 4S. Katz and Z. Manna, Logical analysis of programs, Communications of the ACM, 1976, 19(4):188-206.
  • 5P. Cousot and R. Cousot, Abstract interpretation: A unified lattice model for static analysis ofprograms by construction or approximation of fixpoints, in Conference Record of the Fourth Annual A CM SIGPLA N-SIGA CT Symposium on Principles of Programming Languages, Los Angeles,California, ACM Press, New York, NY,1977, 238-252.
  • 6P. Cousot and N. Halbwachs, Automatic discovery of linear restraints among variables of a program,in Conference Record of the Fifth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Tucson, Arizona, ACM Press, New York, NY, 1978, 84-97.
  • 7M. Muller-Olm and H. Seidl, Polynomial constants are decidable, in 9th Static Analysis Symposium(SAS) (LNCS 2477), Springer-Verlag, 2002.
  • 8M. Muller-Olm and H. Seidl, Precise interprocedural analysis through linear algebra, in Symposium on Principles of Programming Languages,2004,330-341.
  • 9E. Rodriguez-Carbonell and D. Kapur, An abstract interpretation approach for automatic generation of polynomial invariants, in 11th Symposium on Static Analysis (SAS) (LNCS 3148), Verona,Italy, Springer-Verlag, August 2004, 280-295.
  • 10W. Wu, On the decision problem and the mechanization of theorem proving in elementary geometry,Scientia Sinica, 1978, 21: 150-172.

共引文献8

同被引文献18

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部