Sciweavers

29918 search results - page 114 / 5984
» A computational model of belief
Sort
View
DALT
2005
Springer
15 years 12 months ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
TARK
2009
Springer
16 years 26 days ago
Logical omniscience as a computational complexity problem
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
Sergei N. Artëmov, Roman Kuznets
HPDC
2006
IEEE
16 years 11 days ago
Filecules in High-Energy Physics: Characteristics and Impact on Resource Management
Grid computing has reached the stage where deployments are mature and many collaborations run in production mode. Mature Grid deployments offer the opportunity for revisiting and ...
Adriana Iamnitchi, Shyamala Doraimani, Gabriele Ga...
WSC
2004
15 years 7 months ago
Simulation CT-Scan: A Marketing Perspective
There is a general understanding in the simulation community that simulation is not reaching its full potential and is not widely used despite its well-known (among simulationists...
Leonardo Chwif, Marcos Ribeiro Pereira Barretto
POPL
2006
ACM
16 years 6 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam