![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
11th ICLP 1994, Workshop W6: Parallel and Data Parallel Execution of Logic Programs
- Jonas Barklund, Bharat Jayaraman, Jiro Tanaka:
Parallel and Data Parallel Execution of Logic Programs, Proceedings of the Post-ICLP'94 Workshop W6. UPMAIL Technical Report No. 78, June 1994. Uppsala University, Computing Science Departent 1994 - Olivier Michel, Jean-Louis Giavitto:
Design and Implementation of a Declarative Data-Parallel Language. 1-10 - Arvind K. Bansal:
Towards a Formal Computation Model of Associative Logic Programming. 11-20 - Giancarlo Succi, Giuseppe Marino, Giancarlo Colla:
Modelling the Connection Machine 2 as an Emulator of Subset-Based Declarative Languages. 21-32 - Donald A. Smith:
Modeling Backtracking, Disjunctive Constraints, and Control/Data Or-Parallelism. 33-47 - Manuel V. Hermenegildo, Manuel Carro:
A Note on Data-Parallelism and (And-Parallel) Prolog. 49-64 - Enrico Pontelli, Gopal Gupta, Manuel V. Hermenegildo:
&ACE: the And-parallel Component of ACE (A Progress Report on ACE). 65-78 - Bart Demoen, Greet Maris:
A Comparison of Some Schemes for Translating Logic to C. 79-91 - Dongxing Tang, Enrico Pontelli, Gopal Gupta, Manuel Carro:
Last Parallel Call Optimization and Fast Backtracking in And-parallel Logic Programming Systems. 93-106 - M. J. Fernández, Manuel Carro, Manuel V. Hermenegildo:
IDRA (IDeal Resource Allocation): A Tool for Computing Ideal Speedups. 107-122
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.