TYPED HORN LOGIC

被引:0
|
作者
POIGNE, A
机构
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:470 / 477
页数:8
相关论文
共 50 条
  • [42] Imprecise Probabilistic Horn Clause Logic
    Michels, Steffen
    Hommersom, Arjen
    Lucas, Peter J. F.
    Velikova, Marina
    21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014), 2014, 263 : 621 - 626
  • [43] EXTENDED HORN SETS IN PROPOSITIONAL LOGIC
    CHANDRU, V
    HOOKER, JN
    JOURNAL OF THE ACM, 1991, 38 (01) : 205 - 221
  • [44] REASONING ABOUT ARRAY STRUCTURES USING A DEPENDENTLY TYPED LOGIC
    DENT, A
    HANNA, K
    COMPUTER HARDWARE DESCRIPTION LANGUAGES AND THEIR APPLICATIONS, 1993, 32 : 207 - 224
  • [45] Metric Temporal Graph Logic over Typed Attributed Graphs
    Giese, Holger
    Maximova, Maria
    Sakizloglou, Lucas
    Schneider, Sven
    FUNDAMENTAL APPROACHES TO SOFTWARE ENGINEERING (FASE 2019), 2019, 11424 : 282 - 298
  • [47] A typed, compositional logic for a stack-based abstract machine
    Benton, N
    PROGRAMMING LANGUAGES AND SYSTEMS, PROCEEDINGS, 2005, 3780 : 364 - 380
  • [48] Typed SLD-Resolution: Dynamic Typing for Logic Programming
    Barbosa, Joao
    Florido, Mario
    Costa, Vitor Santos
    LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION (LOPSTR 2022), 2022, 13474 : 123 - 141
  • [49] LOGIC PROGRAMMING WITH TYPED UNIFICATION AND ITS REALIZATION ON AN ABSTRACT MACHINE
    BEIERLE, C
    IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1992, 36 (03) : 375 - 390
  • [50] Program extraction in simply-typed higher order logic
    Berghofer, S
    TYPES FOR PROOFS AND PROGRAMS, 2002, 2646 : 21 - 38