检索结果-内蒙古大学图书馆

higher-order logic programming: An expressive language for representing qualitative preferences

SCIENCE OF COMPUTER programming 2018年 155卷 173-197页

作者： Charalambidis, Angelos Rondogiannis, Panos Troumpoukis, Antonis Natl & Kapodistrian Univ Athens Dept Informat & Telecommun Athens Greece NCSR Demokritos Inst Informat & Telecommun Athens Greece

We consider the problem of concisely representing and handling preferences in logic programming and relational databases. Our starting point is the well-known proposal developed in [2] which advocates the embedding of first-order preference formulas into relational algebra through a winnow operator that is parameterized by a database relation and a preference formula. We argue that despite its elegance, the above proposal has certain shortcomings: only intrinsic preference formulas are supported, the preference relations and the preference queries are expressed in two different languages, and there is no direct way to define alternative operators beyond winnow. We propose the use of higher-order logic programming as a logical framework that remedies the above deficiencies. In particular, the proposed framework supports both intrinsic and extrinsic preference formulas, it can represent both preference relations as-well-as queries, and it can be used to define a variety of interesting alternative operators beyond winnow. We demonstrate the feasibility of our approach by presenting an implementation and an experimental evaluation of all the proposed concepts in the higher-order logic programming language Hilog. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Preferences higher-order logic programming Hilog

来源：评论

学校读者我要写书评

暂无评论

higher-order logic programming: an Expressive Language for Representing Qualitative Preferences 16

Higher-Order Logic Programming: an Expressive Language for R...

引用

18th International Symposium on Principles and Practice of Declarative programming (PPDP)

作者： Charalambidis, Angelos Rondogiannis, Panos Troumpoukis, Antonis Univ Athens Dept Informat & Telecommun Athens Greece NCSR Demokritos Inst Informat & Telecommun Aghia Paraskevi Greece

ISBN: (纸本)9781450341486

We consider the problem of concisely representing and handling preferences in logic programming and relational data-bases. Our starting point is a well-known proposal [8] which advocates the embedding of first-order preference formulas into relational algebra through a single winnow operator that is parameterized by a database relation and a preference formula. We argue that despite its elegance, the framework of [8] has a number of shortcomings: only intrinsic preference formulas are supported, the preference relations and preference queries are expressed in two different languages, and there is no direct way to define alternative operators beyond winnow. We propose the use of higher-order logic programming as a logical framework that remedies all the above deficiencies. In particular, the proposed framework supports both intrinsic and extrinsic preference formulas, it can represent both preference relations as-well-as queries, and it can be used to define a variety of interesting alternative operators beyond winnow. We demonstrate the feasibility of our approach by presenting an implementation of all the proposed concepts in the higher-order logic programming language Hilog.

关键词： Preferences higher-order logic programming Hilog

来源：评论

学校读者我要写书评

暂无评论

Prototyping a Functional Language using higher-order logic programming: A Functional Pearl on Learning the Ways of lambda Prolog/Makam

引用

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2018年第ICFP期2卷 1–30页

作者： Stampoulis, Antonis Chlipala, Adam Originate Inc New York NY 10013 USA MIT CSAIL Cambridge MA USA

We demonstrate how the framework of higher-order logic programming, as exemplified in the lambda Prolog language design, is a prime vehicle for rapid prototyping of implementations for programming languages with sophisticated type systems. We present the literate development of a type checker for a language with a number of complicated features, culminating in a standard ML-style core with algebraic datatypes and type generalization, extended with staging constructs that are generic over a separately defined language of terms. We add each new feature in sequence, with little to no changes to existing code. Scaling the higher-order logic programming approach to this setting required us to develop approaches to challenges like complex variable binding patterns in object languages and performing generic structural traversals of code, making use of novel constructions in the setting of lambda Prolog, such as GADIs and generic programming. For our development, we make use of Makam, a new implementation of lambda Prolog, which we introduce in tutorial style as part of our (quasi-)literate development.

关键词： higher-order logic programming programming language prototyping metaprogramming

来源：评论

学校读者我要写书评

暂无评论

The Stable Model Semantics for higher-order logic programming

引用

THEORY AND PRACTICE OF logic programming 2024年第4期24卷 737-754页

作者： Bogaerts, Bart Charalambidis, Angelos Chatziagapis, Giannos Kostopoulos, Babis Pollaci, Samuele Rondogiannis, Panos Vrije Univ Brussels Belgium Katholieke Univ Leuven Leuven Belgium Harokopio Univ Athens Greece Univ Athens Natl & Kapodistrian Athens Greece

We propose a stable model semantics for higher-order logic programs. Our semantics is developed using Approximation Fixpoint Theory (AFT), a powerful formalism that has successfully been used to give meaning to diverse non-monotonic formalisms. The proposed semantics generalizes the classical two-valued stable model semantics of Gelfond and Lifschitz as well as the three-valued one of Przymusinski, retaining their desirable properties. Due to the use of AFT, we also get for free alternative semantics for higher-order logic programs, namely supported model, Kripke-Kleene, and well-founded. Additionally, we define a broad class of stratified higher-order logic programs and demonstrate that they have a unique two-valued higher-order stable model which coincides with the well-founded semantics of such programs. We provide a number of examples in different application domains, which demonstrate that higher-order logic programming under the stable model semantics is a powerful and versatile formalism, which can potentially form the basis of novel ASP systems.

关键词： higher-order logic programming stable model semantics approximation fixpoint theory

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of higher-order logic programming in Language-Oriented programming 15th

On the Effectiveness of Higher-Order Logic Programming in La...

引用

15th International Symposium on Functional and logic programming (FLOPS)

作者： Cimini, Matteo Univ Massachusetts Lowell Lowell MA 01854 USA

ISBN: (纸本)9783030590246;9783030590253

In previous work we have presented lang-n-play, a functional language-oriented programming language with languages as first-class-citizens. Language definitions can be bound to variables, passed to and returned by functions, and can be modified at run-time before being used. lang-n-play programs are compiled and executed in the higher-order logic programming ***. In this paper, we describe our compilation methods, which highlight how the distinctive features of higher-order logic programming are a great fit in implementing a language-oriented programming language.

关键词： higher-order logic programming Language-oriented programming Functional programming

来源：评论

学校读者我要写书评

暂无评论

Extensional higher-order logic programming

引用

ACM TRANSACTIONS ON COMPUTATIONAL logic 2013年第3期14卷 21-21页

作者： Charalambidis, Angelos Handjopoulos, Konstantinos Rondogiannis, Panagiotis Wadge, William W. Univ Athens Dept Informat & Telecommun Athens 15784 Greece Univ Victoria Victoria BC V8W 3P6 Canada

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.

关键词： Design Languages Theory higher-order logic programming denotational semantics extensionality algebraic lattices

来源：评论

学校读者我要写书评

暂无评论

A Framework for Object-Oriented Data Mining based on higher-order logic programming

A Framework for Object-Oriented Data Mining based on Higher-...

引用

2013 2nd International Conference on Recent Trends in Materials and Mechanical Engineering(ICRTMME 2013)

作者： Zhiping Zhang Linna Li Lijun Wang Haiyan Yu Institute of Scientific and Technical Information of China

Data mining discovers knowledge and useful information from large amounts of data stored in *** the increasing popularity of object-oriented database system in advanced database applications,it is significantly important to study the data mining methods for objectoriented *** paper proposes that higher-order logic programming languages and techniques is very suitable for object-oriented data mining,and presents a framework for objectoriented data mining based on higher-order logic *** a framework is inductive logic programming which adopts higher-order logic programming language Escher as knowledge representation *** addition,Escher is a generalization of the attribute-value representation,thus many higher-order logic learners under this framework can be upgraded directly from corresponding propositional learners.

关键词： Object-oriented Database Data Mining higher-order logic programming

来源：评论

学校读者我要写书评

暂无评论

Overview of an Abstract Fixed Point Theory for Non-Monotonic Functions and its Applications to logic programming

引用

ACTA CYBERNETICA 2017年第1期23卷 319-326页

作者： Charalambidis, Angelos Rondogiannis, Panos Univ Athens Dept Informat & Telecommun Athens Greece

The purpose of the present paper is to give an overview of our joint work with Zoltan Esik, namely the development of an abstract fixed point theory for a class of non-monotonic functions [4] and its use in providing a novel denotational semantics for a very broad extension of classical logic programming [1]. Our purpose is to give a high-level presentation of the main developments of these two works, that avoids as much as possible the underlying technical details, and which can be used as a mild introduction to the area.

关键词： fixed point theory higher-order logic programming semantics of logic programming

来源：评论

学校读者我要写书评

暂无评论

Polymorphic lemmas and definitions in λProlog and Twelf

引用

THEORY AND PRACTICE OF logic programming 2004年第1-3期4卷 1-39页

作者： Appel, AW Felty, AP Princeton Univ Dept Comp Sci Princeton NJ 08544 USA Univ Ottawa Sch Informat Technol & Engn Ottawa ON K1N 6N5 Canada

lambdaProlog is known to be well-suited for expressing and implementing logics and inference systems. We show that lemmas and definitions in such logics can be implemented with a great economy of expression. We encode a higher-order logic using an encoding that maps both terms and types of the object logic (higher-order logic) to terms of the metalanguage (lambdaProlog). We discuss both the Terzo and Teyjus implementations of lambdaProlog. We also encode the same logic in Twelf and compare the features of these two metalanguages for our purposes.

关键词： theorem proving higher-order logic programming logical frameworks lemmas definitions polymorphism proof-carrying code Lambda Prolog Twelf

来源：评论

学校读者我要写书评

暂无评论

The Expressive Power of higher-order Datalog

引用

THEORY AND PRACTICE OF logic programming 2019年第5-6期19卷 925-940页

作者： Charalambidis, Angelos Nomikos, Christos Rondogiannis, Panos NCSR Demokritos Inst Informat & Telecommun Aghia Paraskevi Greece Univ Ioannina Dept Comp Sci & Engn Ioannina Greece Univ Athens Dept Informat & Telecommun Athens Greece

A classical result in descriptive complexity theory states that Datalog expresses exactly the class of polynomially computable queries on ordered databases (Papadimitriou 1985;Gradel 1992;Vardi 1982;Immerman 1986;Leivant 1989). In this paper we extend this result to the case of higher-order Datalog. In particular, we demonstrate that on ordered databases, for all k >= 2, k-order Datalog captures (k - 1)-EXPTIME. This result suggests that higher-order extensions of Datalog possess superior expressive power and they are worthwhile of further investigation both in theory and in practice.

关键词： Datalog higher-order logic programming Descriptive Complexity Theory

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：