Filters








47,528 Hits in 4.9 sec

Predicate Specialization for Definitional Higher-order Logic Programs [article]

Antonis Troumpoukis, Angelos Charalambidis
2018 arXiv   pre-print
Higher-order logic programming is an interesting extension of traditional logic programming that allows predicates to appear as arguments and variables to be used where predicates typically occur.  ...  In this paper we propose a program specialization technique based on partial evaluation that can be applied to a modest but useful class of higher-order logic programs and can transform them into first-order  ...  Acknowledgements We would like to thank the anonymous reviewers for providing constructive comments on our original submission.  ... 
arXiv:1808.04176v2 fatcat:3s6pnadanjdipgab6atnxktavy

Page 2046 of Mathematical Reviews Vol. , Issue 99c [page]

1991 Mathematical Reviews  
This is a first-order theory that contains induc- tion principles corresponding to the definitions of the predicates in the program plus appropriate axioms for built-in predicates.  ...  Many peo- ple are attracted to Prolog, the best known logic programming language, simply for the special programming tools based on uni- fication and backtracking search that it provides.  ... 

Page 6675 of Mathematical Reviews Vol. , Issue 94k [page]

1994 Mathematical Reviews  
The method is shown to be complete (and decid- able) for expressions of first-order types, but incomplete at higher types.”  ...  In addition, for a particu- lar application, it may be possible to specialize a program so that the transformed program computes the required answers for only a restricted set of goals.  ... 

HiLog: A foundation for higher-order logic programming

Weidong Chen, Michael Kifer, David S. Warren
1993 The Journal of Logic Programming  
For example, Prolog combines predicate calculus, higher-order, and meta-level programming in one working system, allowing programmers routine use of generic predicate definitions (e.g., transitive closure  ...  We describe a novel logic, called HiLog, and show that it provides a more suitable basis for logic programming than does traditional predicate logic.  ...  This higher-orderness presents certain semantic problems for logic programs in COL.  ... 
doi:10.1016/0743-1066(93)90039-j fatcat:ijjkcjymbje43mbiacp6ogkswm

The Expressive Power of Higher-Order Datalog

ANGELOS CHARALAMBIDIS, CHRISTOS NOMIKOS, PANOS RONDOGIANNIS
2019 Theory and Practice of Logic Programming  
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.  ...  Supplementary material To view supplementary material for this article, please visit https://doi.org/10.1017/ S1471068419000279.  ... 
doi:10.1017/s1471068419000279 fatcat:lpjimrao3bf3fm43myflmbwnr4

Some uses of higher-order logic in computational linguistics

Dale A. Miller, Gopalan Nadathur
1986 Proceedings of the 24th annual meeting on Association for Computational Linguistics -  
We also describe a higher-order logic programming language, called ~Prolog, which represents programs as higher-order definite clauses and interprets them using a depth-first interpreter.  ...  In this paper we shall consider the use of a higher-order logic for this task. We first present a version of definite clauses (positive Horn clauses) that is based on this logic.  ...  AProlog We have used higher-order definite clauses and a depth-first interpreter to describe a logic programming language called AProlog.  ... 
doi:10.3115/981131.981165 dblp:conf/acl/MillerN86 fatcat:nqfxzvpkdfc67dh3acnwwvxv6m

Inductive Synthesis of Logic Programs by Composition of Combinatory Program Schemes [chapter]

Andreas Hamfelt, Jørgen Fischer Nilsson
1999 Lecture Notes in Computer Science  
Based on a variable-free combinatory form of definite clause logic programs we outline a methodology and supporting program environment CombInduce for inducing well-moded logic programs from examples.  ...  Keywords: logic program schemata, logical combinators, synthesis by composition and specialization of schemas, inductive synthesis, metalogic program environment. P. Flener (Ed.): LOPSTR'98  ...  may be conceived of as higher order predicates used similarly to higher order functions in functional programming.  ... 
doi:10.1007/3-540-48958-4_8 fatcat:ndvfpzjkb5gkxgzeujadumtr34

Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization

Daan Fierens, Marc Herbstritt
2010 International Conference on Logic Programming  
Concretely, we develop an algorithm that specializes the definitions of the query-predicates with respect to the static part of the knowledge base.  ...  We show how to apply program specialization to make Gibbs sampling more efficient.  ...  Applying Logic Program Specialization to Parameterized CPDs The idea is to specialize the definitions of the CPD-predicates with respect to the static part of the knowledge base.  ... 
doi:10.4230/lipics.iclp.2010.74 dblp:conf/iclp/Fierens10 fatcat:ja4eiyqlivh4dmld6i3f3ozh6i

A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems [chapter]

Amadeo Casas, Daniel Cabeza, Manuel V. Hermenegildo
2006 Lecture Notes in Computer Science  
Nondeterminism and partially instantiated data structures give logic programming expressive power beyond that of functional programming.  ...  The extension is also composable with higher-order features and can be combined with other extensions to ISO-Prolog such as constraints.  ...  of systems which integrate functions and higher-order programming into some form of logic programming.  ... 
doi:10.1007/11737414_11 fatcat:gckkequ2sbhwrhwifdz4vrdfza

Guest Editors' Introduction

Stephen Muggleton, David Page
1997 Machine Learning  
The representation language for ILP is definite clause logic, as embodied in the logic programming language Prolog.  ...  Because of its richness and simple declarative form, definite clause logic is suitable for areas of computer science as diverse as relational databases and graph algorithms, and for application areas as  ...  Much of logic programming research in recent years has gone into extending the boundaries of the representation, for example by moving to higher-order logic or removing the definite-clause restriction  ... 
doi:10.1023/a:1007399922151 dblp:journals/ml/MuggletonP97 fatcat:5hvmlp5kh5f57onrelmzbflduq

BI Hyperdoctrines and Higher-Order Separation Logic [chapter]

Bodil Biering, Lars Birkedal, Noah Torp-Smith
2005 Lecture Notes in Computer Science  
logic to higher-order.  ...  Moreover, we introduce the notion of a BI hyperdoctrine and show that it soundly models classical and intuitionistic first-and higher-order predicate BI, and use it to show that we may easily extend separation  ...  Acknowledgements: The authors wish to thank Carsten Butz and the anonymous referees for their helpful comments and suggestions.  ... 
doi:10.1007/978-3-540-31987-0_17 fatcat:z2gmsmoirngnblxwrxmsnv5uye

Higher-order representation predicates in separation logic

Arthur Charguéraud
2016 Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs - CPP 2016  
Such higher-order representation predicates can be used in particular to control whether containers should own their items.  ...  In Separation Logic, representation predicates are used to describe mutable data structures, by establishing a relationship between the entry point of the structure, the piece of heap over which this structure  ...  Acknowledgements I wish to thank François Pottier for fruitful discussions. This research was partly supported by the French national research organization ANR (grant ANR-15-CE25-0008).  ... 
doi:10.1145/2854065.2854068 dblp:conf/cpp/Chargueraud16 fatcat:ahro5yei3bhbbcmsakfjbhgnny

Extensional Higher-Order Logic Programming

Angelos Charalambidis, Konstantinos Handjopoulos, Panagiotis Rondogiannis, William W. Wadge
2013 ACM Transactions on Computational Logic  
We propose a purely extensional semantics for higher-order logic programming.  ...  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.  ...  There have also been a few attempts to define extensional higher-order logic programming systems.  ... 
doi:10.1145/2499937.2499942 fatcat:ek66hrnijjawbofxnnnq4ymksq

Page 3618 of Mathematical Reviews Vol. , Issue 95f [page]

1995 Mathematical Reviews  
. _ Summary: “Are higher-order extensions to logic programming needed? We suggest a negative answer by showing that higher- order features are already available in pure logic programming.  ...  Further, we show that such higher-order techniques correspond to program- ming techniques often employed in logic programming.”  ... 

Extensional Higher-Order Logic Programming [chapter]

Angelos Charalambidis, Konstantinos Handjopoulos, Panos Rondogiannis, William W. Wadge
2010 Lecture Notes in Computer Science  
We propose a purely extensional semantics for higher-order logic programming.  ...  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.  ...  There have also been a few attempts to define extensional higher-order logic programming systems.  ... 
doi:10.1007/978-3-642-15675-5_10 fatcat:wttojqsxsbh2vayedz6wzd6leq
« Previous Showing results 1 — 15 out of 47,528 results