Implementing the model evolution calculus

被引:31
作者
Baumgartner, P
Fuchs, A
Tinelli, C
机构
[1] Max Planck Inst Informat, Programming Log Grp, D-66123 Saarbrucken, Germany
[2] Univ Iowa, Dept Comp Sci, Iowa City, IA 52242 USA
关键词
automated theorem proving; Davis-Putnam-Logemann-Loveland procedure;
D O I
10.1142/S0218213006002552
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Darwin is the first implementation of the Model Evolution Calculus by Baumgartner and Tinelli. The Model Evolution Calculus lifts the DPLL procedure to first-order logic. Darwin is meant to be a fast and clean implementation of the calculus, showing its effectiveness and providing a base for further improvements and extensions. Based on a brief summary of the Model Evolution Calculus, we describe in the main part of the paper Darwin's proof procedure and its data structures and algorithms, discussing the main design decisions and features that influence Darwin's performance. We also report on practical experiments carried out with problems from the CASC-J2 system competition and parts of the TPTP Problem Library, and compare the results with those of other state-of-the-art theorem provers.
引用
收藏
页码:21 / 52
页数:32
相关论文
共 23 条
  • [1] Baumgartner P, 2003, LECT NOTES ARTIF INT, V2741, P350
  • [2] Baumgartner P, 2000, LECT NOTES ARTIF INT, V1831, P200
  • [3] BAUMGARTNER P, 2003, D56075 U KOBL LAND I
  • [4] BAUMGARTNER P, 2004, P 1 WORKSH EMP SUCC
  • [5] A COMPUTING PROCEDURE FOR QUANTIFICATION THEORY
    DAVIS, M
    PUTNAM, H
    [J]. JOURNAL OF THE ACM, 1960, 7 (03) : 201 - 215
  • [6] A MACHINE PROGRAM FOR THEOREM-PROVING
    DAVIS, M
    LOGEMANN, G
    LOVELAND, D
    [J]. COMMUNICATIONS OF THE ACM, 1962, 5 (07) : 394 - 397
  • [7] FILLIATRE JC, 2001, LECT NOTES COMPUTER, V2102
  • [8] GINSBERG ML, 1996, ELECT NOTES THEOR CO
  • [9] GOLDBERG E, 2002, FAST ROBUST SAT SOLV
  • [10] GRAF P, 1994, MPII94251