Sciweavers

827 search results - page 14 / 166
» Proof-Theoretic Soundness and Completeness
Sort
View
ECML
2007
Springer
14 years 1 months ago
Safe Q-Learning on Complete History Spaces
In this article, we present an idea for solving deterministic partially observable markov decision processes (POMDPs) based on a history space containing sequences of past observat...
Stephan Timmer, Martin Riedmiller
HPCA
2009
IEEE
14 years 8 months ago
Fast complete memory consistency verification
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new na...
Yunji Chen, Yi Lv, Weiwu Hu, Tianshi Chen, Haihua ...
ICCHP
1994
Springer
13 years 11 months ago
Synthesizing Non-Speech Sound to Support Blind and Visually Impaired Computer Users
This paper describes work in progress on automatic generation of "impact sounds" based on physical modelling. These sounds can be used as non-speech audio presentation of...
Alireza Darvishi, Valentin Guggiana, Eugen Muntean...
IFL
2001
Springer
14 years 2 days ago
Proving the Correctness of the STG Machine
Abstract. J. Launchbury gave an operational semantics for lazy evaluation and showed that it is sound and complete w.r.t. a denotational s of the language. P. Sestoft then introduc...
Alberto de la Encina, Ricardo Pena
DLOG
2010
13 years 5 months ago
Towards Soundness Preserving Approximation for ABox Reasoning of OWL2
ABox Reasoning in large scale description logic (DL) knowledge bases, e.g. ontologies, is important for the success of many semantic-enriched systems. Performance of existing appro...
Yuan Ren, Jeff Z. Pan, Yuting Zhao