Handling exceptions in a knowledge-based system is an important issue in many application domains, such as medical domain. Recently, there is an increasing interest in nonmonotonic extension of description logics to handle exceptions in ontologies. In this paper, we propose three preferential semantics for plausible subsumption to deal with exceptions in description logic-based knowledge bases. Our preferential semantics are defined in the framework of possibility theory, which is an uncertainty theory devoted to handling incomplete information. We consider the properties of (...) these semantics and their relationships. We also discuss the relationship between two of our preferential semantics and two existing preferential semantics. We extend a description logic-based knowledge base by adding preferential subsumptions. Entailment of plausible subsumptions relative to an extended knowledge base is defined. Properties of the preferential subsumption relations relative to an extended description logic-based knowledge base are discussed. Finally, we show that our semantics for plausible subsumption can be reduced to standard semantics of an expressive description logic. Thus, the problem of plausible subsumption checking under our semantics can be reduced to the problem of subsumption checking under the classical semantics. (shrink)

Various semantics for studying the square of opposition have been proposed recently. So far, only [14] studied a probabilistic version of the square where the sentences were interpreted by (negated) defaults. We extend this work by interpreting sentences by imprecise (set-valued) probability assessments on a sequence of conditional events. We introduce the acceptability of a sentence within coherence-based probability theory. We analyze the relations of the square in terms of acceptability and show how to construct probabilistic versions of the square (...) of opposition by forming suitable tripartitions. Finally, as an application, we present a new square involving generalized quantifiers. (shrink)

There is wide support in logic, philosophy, and psychology for the hypothesis that the probability of the indicative conditional of natural language, P(if A then B), is the conditional probability of B given A, P(B|A). We identify a conditional which is such that P(if A then B)=P(B|A) with de Finetti's conditional event, B|A. An objection to making this identification in the past was that it appeared unclear how to form compounds and iterations of conditional events. In this paper, we illustrate (...) how to overcome this objection with a probabilistic analysis, based on coherence, of these compounds and iterations. We interpret the compounds and iterations as conditional random quantities which, given some logical dependencies, may reduce to conditional events. We show how the inference to B|A from A and B can be extended to compounds and iterations of both conditional events and biconditional events. Moreover, we determine the respective uncertainty propagation rules. Finally, we make some comments on extending our analysis to counterfactuals. (shrink)

We generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of n conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional random quantities. We define the notion of negation, by verifying De Morgan’s Laws. We also show that conjunction and disjunction satisfy the associative and commutative properties, and a monotonicity property. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals; in particular (...) we examine the Fréchet-Hoeffding bounds. Moreover, we study the reverse probabilistic inference from the conjunction Cn+1 of n + 1 conditional events to the family {Cn,En+1|Hn+1}. We consider the relation with the notion of quasi-conjunction and we examine in detail the coherence of the prevision assessments related with the conjunction of three conditional events. Based on conjunction, we also give a characterization of p-consistency and of p-entailment, with applications to several inference rules in probabilistic nonmonotonic reasoning. Finally, we examine some non p-valid inference rules; then, we illustrate by an example two methods which allow to suitably modify non p-valid inference rules in order to get inferences which are p-valid. (shrink)

This position paper advocates combining formal epistemology and the new paradigm psychology of reasoning in the studies of conditionals and reasoning with uncertainty. The new paradigm psychology of reasoning is characterized by the use of probability theory as a rationality framework instead of classical logic, used by more traditional approaches to the psychology of reasoning. This paper presents a new interdisciplinary research program which involves both formal and experimental work. To illustrate the program, the paper discusses recent work on the (...) paradoxes of the material conditional, nonmonotonic reasoning, and Adams’ Thesis. It also identifies the issue of updating on conditionals as an area which seems to call for a combined formal and empirical approach. (shrink)

We present a unified approach for investigating rational reasoning about basic argument forms involving indicative conditionals, counterfactuals, and basic quantified statements within coherence-based probability logic. After introducing the rationality framework, we present an interactive view on the relation between normative and empirical work. Then, we report a new experiment which shows that people interpret indicative conditionals and counterfactuals by coherent conditional probability assertions and negate conditionals by negating their consequents. The data support the conditional probability interpretation of conditionals and the (...) narrow-scope reading of the negation of conditionals. Finally, we argue that coherent conditional probabilities are important for probabilistic analyses of conditionals, nonmonotonic reasoning, quantified statements, and paradoxes. (shrink)

We discuss O&C's probabilistic approach from a probability logical point of view. Specifically, we comment on subjective probability, the indispensability of logic, the Ramsey test, the consequence relation, human nonmonotonic reasoning, intervals, generalized quantifiers, and rational analysis.

This paper first provides a brief survey of a possibilistic handling of default rules. A set of default rules of the form, "generally, from α deduce β", is viewed as the family of possibility distributions satisfying constraints expressing that the situation where α and β is true has a greater plausibility than the one where α and ⇁β is true. When considering only the subset of linear possibility distributions, the well-known System P of postulates proposed by Kraus, Lehmann and Magidor, (...) has been obtained. We also present two rational extensions: one based on the minimum specificity principle and the other is based on the lexicographic ordering. The second part of the paper presents an empirical study of three desirable properties for a consequence relation that capture default reasoning: Rationality, Property Inheritance and Ambiguity Preservation. An experiment is conducted to investigate 13 patterns of inference for the test of these properties. Our experimental apparatus confirms previous results on the relevance of System P, and enforces the psychological relevance of the studied properties. (shrink)

We present new probabilistic generalizations of Pearl’s entailment in System Z and Lehmann’s lexicographic entailment, called Zλ- and lexλ-entailment, which are parameterized through a value λ ∈ [0,1] that describes the strength of the inheritance of purely probabilistic knowledge. In the special cases of λ = 0 and λ = 1, the notions of Zλ- and lexλ-entailment coincide with probabilistic generalizations of Pearl’s entailment in System Z and Lehmann’s lexicographic entailment that have been recently introduced by the author. We show (...) that the notions of Zλ- and lexλ-entailment have similar properties as their classical counterparts. In particular, they both satisfy the rationality postulates of System P and the property of Rational Monotonicity. Moreover, Zλ-entailment is weaker than lexλ-entailment, and both Zλ- and lexλ-entailment are proper generalizations of their classical counterparts. (shrink)

‘Incongruity is never superfluous’Thea Arbee (2016) Is the superfluous a (new) modality?11. Even if much has been written about ingredients that trigger laughter, researchers are still far from hav...

We study a probabilistic logic based on the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence). We examine probabilistic conditional knowledge bases associated with imprecise probability assessments defined on arbitrary families of conditional events. We introduce a notion of conditional interpretation defined directly in terms of precise probability assessments. We also examine a property of strong satisfiability which is related to the notion of toleration well known in default reasoning. In our framework we give more (...) general definitions of the notions of probabilistic consistency and probabilistic entailment of Adams. We also recall a notion of strict p-consistency and some related results. Moreover, we give new proofs of some results obtained in probabilistic default reasoning. Finally, we examine the relationships between conditional probability rankings and the notions of g-coherence and g-coherent entailment. (shrink)

ABSTRACT A trivalent theory of indicative conditionals automatically enforces Stalnaker's thesis – the equation between probabilities of conditionals and conditional probabilities. This result holds because the trivalent semantics requires, for principled reasons, a modification of the ratio definition of conditional probability in order to accommodate the possibility of undefinedness. I explain how this modification is motivated and how it allows the trivalent semantics to avoid a number of well-known triviality results, in the process clarifying why these results hold for many (...) bivalent theories. In short, the slew of triviality results published in the last 40-odd years need not be viewed as an argument against Stalnaker's thesis: it can be construed instead as an argument for abandoning the bivalent requirement that indicative conditionals somehow be assigned a truth-value in worlds in which their antecedents are false. (shrink)

Conditionals are most important objects in knowledge representation, commonsense reasoning and belief revision. Due to their non-classical nature, however, they are not easily dealt with. This paper presents a new approach to conditionals, which is apt to capture their dynamic power particularly well. We show how this approach can be applied to represent conditional knowledge inductively, and to guide revisions of epistemic states by sets of beliefs. In particular, we generalize system-Z* as an appropriate counterpart to maximum entropy-representations in a (...) semi-quantitative setting, and provide a theoretical justification to make its basic ideas usable also for belief revision. (shrink)

The variably strict analysis of conditionals does not only largely dominate the philosophical literature, since its invention by Stalnaker and Lewis, it also found its way into linguistics and psychology. Yet, the shortcomings of Lewis–Stalnaker’s account initiated a plethora of modifications, such as non-vacuist conditionals, presuppositional indicatives, perfect conditionals, or other conditional constructions, for example: reason relations, difference-making conditionals, counterfactual dependency, or probabilistic relevance. Many of these new connectives can be treated as strengthened or weakened conditionals. They are definable conditionals. (...) This article develops a technique to infer the logic for such definable conditionals from the known logic of the underlying defining conditional. The technique is applied to central examples. The results show that a large part of the zoo of conditionals arises from a basic conditional—a constant nucleus of the different contextual and conceptual variations of variably strict conditionals. (shrink)

We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore how probabilistic reasoning under coherence is related to model- theoretic probabilistic reasoning and to default reasoning in System . In particular, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabilistic logic with concepts from default reasoning. Moreover, we show that probabilistic reasoning under coherence is a generalization of default reasoning in System (...) . That is, we provide a new probabilistic semantics for System , which neither uses infinitesimal probabilities nor atomic bound (or big-stepped) probabilities. These results also provide new algorithms for probabilistic reasoning under coherence and for default reasoning in System , and they give new insight into default reasoning with conditional objects. (shrink)

Motivated by supplying a new strategy for connexive logic and a better semantics for conditionals so that negating a conditional amounts to negating its consequent under the condition, we propose a new semantics for connexive conditional logic, by combining Kleene’s three-valued logic and a slight modification of Stalnaker’s semantics for conditionals. In the new semantics, selection functions for selecting closest worlds for evaluating conditionals can be undefined. Truth and falsity conditions for conditionals are then supplemented with a precondition that the (...) selection function is defined. Based on the new semantics, we define six conditional logics by different classes of models, using two notions of validity, one preserving truth and the other preserving tolerant truth. We prove soundness and completeness of these logics and compare them with some conditional logics in the literature. Our partial function plus precondition strategy may be used in other semantic frameworks to generate more connexive logics. (shrink)