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
来源：
LOGICS IN ARTIFICIAL INTELLIGENCE, JELIA 2010 | 2010年 / 6341卷
关键词：
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 条
  • [31] Higher-Order Logic Programming: an Expressive Language for Representing Qualitative Preferences
    Charalambidis, Angelos
    Rondogiannis, Panos
    Troumpoukis, Antonis
    PROCEEDINGS OF THE 18TH INTERNATIONAL SYMPOSIUM ON PRINCIPLES AND PRACTICE OF DECLARATIVE PROGRAMMING (PPDP 2016), 2016, : 24 - 37
  • [32] Cooperation of Algebraic Constraint Domains in Higher-Order Functional and Logic Programming
    del Vado Virseda, Rafael
    ALGEBRAIC METHODOLOGY AND SOFTWARE TECHNOLOGY, 2011, 6486 : 180 - 200
  • [33] Higher-order logic programming: An expressive language for representing qualitative preferences
    Charalambidis, Angelos
    Rondogiannis, Panos
    Troumpoukis, Antonis
    SCIENCE OF COMPUTER PROGRAMMING, 2018, 155 : 173 - 197
  • [34] A BOTTOM-UP INTERPRETER FOR A HIGHER-ORDER LOGIC PROGRAMMING LANGUAGE
    HOA, AHB
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 631 : 326 - 340
  • [35] A proof-theoretic foundation for tabled higher-order logic programming
    Pientka, B
    LOGICS PROGRAMMING, PROCEEDINGS, 2002, 2401 : 271 - 286
  • [36] CERES in higher-order logic
    Hetzl, Stefan
    Leitsch, Alexander
    Weller, Daniel
    ANNALS OF PURE AND APPLIED LOGIC, 2011, 162 (12) : 1001 - 1034
  • [37] Superposition for Higher-Order Logic
    Alexander Bentkamp
    Jasmin Blanchette
    Sophie Tourret
    Petar Vukmirović
    Journal of Automated Reasoning, 2023, 67
  • [38] CONNECTIONS AND HIGHER-ORDER LOGIC
    ANDREWS, PB
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 230 : 1 - 4
  • [39] Higher-order computational logic
    Lloyd, JW
    COMPUTATIONAL LOGIC: LOGIC PROGRAMMING AND BEYOND, PT I, 2002, 2407 : 105 - 137
  • [40] Superposition for Higher-Order Logic
    Bentkamp, Alexander
    Blanchette, Jasmin
    Tourret, Sophie
    Vukmirovic, Petar
    JOURNAL OF AUTOMATED REASONING, 2023, 67 (01)
12345