We investigate an approach for drawing logical inference from inconsistent premisses. The main idea in this approach is that the inconsistencies in the premisses should be interpreted as uncertainty of the information. We propose a mechanism, based on Kinght’s [14] study of inconsistency, for revising an inconsistent set of premisses to a minimally uncertain, probabilistically consistent one. We will then generalise the probabilistic entailment relation introduced in [15] for propositional languages to the first order case to draw logical inference from (...) a probabilistic set of premisses. We will show how this combination can allow us to limit the effect of uncertainty introduced by inconsistent premisses to only the reasoning on the part of the premise set that is relevant to the inconsistency. (shrink)

An important issue in the management of knowledge-based systems is the handling of inconsistency. This problem has recently been attracting a lot of attention from Artificial Intelligence community. When inconsistency occurs in a knowledge base, there are mainly two ways to deal with it; we either resolve it or accept inconsistency and cope with it. This paper tackles the problem of evaluating the amount of contradiction in propositional knowledge bases, and provides a new measure of conflict based on deductive argumentation (...) theory. Measuring the degree of conflict of a knowledge base can help us to deal with inconsistencies. Several semantic- and syntax-based approaches have been proposed separately. Given the pivotal role of argumentation in representing and handling inconsistency, in this paper, we use logical argumentation as a way to compute the inconsistency measure for propositional formulae. We show using the complete argumentation tree that our family of inconsistency measures is able to... (shrink)

I present two measures of information for both consistentand inconsistent sets of sentences in a finite language ofpropositional logic. The measures of information are based onmeasures of inconsistency developed in Knight (2002).Relative information measures are then provided corresponding to thetwo information measures.

1. Although the idea of measuring inconsistency was proposed in Grant (1978), the subject gained interest in 2002 with the publication of a proposal for measuring inconsistency in propositional kno...

Branching time logics have been studied in computer science since the 1980s primarily to model the tree of computations for discrete transition systems. Inconsistency measures for propositional log...

Consistency is one of the key concepts of logic; logicians have put a great deal of effort into proving the consistency of many logics. Understanding what causes inconsistency is also important; some logicians have developed paraconsistent logics that, unlike classical logics, allow some contradictions without making all formulas provable. Another direction of research studies inconsistency by measuring the amount of inconsistency of sets of formulas. While the initial attempt in 1978 was too ambitious in trying to do this for first-order (...) logic, this research got a substantial boost when an inconsistency measure was proposed for propositional logic in 2002. Since then, researchers in logic and artificial intelligence have made many interesting proposals and found related issues. Almost all of this work has been done for propositional logic. The purpose of this paper is to extend inconsistency measures to logics that also contain operators, such as modal operators. We use the terminology “generalized propositional logic” for such logics. We show how to extend propositional inconsistency measures to sets of formulas in any such generalized propositional logic. Examples are used to illustrate how various modal operators, including spatial and tense operators, fit into this framework. We also show that the addition of operators leads to a weak type of inconsistency. In all cases, the calculations for several inconsistency measures are given. (shrink)

The first mention of the concept of an inconsistency measure for sets of formulas in first-order logic was given in 1978, but that paper presented only classifications for them. The first actual inconsistency measure with a numerical value was given in 2002 for sets of formulas in propositional logic. Since that time, researchers in logic and AI have developed a substantial theory of inconsistency measures. While this is an interesting topic from the point of view of logic, an important motivation (...) for this work is also that some intelligent systems may encounter inconsistencies in their operation. This research deals primarily with propositional knowledge bases, that is, finite sets of propositional logic formulas. The goal of this paper is to extend the concept of inconsistency measure in a formal way to sets of formulas with the modal operators “necessarily” and “possibly” applied to propositional logic formulas. We use frames for the semantics, but in a way that is different from the way that frames are commonly used in modal logics, in order to facilitate measuring inconsistency. As a set of formulas may have different inconsistency measures for different frames, we define the concept of a standard frame that can be used for all finite sets of formulas in the language. We do this for two languages. The first language, AMPL, contains formulas where a prefix of operators is applied to a propositional logic formula. The second language, CMPL, adds connectives that can be applied to AMPL formulas in a limited way. We show how to extend propositional logic inconsistency measures to such sets of formulas. Finally, we define a new concept, weak inconsistency measure, and show how to compute it. (shrink)

This paper starts the systematic study of inconsistency measures for propositional logics enriched with operators involving time. We use Prior’s operators for tense logic: H, G, P, and F; however, we apply different semantics to them. We define two logics. The first one, ATPL, allows formulas with the application of any of the four operators any number of times to propositional logic formulas. The semantics is given in terms of TPL structures. We then show how to measure the inconsistency of (...) a set of ATPL formulas using appropriately modified versions of standard inconsistency measures for propositional logic. Additionally, these new measures are checked for the satisfaction of various properties. We also investigate a new concept of inconsistency that cannot be defined for propositional logic. Then, ATPL is extended to CTPL by applying the propositional connectives to ATPL formulas and measuring inconsistency is extended to sets of CTPL formulas. (shrink)

As consistency is such an important topic in logic, researchers have for a long time investigated how to attain and maintain it. But consistency can also be studied from the point of view of its opposite, inconsistency. The problem with inconsistency in classical logic is that by the principle of explosion a single inconsistency leads to triviality. Paraconsistent logics were introduced to get around this problem by defining logics in such a way that the explosion principle does not apply to (...) them. Another approach stays in the classical framework and evaluates the amount of inconsistency in a set of formulas. The great bulk of this work has been done for propositional logic and presents many interesting issues about inconsistency. A previous paper introduced the concept of generalized propositional logic (GPL) to provide a uniform method for measuring inconsistency in logics that allow the application of unary operator pairs, such as for modality, time, and space, to propositional logic formulas. The universality of GPL manifests itself in the fact that such an operator pair is evaluated in a uniform manner across all such logics. The difference lies solely in the choice of a frame for each logic. But some logics also contain nonunary operators. For example, temporal logics typically contain a binary Until operator. The purpose of this paper is to show how to extend generalized propositional logic to extended generalized propositional logic (EGPL) by adding nonunary operator pairs and measure inconsistency in such logics. The universality of EGPL manifests itself in the fact that once the evaluation of the nonunary operators is given, it carries over to all such logics. For example, the temporal Until operator becomes applicable to modal logic. Furthermore, while relative inconsistency measures were previously considered for GPL, they are now extended to EGPL and a new approach removes an undesirable feature from the previous version. Also, this paper provides results about various properties of the new inconsistency measures. Many examples and explanations are given to illustrate the issues involving this extension. (shrink)

The doctrinal paradox shows that aggregating individual judgments by taking a majority vote does not always yield a consistent set of collective judgments. Philip Pettit, Luc Bovens, and Wlodek Rabinowicz have recently argued for the epistemic superiority of an aggregation procedure that always yields a consistent set of judgments. This paper identifies several additional epistemic advantages of their consistency maintaining procedure. However, this paper also shows that there are some circumstances where the majority vote procedure is epistemically superior. The epistemic (...) value of maintaining consistency does not always outweigh the epistemic value of making true judgments. (shrink)

The logic of indicative conditionals remains the topic of deep and intractable philosophical disagreement. I show that two influential epistemic norms—the Lockean theory of belief and the Ramsey test for conditional belief—are jointly sufficient to ground a powerful new argument for a particular conception of the logic of indicative conditionals. Specifically, the argument demonstrates, contrary to the received historical narrative, that there is a real sense in which Stalnaker’s semantics for the indicative did succeed in capturing the logic of the (...) Ramseyan indicative conditional. (shrink)

The aim of this paper is to offer an account of epistemic justification suitable for the context of theory pursuit, that is, for the context in which new scientific ideas, possibly incompatible with the already established theories, emerge and are pursued by scientists. We will frame our account paradigmatically on the basis of one of the influential systems of epistemic justification: Laurence Bonjour’s coherence theory of justification. The idea underlying our approach is to develop a set of criteria which indicate (...) that the pursued system is promising of contributing to the epistemic goal of robustness of scientific knowledge and of developing into a candidate for acceptance. In order to realize this we will (a) adjust the scope of Bonjour’s standards—consistency, inferential density, and explanatory power, and (b) complement them by the requirement of a programmatic character. In this way we allow for the evaluation of the “potential coherence” of the given epistemic system. (shrink)

Revision operation is the consistent expansion of a theory by a new belief-representing sentence. We consider that in a paraconsistent setting this desideratum can be accomplished in at least three distinct ways: the output of a revision operation should be either non-trivial or non-contradictory (in general or relative to the new belief). In this paper those distinctions will be explored in the constructive level by showing how the remainder sets could be refined, capturing the key concepts of paraconsistency in a (...) dynamical scenario. These are preliminaries results of a wider project on Paraconsistent Belief Change conduced by the authors. (shrink)