In a relational setting, the maximum entropy model of a set of probabilistic conditionals can be defined referring to the full set of ground instances of the conditionals. The logic FO-PCL uses the notion of parametric uniformity to ensure that the full grounding of the conditionals can be avoided, thereby greatly simplifying the maximum entropy model computation. In this paper, we describe a s...

We present a way of classifying the logically possible ways out of Gärdenfors’ inconsistency or triviality result on belief revision with conditionals. For one of these ways—conditionals which are not descriptive but which only have an inferential role as being given by the Ramsey test—we determine which of the assumptions in three different versions of Gärdenfors’ theorem turn out to be false....

Conditionals play a prominent role in human reasoning and, hence, all cognitive theories try to evaluate conditionals like humans do. In this paper, we are particularly interested in theWeak Completion Semantics, a new cognitive theory based on logic programming, the weak completion of a program, the three-valued Łukasiewicz logic, and abduction. We show that the evaluation of conditionals with...

Why do utterances of counterfactual conditionals typically, but not universally, convey the message that their antecedents are false? I demonstrate that two common theoretical commitments–commitment to the existence of scalar implicature and of informative presupposition–can be supplemented with an independently motivated theory of the presuppositions of competing conditional alternatives to jo...