7456 search results - page 398 / 1492 » Parallelism in Logic Programming |
202
click to vote
ASP
2005
Springer
16 years 9 days ago
2005
Springer
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
172
click to vote
IJIT
2004
15 years 8 months ago
2004
In this paper, we describe a rule-based message passing method to support developing collaborative applications, in which multiple users share resources in distributed environments...
233
Voted
ALP
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
163
click to vote
IEEEPACT
2007
IEEE
16 years 1 months ago
2007
IEEE
Transactional Memory (TM) simplifies parallel programming by supporting atomic and isolated execution of user-identified tasks. To date, TM programming has required the use of l...
158
click to vote
AGP
2003
IEEE
16 years 1 days ago
2003
IEEE
There are very few approaches to measure the execution costs of lazy functional (logic) programs. The use of a lazy execution mechanism implies that the complexity of an evaluation...