Sciweavers

349 search results - page 51 / 70
» The Finite and the Infinite
Sort
View
CSFW
2009
IEEE
14 years 1 months ago
Specification and Analysis of Dynamic Authorisation Policies
This paper presents a language, based on transaction logic, for specifying dynamic authorisation policies, i.e., rules governing actions that may depend on and update the authoris...
Moritz Y. Becker
CIE
2009
Springer
14 years 1 months ago
Functions Definable by Arithmetic Circuits
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
Ian Pratt-Hartmann, Ivo Düntsch
AAAI
2006
13 years 11 months ago
On the Difficulty of Achieving Equilibrium in Interactive POMDPs
We analyze the asymptotic behavior of agents engaged in an infinite horizon partially observable stochastic game as formalized by the interactive POMDP framework. We show that whe...
Prashant Doshi, Piotr J. Gmytrasiewicz
IJCAI
1997
13 years 11 months ago
A Set-Theoretic Approach to Automated Deduction in Graded Modal Logics
In the paper, we consider the problem of supporting automated reasoning in a large class of knowledge representation formalisms, including terminological and epistemic logics, who...
Angelo Montanari, Alberto Policriti
CORR
2008
Springer
72views Education» more  CORR 2008»
13 years 10 months ago
Statistical Learning of Arbitrary Computable Classifiers
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...
David Soloveichik