Higher-order computational logic

被引：0

作者：

Lloyd, JW ^{[1
]}

机构：

[1] Australian Natl Univ, Res Sch Informat Sci & Engn, Comp Sci Lab, Canberra, ACT, Australia

来源：

COMPUTATIONAL LOGIC: LOGIC PROGRAMMING AND BEYOND, PT I | 2002年 / 2407卷

关键词：

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

共 16 条

[1] Andrews P, 1986, An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof
[2] Bowers A. F., 2000, MACH LEARN, P81
[3] BOWERS AF, 2001, KNOWLEDGE REPRESENTA
[4] Church A., 1940, The Journal of Symbolic Logic, V5, P56, DOI [DOI 10.2307/2266170, 10.2307/2266170]
[5] Solving the multiple instance problem with axis-parallel rectangles
Dietterich, TG
Lathrop, RH
LozanoPerez, T
[J]. ARTIFICIAL INTELLIGENCE, 1997, 89 (1-2) : 31 - 71
[6] Gordon M. J., 1993, INTRO HOL THEOREM PR
[7] THE INTEGRATION OF FUNCTIONS INTO LOGIC PROGRAMMING - FROM THEORY TO PRACTICE
HANUS, M
[J]. JOURNAL OF LOGIC PROGRAMMING, 1994, 20 : 583 - 628
[8] HANUS M, CURRY INTEGRATED FUN
[9] JONES S, HASKELL98 NONSTRICT
[10] Lloyd J. W., 1987, FDN LOGIC PROGRAMMIN

← 1 2 →