Inductive Theorem Proving for Design Specifications

被引：0
|
作者：
机构：
来源：
J Symb Comput | / 1卷 / 41期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] Inductive theorem proving for design specifications
    Padawitz, P
    JOURNAL OF SYMBOLIC COMPUTATION, 1996, 21 (01) : 41 - 99
  • [2] Inductive theorem proving in hierarchical conditional specifications
    Avenhaus, J
    Madlener, K
    MODELS, ALGEBRAS, AND PROOFS, 1999, 203 : 337 - 371
  • [3] Conditional equational specifications of data types with partial operations for inductive theorem proving
    Kuhler, U
    Wirth, CP
    REWRITING TECHNIQUES AND APPLICATIONS, 1997, 1232 : 38 - 52
  • [4] Analogy in Inductive Theorem Proving
    Erica Melis
    Jon Whittle
    Journal of Automated Reasoning, 1999, 22 : 117 - 147
  • [5] Analogy in inductive theorem proving
    Melis, E
    Whittle, J
    JOURNAL OF AUTOMATED REASONING, 1999, 22 (02) : 117 - 147
  • [6] Focused Inductive Theorem Proving
    Baelde, David
    Miller, Dale
    Snow, Zachary
    AUTOMATED REASONING, 2010, 6173 : 278 - +
  • [7] Proving Termination by Dependency Pairs and Inductive Theorem Proving
    Carsten Fuhs
    Jürgen Giesl
    Michael Parting
    Peter Schneider-Kamp
    Stephan Swiderski
    Journal of Automated Reasoning, 2011, 47 : 133 - 160
  • [8] Proving Termination by Dependency Pairs and Inductive Theorem Proving
    Fuhs, Carsten
    Giesl, Juergen
    Parting, Michael
    Schneider-Kamp, Peter
    Swiderski, Stephan
    JOURNAL OF AUTOMATED REASONING, 2011, 47 (02) : 133 - 160
  • [9] Machine Learning for Inductive Theorem Proving
    Jiang, Yaqing
    Papapanagiotou, Petros
    Fleuriot, Jacques
    ARTIFICIAL INTELLIGENCE AND SYMBOLIC COMPUTATION (AISC 2018), 2018, 11110 : 87 - 103
  • [10] Checking Sufficient Completeness by Inductive Theorem Proving
    Meseguer, Jose
    REWRITING LOGIC AND ITS APPLICATIONS, WRLA 2022, 2022, 13252 : 171 - 190
12345