General information in relevant logic

This paper sets out a philosophical interpretation of the model theory of Mares and Goldblatt (The Journal of Symbolic Logic 71, 2006). This interpretation distinguishes between truth conditions and information conditions. Whereas the usual Tarskian truth condition holds for universally quantified statements, their information condition is quite different. The information condition utilizes general propositions. The present paper gives a philosophical explanation of general propositions and argues that these are needed to give an adequate theory of general information.     

Temporal logics for concurrent recursive programs: Satisfiability and model checking

We develop a general framework for the design of temporal logics for concurrent recursive programs. A program execution is modeled as a partial order with multiple nesting relations. To specify properties of executions, we consider any temporal logic whose modalities are definable in monadic second-order logic and which, in addition, allows PDL-like path expressions. This captures, in a unifying framework, a wide range of logics defined for ranked and unranked trees, nested words, and Mazurkiewicz traces that have been studied separately. We show that satisfiability and model checking are decidable in EXPTIME and 2EXPTIME, depending on the precise path modalities.     

Model checking propositional dynamic logic with all extras

This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context-free programs. The algorithm shows that the model checking problem for PDL remains PTIME-complete in the presence of all these operators, in contrast to the high increase in complexity that they cause for the satisfiability problem.     

Maximum Entropy Inference with Quantified Knowledge

We investigate uncertain reasoning with quantified sentencesof the predicate calculus treated as the limiting case of maximumentropy inference applied to finite domains.     

Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams

We present a methodology for the verification of multi-agent systems, whose properties are specified by means of a modal logic that includes a temporal, an epistemic, and a modal operator to reason about correct behaviour of agents. The verification technique relies on model checking via ordered binary decision diagrams. We present an implementation and report on experimental results for two scenarios: the bit transmission problem with faults and the protocol of the dining cryptographers.     

Extending probabilistic dynamic epistemic logic

This paper aims to extend in two directions the probabilistic dynamic epistemic logic provided in Kooi’s paper (J Logic Lang Inform 12(4):381–408, 2003) and to relate these extensions to ones made in van Benthem et al. (Proceedings of LOFT’06. Liverpool, 2006). Kooi’s probabilistic dynamic epistemic logic adds to probabilistic epistemic logic sentences that express consequences of public announcements. The paper (van Benthem et al., Proceedings of LOFT’06. Liverpool, 2006) extends (Kooi, J Logic Lang Inform 12(4):381–408, 2003) to using action models, but in both papers, the probabilities are discrete, and are defined on trivial σ-algebras over finite sample spaces. The first extension offered in this paper is to add a previous-time operator to a probabilistic dynamic epistemic logic similar to Kooi’s in (J Logic Lang Inform 12(4):381–408, 2003). The other is to involve non-trivial σ-algebras and continuous probabilities in probabilistic dynamic epistemic logic.     

Dynamic epistemic logic with branching temporal structures

van Bentham et al. (Merging frameworks for interaction: DEL and ETL, 2007) provides a framework for generating the models of Epistemic Temporal Logic (ETL: Fagin et al., Reasoning about knowledge, 1995; Parikh and Ramanujam, Journal of Logic, Language, and Information, 2003) from the models of Dynamic Epistemic Logic (DEL: Baltag et al., in: Gilboa (ed.) Tark 1998, 1998; Gerbrandy, Bisimulations on Planet Kripke, 1999). We consider the logic TDEL on the merged semantic framework, and its extension with the labeled past-operator “P _ϵ” (“The event ϵ has happened before which. . .”). To axiomatize the extension, we introduce a method for transforming a given model into a normal form in a suitable sense. These logics suggest further applications of DEL in the theory of agency, the theory of learning, etc.     

Reasoning about update logic

Logical frameworks for analysing the dynamics of information processing abound [4, 5, 8, 10, 12, 14, 20, 22]. Some of these frameworks focus on the dynamics of the interpretation process, some on the dynamics of the process of drawing inferences, and some do both of these. Formalisms galore, so it is felt that some conceptual streamlining would pay off.This paper is part of a larger scale enterprise to pursue the obvious parallel between information processing and imperative programming. We demonstrate that logical tools from theoretical computer science are relevant for the logic of information flow. More specifically, we show that the perspective of Hoare logic [13, 18] can fruitfully be applied to the conceptual simplification of information flow logics.     

Honesty pays: On the benefits of having and disclosing information in coalition bargaining

People typically think of negotiations as competitive, which often leads them to engage in secrecy and even deception. In three experiments we show that this approach can backfire in coalition bargaining. Results show that, even though bargainers with an outcome advantage only obtain favorable outcomes when this information is public, they rarely choose to reveal this information. Fairness motivations fueled decisions to reveal this information and make attractive offers whereas self-interest fueled decisions not to reveal and make unattractive offers. Finally, perspective taking increased proselfs' inclinations to keep their advantage private whereas it increased prosocials' inclinations to reveal. These findings suggest that many people are not naturally inclined to reveal private information when they have an outcome advantage, but that fairness motives encourage revelation and, ironically, increase revealers' outcomes in coalition bargaining. Thus, in this context, honesty pays.     

Self-interest and fairness in coalition formation: A social utility approach to understanding partner selection and payoff allocations in groups

In this chapter we present a social utility approach to coalition formation. The central tenet of our approach is that outcome allocations and partner selection in multiparty situations are affected by self-interest and fairness. Inspired by the social utility model we argue that the relative weight assigned to both components is affected by structural aspects of the situation and individual characteristics of the negotiators. We first investigate how coalition bargainers substantiate their coalition demands. We show that bargainers are self-serving in their choice of allocation rules, indicating that perceptions of fairness can be coloured by self-interest. Second, we investigate how the alignment of self-interest and fairness fosters the formation of coalitions that maximise the payoffs of its members. Finally, we present a series of experiments that expands the notion of being fair to those who are excluded from a coalition. We show that bargainers are reluctant to benefit themselves when this harms the outcomes of others and that this is dependent on personal factors (e.g., social value orientations), situational factors (e.g., the valence of outcomes), and whether bargainers negotiate in an interindividual or in an intergroup setting.     

Reasoning about actions and obligations in first-order logic

We describe a new way in which theories about the deontic status of actions can be represented in terms of the standard two-sorted first-order extensional predicate calculus. Some of the resulting formal theories are easy to implement in Prolog; one prototype implementation—R. M. Lee's deontic expert shell DX—is briefly described.This research was partially supported by the Esprit III Basic Research Working Group No. 8319 ModelAge.