The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 476 of Mathematical Reviews Vol. , Issue 98A
[page]
1998
Mathematical Reviews
Preserved Fulltext
the whole class of all disjunctive programs). ...
We show that constructive negation by pruning specializes for these classes of programs to a more efficient concurrent branch-and-bound-like procedure.”
98a:68025 68N17
Gergatsoulis, Manolis (GR-NRC-TC ...
Overlapping Rules and Logic Variables in Functional Logic Programs
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Motivation Functional logic languages [20] integrate the best features of functional and logic languages in order to provide a variety of programming concepts. ...
The proposed transformations between different classes of programs not only give a better understanding of the features of functional logic programs but also may simplify implementations of functional ...
For instance, the concepts of demand-driven evaluation and higher-order functions from functional programming can be combined with logic programming features like computing with partial information (logic ...
doi:10.1007/11799573_9
fatcat:lv77o7sgdvfnbhdoeyiepdzqfi
The relation between logic and functional languages: a survey
1986
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A specific efficient strategy (called inner superposition) [24] has been proposed, which is complete for a wide class of programs. ...
Functional languages offer a variety of powerful programming concepts (higher-order functions, lazy evaluation and streams, types and polymorphism), which are difficult to cast in the standard logic-programming ...
Let us finally remark that higher-order features could play a very important role in logic programs, in addition to what is relevant to programming in general. ...
doi:10.1016/0743-1066(86)90014-2
fatcat:kzu7tvyz2fajvlsl767fgczjfe
Predicate Specialization for Definitional Higher-order Logic Programs
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
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 ...
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. ...
Partial Evaluation of Logic Programs Partial evaluation [8] is a program optimization that specializes a given program according to a specific set of input data, such that the new program is more efficient ...
arXiv:1808.04176v2
fatcat:3s6pnadanjdipgab6atnxktavy
An Implementation of Bubbling
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Non-determinism is of great importance in functional logic programming. It provides expressiveness and efficiency to functional logic computations. ...
In this paper we describe an implementation of the multi-paradigm functional logic language Curry. ...
Logic programming is based on Horn clause logic, a subset of first order logic. ...
arXiv:1112.3789v1
fatcat:q6bduregvzaxdaeqt3zvbmujti
Stream Reasoning on Expressive Logics
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Hence new techniques for optimizing this continuous process is needed for developing efficient reasoners on streaming data. ...
Typically reasoning services on large knowledge bases are very expensive, and need to be applied continuously when the data is received as a stream. ...
of first order and second order logics. ...
arXiv:1808.04738v2
fatcat:jnvdry2frfcd7g7vvz3v5dudk4
Evaluation strategies for functional logic programming
2005
Journal of symbolic computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper discusses the elements that play a relevant role in evaluation strategies for functional logic computations, describes some important classes of rewrite systems that model functional logic programs ...
Recent advances in the foundations and the implementations of functional logic programming languages originate from far-reaching results on narrowing evaluation strategies. ...
Acknowledgements I would like to thank Bernhard Gramlich and Salvador Lucas Alba for inviting me to write a preliminary version of this paper for the International Workshop on Reduction Strategies in Rewriting ...
doi:10.1016/j.jsc.2004.12.007
fatcat:swjeqk5wgfaf3nai5v5ufuws7q
Evaluation Strategies for Functional Logic Programming
2001
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper discusses the elements that play a relevant role in evaluation strategies for functional logic computations, describes some important classes of rewrite systems that model functional logic programs ...
Recent advances in the foundations and the implementations of functional logic programming languages originate from far-reaching results on narrowing evaluation strategies. ...
Acknowledgements I would like to thank Bernhard Gramlich and Salvador Lucas Alba for inviting me to write a preliminary version of this paper for the International Workshop on Reduction Strategies in Rewriting ...
doi:10.1016/s1571-0661(04)00265-8
fatcat:zpcju56vxba7dlr5uq4cyr7gma
Page 6675 of Mathematical Reviews Vol. , Issue 94k
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Unfortunately, this may prevent the partial evaluation achieving its aim of producing a more efficient program. ...
Summary: “This paper presents some supporting transformations for the partial evaluation of logic programs. A logic language is often used to specify a program. ...
Introduction to the 30th International Conference on Logic Programming Special Issue
2014
Theory and Practice of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
as a special issue of Theory and Practice of Logic Programming (TPLP) - the30th International Conference on Logic Programming Special Issue. ...
The 30th edition of the International Conference of Logic Programming took place in Vienna in July 2014 at the Vienna Summer of Logic - the largest scientific conference in the history of logic. ...
An FOL-program consists of a background theory in a decidable fragment of first-order logic and a collection of rules possibly containing first-order formulas. ...
doi:10.1017/s1471068414000581
fatcat:6fczd6mhxjcutozkk6t23lvn5e
Reduction Strategies for Declarative Programming
2001
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
On the other hand, they should also support the programmers to write programs in a declarative way ignoring the influence of the evaluation strategy to the success of a computation as good as possible. ...
This paper surveys reduction or evaluation strategies for functional and functional logic programs. ...
The restriction to constructor-based rules enables the definition of efficient strategies for large classes of programs. ...
doi:10.1016/s1571-0661(04)00273-7
fatcat:jtcnfes5ireuxlctdpm6nxkehm
Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
More specifically, we provide polynomial reductions of the basic reasoning tasks associated with these logics into the evaluation problem of QBFs. ...
We incorporated our encodings within the system QUIP and tested their performance on a class of benchmark problems using different underlying QBF-solvers. ...
In order to conduct some experimental evaluation of our translations, we tested their implementation in the system QUIP based on a class of benchmark problems using different underlying QBF-solvers. ...
doi:10.1007/3-540-45616-3_8
fatcat:5yzrmskpq5a45j7tzrch6qj6ja
Scenario Oriented Program Slicing for Large-Scale Software through Constraint Logic Programming and Program Transformation
2018
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
And constraint logic programming has been shown to be a powerful, flexible formalism to reason about the correctness of programs. ...
program slicing in constraint logical programming programs; and 3) deriving a scenariooriented program slicing algorithm. ...
The program transformation is generally to translate the program of easy-to-understand but not-efficiently-executed into a program with higher execution efficiency, and to ensure the correctness of the ...
doi:10.1109/access.2018.2853153
fatcat:suquzycm75fqxjzxq537rfvohu
(Agnostic) PAC Learning Concepts in Higher-Order Logic
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. ...
As a direct consequence, a number of non-trivial results in the higher-order setting can be established with straightforward proofs. ...
Within ILP, there is a rich body of work on the PAClearnability (and non-PAC-learnability) of different classes of first-order logic programs. See, for surveys, [9] and [5] . ...
doi:10.1007/11871842_71
fatcat:b2yaqxw2zbdtffe7prqperente
Page 6228 of Mathematical Reviews Vol. , Issue 96j
[page]
1996
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Although the paper concentrates on a class of efficiently executable programs, the op- timizations we describe are correct and applicable for arbitrary constraint logic programs. ...
Summary: “The near-Horn Prolog procedures have been pro- posed as effective procedures in the area of disjunctive logic pro- gramming, an extension of logic programming to the (first-order) non-Horn clause ...
« Previous
Showing results 1 — 15 out of 239,213 results