Sciweavers

305 search results - page 44 / 61
» A Connectionist Framework for Reasoning: Reasoning with Exam...
Sort
View
COLT
1999
Springer
13 years 12 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
ECTEL
2006
Springer
13 years 11 months ago
A Formal Model of Learning Object Metadata
In this paper, we introduce a new, formal model of learning object metadata. The model enables more formal, rigorous reasoning over metadata. An important feature of the model is t...
Kris Cardinaels, Erik Duval, Henk J. Olivié
ECAI
2008
Springer
13 years 9 months ago
Privacy-Preserving Query Answering in Logic-based Information Systems
Abstract. We study privacy guarantees for the owner of an information system who wants to share some of the information in the system with clients while keeping some other informat...
Bernardo Cuenca Grau, Ian Horrocks
CAV
2006
Springer
95views Hardware» more  CAV 2006»
13 years 11 months ago
Yasm: A Software Model-Checker for Verification and Refutation
Example Guided Abstraction Refinement (CEGAR) [6] framework. A number of wellengineered software model-checkers are available, e.g., SLAM [1] and BLAST [12]. Why build another one?...
Arie Gurfinkel, Ou Wei, Marsha Chechik
ATAL
2000
Springer
13 years 12 months ago
Agent Programming with Declarative Goals
A long and lasting problem in agent research has been to close the gap between agent logics and agent programming frameworks. The main reason for this problem of establishing a li...
Koen V. Hindriks, Frank S. de Boer, Wiebe van der ...