PP-2008-55: Probabilistic Dependence Logic

PP-2008-55: Galliani, Pietro (2008) Probabilistic Dependence Logic. [Report]

Text (Full Text)

Download (252kB) | Preview
[img] Text (Abstract)

Download (705B)


Given a finite model M, it is possible to associate to every sentence φ of Backslash Logic and Dependence Logic the value of the corresponding imperfect information game H(φ), that is, the best average payoff that the Verifier can guarantee when both players are allowed to play random moves. Hodges' compositional semantics can then be adapted to this new logic, and the value of atomic dependence formulas in the resulting framework is seen to correspond to one of Kivinen and Mannila's measures of approximate functional dependency.

Item Type: Report
Report Nr: PP-2008-55
Series Name: Prepublication (PP) Series
Year: 2008
Uncontrolled Keywords: Semantic Games; Dependence Logic; Imperfect Information; Probabilistic Logic; Nash Equilibria
Depositing User: pgallia1
Date Deposited: 12 Oct 2016 14:37
Last Modified: 12 Oct 2016 14:37
URI: https://eprints.illc.uva.nl/id/eprint/329

Actions (login required)

View Item View Item