We consider the problem of concisely representing and handling preferences in logicprogramming and relational databases. Our starting point is the well-known proposal developed in [2] which advocates the embedding of...
详细信息
We consider the problem of concisely representing and handling preferences in logicprogramming 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.
We consider the problem of concisely representing and handling preferences in logicprogramming and relational data-bases. Our starting point is a well-known proposal [8] which advocates the embedding of first-order p...
详细信息
ISBN:
(纸本)9781450341486
We consider the problem of concisely representing and handling preferences in logicprogramming 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.
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, ever...
详细信息
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) logicprogramming.
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 sophi...
详细信息
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.
We propose a stable model semantics for higher-orderlogic programs. Our semantics is developed using Approximation Fixpoint Theory (AFT), a powerful formalism that has successfully been used to give meaning to divers...
详细信息
We propose a stable model semantics for higher-orderlogic 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-orderlogic programs, namely supported model, Kripke-Kleene, and well-founded. Additionally, we define a broad class of stratified higher-orderlogic 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.
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 fun...
详细信息
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.
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 import...
详细信息
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-orderlogic *** a framework is inductive logicprogramming which adopts higher-order logic programming language Escher as knowledge representation *** addition,Escher is a generalization of the attribute-value representation,thus many higher-orderlogic learners under this framework can be upgraded directly from corresponding propositional learners.
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 ...
详细信息
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 logicprogramming [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.
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...
详细信息
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-orderlogic using an encoding that maps both terms and types of the object logic (higher-orderlogic) 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.
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;Leiv...
详细信息
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.
暂无评论