Fast subsumption checks using anti-links

被引:0
|
作者
Intel Corp, Chandler, United States [1 ]
机构
来源
J Autom Reasoning | / 1卷 / 47-83期
关键词
Number:; CCR-9101208; Acronym:; NSF; Sponsor: National Science Foundation; -; DFG; Sponsor: Deutsche Forschungsgemeinschaft;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [1] Fast Subsumption Checks Using Anti-Links
    Anavai Ramesh
    Bernhard Beckert
    Reiner Hähnle
    Neil V. Murray
    Journal of Automated Reasoning, 1997, 18 : 47 - 83
  • [2] Fast subsumption checks using anti-links
    Ramesh, A
    Beckert, B
    Hahnle, R
    Murray, NV
    JOURNAL OF AUTOMATED REASONING, 1997, 18 (01) : 47 - 83
  • [3] Simplification of many-valued logic formulas using anti-links
    Beckert, B
    Hahnle, R
    Escalada-Imaz, G
    JOURNAL OF LOGIC AND COMPUTATION, 1998, 8 (04) : 569 - 587
  • [4] ON THE POWER OF SUBSUMPTION AND CONTEXT CHECKS
    BOL, RN
    APT, KR
    KLOP, JW
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 429 : 131 - 140
  • [5] Statistically Valid Links and Anti-links Between Words and Between Documents: Applying TourneBool Randomization Test to a Reuters Collection
    Lelu, Alain
    Cadot, Martine
    ADVANCES IN KNOWLEDGE DISCOVERY AND MANAGEMENT, 2010, 292 : 307 - +
  • [6] FAST SUBSUMPTION ALGORITHMS
    GOTTLOB, G
    LEITSCH, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1985, 204 : 64 - 77
  • [7] Fast Subsumption Between Rooted Labeled Trees
    Carloni, Olivier
    KNOWLEDGE SCIENCE, ENGINEERING AND MANAGEMENT (KSEM 2017): 10TH INTERNATIONAL CONFERENCE, KSEM 2017, MELBOURNE, VIC, AUSTRALIA, AUGUST 19-20, 2017, PROCEEDINGS, 2017, 10412 : 552 - 559
  • [8] RP checks out fast
    Eng. Cast. Solutions, 2006, 6 (21-23):
  • [9] FAST DIMENSIONAL CHECKS - WITH STATISTICS
    SPOTTS, MF
    MACHINE DESIGN, 1978, 50 (23) : 170 - 173
  • [10] ProVerif with Lemmas, Induction, Fast Subsumption, and Much More
    Blanchet, Bruno
    Cheval, Vincent
    Cortier, Veronique
    43RD IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP 2022), 2022, : 69 - 86