Higher-order computational logic

被引:0
|
作者
Lloyd, JW [1 ]
机构
[1] Australian Natl Univ, Res Sch Informat Sci & Engn, Comp Sci Lab, Canberra, ACT, Australia
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents a case for the use of higher-order logic as a foundation for computational logic. A suitable polymorphically-typed, higher-order logic is introduced and its syntax and proof theory briefly described. In addition, a metric space of closed terms suitable for knowledge representation purposes is presented. The approach to representing individuals is illustrated with some examples, as is the technique of programming with abstractions. The paper concludes by placing the results in the wider context of previous and current research in the use of higher-order logic in computational logic.
引用
收藏
页码:105 / 137
页数:33
相关论文
共 50 条
  • [41] Namespace logic: A logic for a reflective higher-order calculus
    Meredith, LG
    Radestock, M
    TRUSTWORTHY GLOBAL COMPUTING, 2005, 3705 : 353 - 369
  • [42] A Higher-Order Calculus of Computational Fields
    Audrito, Giorgio
    Viroli, Mirko
    Damiani, Ferruccio
    Pianini, Danilo
    Beal, Jacob
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2019, 20 (01)
  • [43] Higher-order α-method in computational plasticity
    Hyungseop Shim
    KSCE Journal of Civil Engineering, 2005, 9 (3) : 255 - 259
  • [44] Computational systems as higher-order mechanisms
    Jorge Ignacio Fuentes
    Synthese, 203
  • [45] Computational homogenization of higher-order continua
    Schmidt, Felix
    Krueger, Melanie
    Keip, Marc-Andre
    Hesch, Christian
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2022, 123 (11) : 2499 - 2529
  • [46] Computational systems as higher-order mechanisms
    Fuentes, Jorge Ignacio
    SYNTHESE, 2024, 203 (02)
  • [47] On a Higher-Order Calculus of Computational Fields
    Audrito, Giorgio
    Viroli, Mirko
    Damiani, Ferruccio
    Pianini, Danilo
    Beal, Jacob
    FORMAL TECHNIQUES FOR DISTRIBUTED OBJECTS, COMPONENTS, AND SYSTEMS (FORTE 2019), 2019, 11535 : 289 - 292
  • [48] On the Formalization of Fourier Transform in Higher-order Logic
    Rashid, Adnan
    Hasan, Osman
    INTERACTIVE THEOREM PROVING (ITP 2016), 2016, 9807 : 483 - 490
  • [49] Partial recursive functions in Higher-Order Logic
    Krauss, Alexander
    AUTOMATED REASONING, PROCEEDINGS, 2006, 4130 : 589 - 603
  • [50] Logic program synthesis in a higher-order setting
    Lacey, D
    Richardson, J
    Smaill, A
    COMPUTATIONAL LOGIC - CL 2000, 2000, 1861 : 87 - 100