3134 search results - page 41 / 627 » Computing full disjunctions |
PODC
2000
ACM
14 years 2 months ago
2000
ACM
Distributed programs are hard to write. A distributed debugger equipped with the mechanism to re-execute the traced computation in a controlled fashion can greatly facilitate the ...
SC
2005
ACM
14 years 3 months ago
2005
ACM
We describe the software architecture, technical features, and performance of TICK (Transparent Incremental Checkpointer at Kernel level), a system-level checkpointer implemented ...
DBISP2P
2005
Springer
14 years 3 months ago
2005
Springer
We propose a novel approach for de ning and querying a super-peer within a schema-based super-peer network organized into a two-level architecture: the low level, called the peer l...
SEMWEB
2004
Springer
14 years 3 months ago
2004
Springer
Both OWL-DL and function-free Horn rules3 are decidable logics with interesting, yet orthogonal expressive power: from the rules perspective, OWL-DL is restricted to tree-like rule...
ICLP
1987
Springer
14 years 1 months ago
1987
Springer
The Near-Horn Prolog procedures have been proposed as e ective procedures in the area of disjunctive logic programming, an extension of logic programming to the ( rstorder) non-Ho...