Extensional Higher-Order Logic Programming

被引:2
|
作者
Charalambidis, Angelos [1 ]
Handjopoulos, Konstantinos [1 ]
Rondogiannis, Panos [1 ]
Wadge, William W. [2 ]
机构
[1] Univ Athens, Dept Informat & Telecommun, GR-10679 Athens, Greece
[2] Univ Victoria, Dept Comp Sci, Victoria, BC V8W 2Y2, Canada
关键词
D O I
10.1007/978-3-642-15675-5_10
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We propose a purely extensional semantics for higher-order logic programming. Under this semantics, every program has a unique minimum Herbrand model which is the greatest lower bound of all Herbrand models of the program and the least fixed-point of the immediate consequence operator of the program. We also propose an SLD-resolution proof procedure which is sound and complete with respect to the minimum model semantics. In other words, we provide a purely extensional theoretical framework for higher-order logic programming which generalizes the familiar theory of classical (first-order) logic programming.
引用
收藏
页码:91 / 103
页数:13
相关论文
共 50 条