Sciweavers

449 search results - page 27 / 90
» Distributed Reasoning in a Peer-to-Peer Setting
Sort
View
PPOPP
2012
ACM
13 years 5 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
ASP
2005
Springer
15 years 3 months ago
Possibilistic Stable Model Computing
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...
Pascal Nicolas, Claire Lefèvre
ICLP
2004
Springer
15 years 3 months ago
Possible Worlds Semantics for Probabilistic Logic Programs
Abstract. In this paper we consider a logic programming framework for reasoning about imprecise probabilities. In particular, we propose a new semantics, for the Probabilistic Logi...
Alex Dekhtyar, Michael I. Dekhtyar
CADE
2010
Springer
14 years 11 months ago
MCMT: A Model Checker Modulo Theories
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
Silvio Ghilardi, Silvio Ranise
IPPS
1999
IEEE
15 years 2 months ago
Optimization Rules for Programming with Collective Operations
We study how several collective operations like broadcast, reduction, scan, etc. can be composed efficiently in complex parallel programs. Our specific contributions are: (1) a fo...
Sergei Gorlatch, Christoph Wedler, Christian Lenga...