An application of automatic theorem proving in computer vision

被引:0
|
作者
Bondyfalat, D [1 ]
Mourrain, B [1 ]
Papadopoulo, T [1 ]
机构
[1] INRIA, F-06902 Sophia Antipolis, France
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Getting accurate construction of tridimensional CAD models is a field of great importance: with the increasing complexity of the models that modeling tools can manage nowadays, it becomes more and more necessary to construct geometrically accurate descriptions. Maybe the most promising technique, because of its full generality, is the use of automatic geometric tools: these can be used for checking the geometrical coherency and discovering geometrical properties of the model. In this paper, we describe an automatic method for constructing the model of a given geometrical configuration and for discovering the theorems of this configuration. This approach motivated by 3D modeling problems is based on characteristic set techniques and generic polynomials in the bracket algebra.
引用
收藏
页码:207 / 231
页数:25
相关论文
共 50 条
  • [41] AUTOMATIC THEOREM-PROVING WITHIN THE PORTABLE AI LAB
    BAJ, F
    ROSNER, M
    LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1992, 636 : 313 - 324
  • [42] AUTOMATIC THEOREM PROVING IN A CERTAIN CLASS OF FORMULAE OF PREDICATE CALCULUS
    ORLOWSKA, E
    BULLETIN DE L ACADEMIE POLONAISE DES SCIENCES-SERIE DES SCIENCES MATHEMATIQUES ASTRONOMIQUES ET PHYSIQUES, 1969, 17 (03): : 117 - &
  • [43] Application of computer vision to automatic prescription verification in pharmaceutical mail order
    Alouani, AT
    Visual Information Processing XIV, 2005, 5817 : 106 - 115
  • [44] Computer Theorem Proving for Verifiable Solving of Geometric Construction Problems
    Marinkovic, Vesna
    Janicic, Predrag
    Schreck, Pascal
    AUTOMATED DEDUCTION IN GEOMETRY, 2015, 9201 : 72 - 93
  • [45] A combinatorial consistency lemma with application to proving the PCP theorem
    Goldreich, O
    Safra, S
    SIAM JOURNAL ON COMPUTING, 2000, 29 (04) : 1132 - 1154
  • [46] ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)
    Goc, Daniel
    Rampersad, Narad
    Rigo, Michel
    Salimov, Pavel
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2014, 25 (08) : 1097 - 1110
  • [47] On the need of radical ideals in automatic proving: A theorem about regular polygons
    Pech, Pavel
    AUTOMATED DEDUCTION IN GEOMETRY, 2007, 4869 : 157 - 170
  • [48] Automatic Theorem Proving for Natural Logic: A Case Study on Textual Entailment
    Lavalle, Jesus
    Montes, Manuel
    Jimenez, Hector
    Villasenor, Luis
    Beltran, Beatriz
    COMPUTACION Y SISTEMAS, 2018, 22 (01): : 119 - 135
  • [49] OR-ATP: An operation refinement approach as a process of Automatic Theorem Proving
    Wang, Shuaiqiang
    Wan, Jiancheng
    Hou, Jinkui
    SNPD 2007: EIGHTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING, AND PARALLEL/DISTRIBUTED COMPUTING, VOL 3, PROCEEDINGS, 2007, : 1078 - +
  • [50] M-CALCULUS - A SEQUENT METHOD FOR AUTOMATIC THEOREM-PROVING
    MANTSIVODA, AV
    CYBERNETICS AND SYSTEMS ANALYSIS, 1993, 29 (01) : 130 - 136