Sciweavers

443 search results - page 40 / 89
» Partial Probability: Theory and Applications
Sort
View
LPNMR
1993
Springer
15 years 3 months ago
An Assumption-Based Framework for Non-Monotonic Reasoning
The notion of assumption-based framework generalises and re nes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-mon...
Andrei Bondarenko, Francesca Toni, Robert A. Kowal...
86
Voted
SIGMOD
2004
ACM
170views Database» more  SIGMOD 2004»
15 years 11 months ago
A Formal Analysis of Information Disclosure in Data Exchange
We perform a theoretical study of the following queryview security problem: given a view V to be published, does V logically disclose information about a confidential query S? The...
Gerome Miklau, Dan Suciu
ICFEM
2007
Springer
15 years 3 months ago
Automating Refinement Checking in Probabilistic System Design
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
Carlos Gonzalia, Annabelle McIver
ATAL
2010
Springer
14 years 11 months ago
PAC-MDP learning with knowledge-based admissible models
PAC-MDP algorithms approach the exploration-exploitation problem of reinforcement learning agents in an effective way which guarantees that with high probability, the algorithm pe...
Marek Grzes, Daniel Kudenko
AI
2008
Springer
14 years 11 months ago
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
Jürg Kohlas, Nic Wilson