FAST SUBSUMPTION ALGORITHMS

被引：0
|
作者：
GOTTLOB, G [1 ]
LEITSCH, A [1 ]
机构：
[1] WIRTSCHAFTSUNIV WIEN,INST STAT,A-1090 WIEN,AUSTRIA
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1985年 / 204卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：64 / 77
页数：14
相关论文
共 50 条
  • [1] Fast theta-subsumption with constraint satisfaction algorithms
    Maloberti, J
    Sebag, M
    MACHINE LEARNING, 2004, 55 (02) : 137 - 174
  • [2] Fast Theta-Subsumption with Constraint Satisfaction Algorithms
    Jérôme Maloberti
    Michèle Sebag
    Machine Learning, 2004, 55 : 137 - 174
  • [3] EFFICIENT SUBSUMPTION ALGORITHMS
    LEITSCH, A
    JOURNAL OF SYMBOLIC LOGIC, 1987, 52 (01) : 328 - 329
  • [4] ON THE EFFICIENCY OF SUBSUMPTION ALGORITHMS
    GOTTLOB, G
    LEITSCH, A
    JOURNAL OF THE ACM, 1985, 32 (02) : 280 - 295
  • [5] Efficient θ-subsumption based on graph algorithms
    Scheffer, T
    Herbrich, R
    Wysotzki, F
    INDUCTIVE LOGIC PROGRAMMING, 1997, 1314 : 212 - 228
  • [6] 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
  • [7] Subsumption Algorithms for Three-Valued Geometric Resolution
    de Nivelle, Hans
    AUTOMATED REASONING (IJCAR 2016), 2016, 9706 : 257 - 272
  • [8] SUBSUMPTION ALGORITHMS FOR THREE-VALUED GEOMETRIC RESOLUTION
    De Nivelle, Hans
    LOGICAL METHODS IN COMPUTER SCIENCE, 2018, 14 (04) : 1 - 29
  • [9] 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
  • [10] Fast subsumption checks using anti-links
    Intel Corp, Chandler, United States
    J Autom Reasoning, 1 (47-83):
12345