Extensional Higher-Order Logic Programming

被引：18
|
作者：
Charalambidis, Angelos [1 ]
Handjopoulos, Konstantinos [1 ]
Rondogiannis, Panagiotis [1 ]
Wadge, William W. [2 ]
机构：
[1] Univ Athens, Dept Informat & Telecommun, Athens 15784, Greece
[2] Univ Victoria, Victoria, BC V8W 3P6, Canada
来源：
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC | 2013年 / 14卷 / 03期
关键词：
Design; Languages; Theory; Higher-order logic programming; denotational semantics; extensionality; algebraic lattices;
D O I：
10.1145/2499937.2499942
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We propose a purely extensional semantics for higher-order logic programming. In this semantics program predicates denote sets of ordered tuples, and two predicates are equal iff they are equal as sets. Moreover, 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 an immediate consequence operator. We also propose an SLD-resolution proof system which is proven sound and complete with respect to the minimum Herbrand 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.
引用
收藏
页数：40
相关论文
共 50 条
  • [1] Extensional Higher-Order Logic Programming
    Charalambidis, Angelos
    Handjopoulos, Konstantinos
    Rondogiannis, Panos
    Wadge, William W.
    [J]. LOGICS IN ARTIFICIAL INTELLIGENCE, JELIA 2010, 2010, 6341 : 91 - 103
  • [2] Constructive Negation in Extensional Higher-Order Logic Programming
    Charalambidis, Angelos
    Rondogiannis, Panos
    [J]. FOURTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2014, : 12 - 21
  • [3] Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation
    Charalambidis, Angelos
    Esik, Zoltan
    Rondogiannis, Panos
    [J]. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2014, 14 : 725 - 737
  • [4] HIGHER-ORDER LOGIC PROGRAMMING
    MILLER, DA
    NADATHUR, G
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1986, 225 : 448 - 462
  • [5] HIGHER-ORDER LOGIC PROGRAMMING
    MILLER, DA
    NADATHUR, G
    [J]. JOURNAL OF SYMBOLIC LOGIC, 1986, 51 (03) : 851 - 851
  • [6] Tabling for higher-order logic programming
    Pientka, B
    [J]. AUTOMATED DEDUCTION - CADE-20, PROCEEDINGS, 2005, 3632 : 54 - 68
  • [7] Extensional Semantics for Higher-Order Logic Programs with Negation
    Rondogiannis, Panos
    Symeonidou, Ioanna
    [J]. LOGICS IN ARTIFICIAL INTELLIGENCE, (JELIA 2016), 2016, 10021 : 447 - 462
  • [8] HILOG - A FOUNDATION FOR HIGHER-ORDER LOGIC PROGRAMMING
    CHEN, WD
    KIFER, M
    WARREN, DS
    [J]. JOURNAL OF LOGIC PROGRAMMING, 1993, 15 (03): : 187 - 230
  • [9] A higher-order logic programming language with constraints
    Leach, J
    Nieva, S
    [J]. FUNCTIONAL AND LOGIC PROGRAMMING, PROCEEDINGS, 2001, 2024 : 108 - 122
  • [10] A treatment of higher-order features in logic programming
    Nadathur, G
    [J]. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2005, 5 : 305 - 354
12345