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.
Filters
Relating data-parallelism and (and-) parallelism in logic programs
[chapter]
1995
Lecture Notes in Computer Science
Preserved Fulltext
Much work has been done in the áreas of and-parallelism and data parallelism in Logic Programs. Such work has proceeded to a certain extent in an independent fashion. ...
Data parallelism techniques on the other hand offer increased performance for a restricted class of programs. ...
On the other hand, much progress has also been made (and continúes to be made) in the exploitation of parallelism in logic programs based on control-derived notions such as andparallelism and or-parallelism ...
doi:10.1007/bfb0020453
fatcat:lrawefi3ijhgfba2y7gp5374iq
Relating data-parallelism and (and-) parallelism in logic programs
1996
Computer languages
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.
Much work has been done in the áreas of and-parallelism and data parallelism in Logic Programs. Such work has proceeded to a certain extent in an independent fashion. ...
Data parallelism techniques on the other hand offer increased performance for a restricted class of programs. ...
On the other hand, much progress has also been made (and continúes to be made) in the exploitation of parallelism in logic programs based on control-derived notions such as andparallelism and or-parallelism ...
doi:10.1016/s0096-0551(96)00011-2
fatcat:mfjnmhene5evhc6klyz7bs7qja
Logical process size in parallel simulations
1996
Proceedings of the 28th conference on Winter simulation - WSC '96
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 2015; you can also visit the original URL.
The file type is application/pdf.
Most existing synchronization protocols require that the simulation application be partitioned and mapped to logical processes to make it suitable for parallel execution. ...
This question is studied in the context of a Time Warp-based parallel simulator. ...
ACKNOWLEDGEMENTS This \vork was supported by NSF Grant Number CDA-9501637 and NCR-9527163. ...
doi:10.1145/256562.256778
fatcat:m7ykec73brashhlmpdizgs3cgq
Using Attributed Variables in the Implementation of Concurrent and Parallel Logic Programming Systems
[chapter]
1995
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.
In this paper we propose a different and novel use for the concept of attributed variables: developing a generic parallel/concurrent (constraint) logic programming system, using the same "glass box" flavor ...
Incorporating the possibility of attaching attributes to variables in a logic programming system has been shown to allow the addition of general constraint solving capabilities to it. ...
This approach is very attractive in that it shows that by adding a few primitives any logic programming system can be turned into a generic constraint logic programming system in which constraint solving ...
doi:10.7551/mitpress/4298.003.0062
fatcat:iotgjlbponeifdofjge73qeiqi
Achieving scalability in parallel tabled logic programs
2002
Proceedings 16th International Parallel and Distributed Processing Symposium
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 2011; you can also visit the original URL.
The file type is application/pdf.
The declarative nature of tabled logic programming suggests that it might be amenable to parallel execution. ...
Tabling is of interest to logic programming because it addresses some of most significant weaknesses of Prolog. Namely, it can guarantee termination for programs with the bounded term-size property. ...
In this work we present and study the performance of what to the best of our knowledge is the first parallel tabling logic programming system, OPTYap. ...
doi:10.1109/ipdps.2002.1015488
dblp:conf/ipps/RochaSC02
fatcat:7onqcablqbhn5gfshsnvia7c5i
A Parallelized Theorem Prover for a Logic with Parallel Execution
[chapter]
2013
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 2016; you can also visit the original URL.
The file type is application/pdf.
Thus, our system not only incorporates parallelism into its proof process, but it also provides a platform for writing and verifying parallel programs written in the ACL2 programming language. ...
Since the ACL2 prover is written primarily in the ACL2 programming language, our approach to parallelization takes advantage of ACL2 language primitives for parallel execution. ...
We thank Robert Krug and Shilpi Goel for being early adopters of ACL2(p) and Jared Davis, Sung Jun Lim, J Strother ...
doi:10.1007/978-3-642-39634-2_31
fatcat:yp2gqdeo25fhdlctq7z523nx74
Parallel Abductive Query Answering in Probabilistic Logic Programs
2013
ACM Transactions on Computational Logic
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.
P., Sliva, A., and Subrahmanian, V. S. 2013. Parallel abductive query answering in probabilistic logic programs. ...
We conclude with an extensive report on experimental evaluations performed over prototype implementations of the algorithms developed for both BAQA and CBQA, showing that our parallel algorithms work well ...
The authors gratefully acknowledge funding support for this work provided to the Lab for Computational Cultural Dynamics (LCCD) by the Army Research Office under grants W911NF0910206 and W911NF1110344, ...
doi:10.1145/2480759.2480764
fatcat:x6crdgb76vexrodq5zua5sc37i
Past and present (and future) of parallel and distributed computation in (constraint) logic programming
2018
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 2019; you can also visit the original URL.
The file type is application/pdf.
The potential for transparent exploitation of parallelism in logic programming emerged almost immediately with the birth of the paradigm (Pollard 1981). ...
A declarative language, being not procedural, removes the need to perform operations in a strict order and reduces the number of dependencies among operations, thus opening the doors for concurrent execution ...
domains and potential applications (e.g., big data), and the developments in novel logic programming languages and paradigms are creating new research opportunities and fueling new ideas and developments ...
doi:10.1017/s1471068418000406
fatcat:fzevnnrn5bg6pmevaykleqkxxi
Speculative Computations in Or-Parallel Tabled Logic Programs
[chapter]
2004
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 2011; you can also visit the original URL.
The file type is application/pdf.
Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary computations. ...
In this work we discuss the problems behind the management of speculative computations in or-parallel tabled logic programs. ...
and Programa POSI. ...
doi:10.1007/978-3-540-27775-0_18
fatcat:7r3mkox2yrh2bi6knzv5ak4a3m
SLDR-resolution: Parallelizing structural recursion in logic programs
1995
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 2019; you can also visit the original URL.
The file type is application/pdf.
t> We introduce a new operational semantics, SLDR-resolution, for a class of recursive logic programs. ...
Another new idea in compilation of SLDRresolution is to exploit the technique of loop parallelization, which was developed in the context of imperative programming in the early 1970s. ...
RELATED WORK Tiirnlund first noted that complete unfolding of the recursion in a logic program vastly increases the potential for AND-parallel execution [14] . ...
doi:10.1016/0743-1066(95)00036-j
fatcat:uwo6b7yqpncwpblz65oiobkexu
Parallel algorithms development for programmable logic devices
2006
Advances in Engineering Software
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.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2019 pre-print arXiv:1904.03756v1 fatcat:nh4ca4gdszfcfjcqzrpowxkcgeOther Versions
A functional programming notation is used for specifying algorithms and for reasoning about them. ...
Programmable Logic Devices (PLDs) continue to grow in size and currently contain several millions of gates. ...
The formalisation in CSP (of the parallel behaviour) leads to better understanding and allows for analysis of performance issues. ...
doi:10.1016/j.advengsoft.2006.01.009
fatcat:fmlpok2bdnbzzpkpr3u4lakyfy
Binding environments for parallel logic programs in non-shared memory multiprocessors
1988
International journal of parallel 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 2010; you can also visit the original URL.
The file type is application/pdf.
This paper introduces a new technique for representing variable bindings in parallel logic programs. ...
The technique, known as closed environments, was designed for programs of the AND/OR Process Model, which exploits AND parallelism in addition to OR parallelism, but it may be applicable to parallel Prolog ...
Acknowledgements Many thanks to Paul Bloch, David Meyer, Nitin More, Don Pate, and Tsuyoshi Shinogi for patiently listening to early versions of this paper, and for discussions that sparked many of the ...
doi:10.1007/bf01383953
fatcat:j4z2oe4nmrdizhusf4mn72kgti
Prefix Parallel Adder Virtual Implementation in Reversible Logic
2007
2007 IEEE Region 5 Technical Conference
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.
We investigate the size and speed of such a reversible logic implementation of the Brent-Kung Parallel Prefix Adder (PPA) in comparison to a standard logic implementation. ...
This paper demonstrates a simplified approach for reversible logic synthesis based on direct translation of the circuit VHDL description into virtual Fredkin gates. ...
This approach was later improved by Brent and Kung [3] for reduced fanout, thus making it potentially suitable for future use in reversible logic. ...
doi:10.1109/tpsd.2007.4380355
fatcat:z45kptibrzcanfe4niooee7w2a
A Parallel Linear Temporal Logic Tableau
2017
Electronic Proceedings 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 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2017 pre-print arXiv:1709.02101v1 fatcat:avidwohhibezfhuzavbpirasza
However, a recently developed branch-independent tableaux for the common LTL temporal logic should intuitively be easy to parallelise as each branch can be developed independently. ...
For many applications, we are unable to take full advantage of the potential massive parallelisation offered by supercomputers or cloud computing because it is too hard to work out how to divide up the ...
Thus, the shortage of prior parallel tableau may be explained by the vast potential for performance improvements in serial algorithms. ...
doi:10.4204/eptcs.256.12
fatcat:jozduljccbehffks2u572gramu
OR-parallel PROLOG in flat concurrent PROLOG
1989
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 2019; you can also visit the original URL.
The file type is application/pdf.
For a large class of programs the algorithm has U(log n) overhead and exhibits O(n/(log n)2) parallel speedup over the standard sequential algorithm. ...
Its constituent parallel processes are-independent, and hence the algorithm is suitable for implementation on non-shared-memory parallel computers. ...
It also has the advantage of being embedded in a sophisticated development environment for concurrent programming [18] , and in an operating system with powerful tools for implementing process and code ...
doi:10.1016/0743-1066(89)90016-2
fatcat:ee6xvsrjkfc3bnj7q72hdcfi4e
« Previous
Showing results 1 — 15 out of 243,045 results