Sciweavers

120 search results - page 21 / 24
» New completeness results for lazy conditional narrowing
Sort
View
SOSP
2009
ACM
14 years 4 months ago
Better I/O through byte-addressable, persistent memory
Modern computer systems have been built around the assumption that persistent storage is accessed via a slow, block-based interface. However, new byte-addressable, persistent memo...
Jeremy Condit, Edmund B. Nightingale, Christopher ...
PODC
1999
ACM
13 years 12 months ago
Liveness-Preserving Simulation Relations
We present a new approach for reasoning about liveness properties of distributed systems, represented as automata. Our approach is based on simulation relations, and requires reas...
Paul C. Attie
ICCAD
1999
IEEE
66views Hardware» more  ICCAD 1999»
13 years 12 months ago
Timing-safe false path removal for combinational modules
A delay abstraction of a combinational module is a compact representation of the delay information of the module, which carries effective pin-to-pin delay for each primary-input/pr...
Yuji Kukimoto, Robert K. Brayton
ATAL
2008
Springer
13 years 9 months ago
Goal generation with relevant and trusted beliefs
A rational agent adopts (or changes) its goals when new information (beliefs) becomes available or its desires (e.g., tasks it is supposed to carry out) change. In conventional ap...
Célia da Costa Pereira, Andrea Tettamanzi
AI
2008
Springer
13 years 7 months ago
Expressive probabilistic description logics
The work in this paper is directed towards sophisticated formalisms for reasoning under probabilistic uncertainty in ontologies in the Semantic Web. Ontologies play a central role...
Thomas Lukasiewicz