Sciweavers

2432 search results - page 278 / 487
» Cryptographic logical relations
Sort
View
IJAR
2008
92views more  IJAR 2008»
15 years 6 months ago
Predicting causality ascriptions from background knowledge: model and experimental validation
A model is defined that predicts an agent's ascriptions of causality (and related notions of facilitation and justification) between two events in a chain, based on backgroun...
Jean-François Bonnefon, Rui Da Silva Neves,...
VMCAI
2012
Springer
14 years 2 months ago
A General Framework for Probabilistic Characterizing Formulae
Abstract. Recently, a general framework on characteristic formulae was proposed by Aceto et al. It offers a simple theory that allows one to easily obtain characteristic formulae o...
Joshua Sack, Lijun Zhang
FOSSACS
2009
Springer
16 years 1 months ago
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
Lars Birkedal, Kristian Støvring, Jacob Tha...
188
Voted
KR
2000
Springer
15 years 10 months ago
Anytime Diagnostic Reasoning using Approximate Boolean Constraint Propagation
In contrast with classical reasoning, where a solution is either correct or incorrect, approximate reasoning tries to compute solutions which are close to the ideal solution, with...
Alan Verberne, Frank van Harmelen, Annette ten Tei...
161
Voted
JAIR
2008
102views more  JAIR 2008»
15 years 6 months ago
An Ordinal Bargaining Solution with Fixed-Point Property
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...
Dongmo Zhang, Yan Zhang