The First International Workshop brings together researchers from the theoretical ends of the logic programming and artificial intelligence communities to discuss their mutual interests. Logic programming deals with the use of models of mathematical logic as a way of programming computers, where theoretical AI deals with abstract issues in modeling and representing human knowledge and beliefs. One common ground is nonmonotonic reasoning, a family of logics that includes room for the kinds of variations that can be found (...) in human reasoning. Topics covered: Stable Semantics. Default Logic. AutoEpistemic Logic. Truth Maintenance Systems. Implementation Issues. Diagnosis. Applications. Inheritance Reasoning. Logics of Belief. Inconsistency and Non-Monotonicity. (shrink)

The relationship between logics with sets of theorems including contradictions (“inconsistent logics”) and theories closed under such logics is investigated. It is noted that if we take “theories” to be defined in terms of deductive closure understood in a way somewhat different from the standard, Tarskian, one, inconsistent logics can have consistent theories. That is, we can find some sets of formulas the closure of which under some inconsistent logic need not contain any contradictions. We prove this in a (...) general setting for a family of relevant connexive logics, extract the essential features of the proof in order to obtain a sufficient condition for the consistency of a theory in arbitrary logics, and finally consider some concrete examples of consistent mathematical theories in Abelian logic. The upshot is that on this way of understanding deductive closure, common to relevant logics, there is a rich and interesting kind of interaction between inconsistent logics and their theories. We argue that this suggests an important avenue for investigation of inconsistent logics, from both a technical and a philosophical perspective. (shrink)

A typical theorem of conaexive logics is Aristotle''s Thesis(A), (AA).A cannot be added to classical logic without producing a trivial (Post-inconsistent) logic, so connexive logics typically give up one or more of the classical properties of conjunction, e.g.(A & B)A, and are thereby able to achieve not only nontriviality, but also (negation) consistency. To date, semantical modellings forA have been unintuitive. One task of this paper is to give a more intuitive modelling forA in consistent logics. In addition, (...) while inconsistent but nontrivial theories, and inconsistent nontrivial logics employing prepositional constants (for which the rule of uniform substitution US fails), have both been studied extensively within the paraconsistent programme, inconsistent nontrivial logics (closed under US) do not seem to have been. This paper gives sufficient conditions for a logic containingA to be inconsistent, and then shows that there is a class of inconsistent nontrivial logics all containingA. A second semantical modelling forA in such logics is given. Finally, some informal remarks about the kind of modellingA seems to require are made. (shrink)

One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results hold (...) for several systems of the hierarchy of paraconsistent logics known as Logics of Formal Inconsistency (LFIs). Because of this, these logics are uniquely characterized by semantics of non-deterministic kind. This paper offers a solution for two open problems in the domain of paraconsistency, in particular connected to algebraization of LFIs, by obtaining several LFIs weaker than C1, each of one is algebraizable in the standard Lindenbaum-Tarski's sense by a suitable variety of Boolean algebras extended with operators. This means that such LFIs satisfy the replacement property. The weakest LFI satisfying replacement presented here is called RmbC, which is obtained from the basic LFI called mbC. Some axiomatic extensions of RmbC are also studied, and in addition a neighborhood semantics is defined for such systems. It is shown that RmbC can be defined within the minimal bimodal non-normal logic E+E defined by the fusion of the non-normal modal logic E with itself. Finally, the framework is extended to first-order languages. RQmbC, the quantified extension of RmbC, is shown to be sound and complete w.r.t. BALFI semantics. (shrink)

We present the inconsistency-adaptive deontic logic DP r , a nonmonotonic logic for dealing with conflicts between normative statements. On the one hand, this logic does not lead to explosion in view of normative conflicts such as O A ∧ O ∼A, O A ∧ P ∼A or even O A ∧ ∼O A. On the other hand, DP r still verifies all intuitively reliable inferences valid in Standard Deontic Logic (SDL). DP r interprets a (...) given premise set ‘as normally as possible’ with respect to SDL. Whereas some SDL-rules are verified unconditionally by DP r , others are verified conditionally. The latter are applicable unless they rely on formulas that turn out to behave inconsistently in view of the premises. This dynamic process is mirrored by the proof theory of DP r. (shrink)

With the advent of classical logic we are continuing to observe an adherence to the laws of logic. Moreover, the system of classical logic exhibits a prominent role within analytic philosophy. Given that the laws of logic have persistently endured in actively defining classical logic and its preceding system of logic, it begs the question as to whether it actually proves to be consistent with Islam. To consider this inquiry in a broader manner; it (...) would be an investigation into the consistency between Islam and the logic which has been the predominant driving force of analytic philosophy. Despite the well documented engagement and novel contributions made in the field of logic by Arab and Islamic theologians/logicians, I think this question deserves examination not just in terms of classical logic but also from perspectives which go beyond classical logic, namely, non-classical logic. Doing so, would I believe, retain this inquiry within the purview of analytic philosophy despite the reference to non-classical logic. To be more specific, this question would be directed toward the Islamic theologian who espouses the system of classical logic in attempting to make sense of an absolute ineffable God of Islam. The inquiry would seek to determine if classical logic is consistent (amenable) in making sense of an absolute ineffable God of Islam. This would principally involve an analysis which determines whether the metaphysical assumptions of the laws of logic (more specifically the law of non-contradiction) are consistent in making sense of an absolute ineffable God of Islam. I shall argue that it is inconsistent. I shall establish my position on this matter by demonstrating why classical logic is inconsistent (not amenable) with an absolute ineffable God of Islam. Although, I am principally concerned with classical logic, my argument is as applicable to all earlier systems of logic as much as it is to classical logic. This is on the basis that both systems of logic, namely, all preceding systems and classical logic, consider the laws of logic as defining features. (shrink)

Even when inconsistencies are present in our premise set, we can sensibly distinguish between good and bad arguments relying on these premises. In making this distinction, the inconsistency-adaptive approach of Batens strikes a particularly nice balance between inconsistency-tolerance and inferential strength. In this paper, we use the machinery of Batens’ approach to extend the paraconsistent approach to dialogical logic as developed by Rahman and Carnielli. In bringing these frameworks closer together, we obtain a dynamic mechanism for the (...) systematic study of dialogues in which two parties exchange arguments over a central claim, in the possible presence of inconsistencies. (shrink)

This article proposes the meeting of fuzzy logic with paraconsistency in a very precise and foundational way. Specifically, in this article we introduce expansions of the fuzzy logic MTL by means of primitive operators for consistency and inconsistency in the style of the so-called Logics of Formal Inconsistency (LFIs). The main novelty of the present approach is the definition of postulates for this type of operators over MTL-algebras, leading to the definition and axiomatization of a family (...) of logics, expansions of MTL, whose degree-preserving counterpart are paraconsistent and moreover LFIs. (shrink)

The old quantum theory of black body radiation was manifestly logically inconsistent. It required the energies of electric resonators to be both quantized and continuous. To show that this manifest inconsistency was inessential to the theory's recovery of the Planck distribution law, I extract a subtheory free of this manifest inconsistency but from which Planck's law still follows.

In this paper, I will characterize a new class of inconsistency-adaptive logics, namely inconsistency-adaptive modal logics. These logics cope with inconsistencies in a modal context. More specifically, when faced with inconsistencies, inconsistency-adaptive modal logics avoid explosion, but still allow the derivation of sufficient consequences to adequately explicate the part of human reasoning they are intended for.

This paper concerns the paraconsistent logic LPQ⊃,F and an application of it in the area of relational database theory. The notions of a relational database, a query applicable to a relational database, and a consistent answer to a query with respect to a possibly inconsistent relational database are considered from the perspective of this logic. This perspective enables among other things the definition of a consistent answer to a query with respect to a possibly inconsistent database without resort (...) to database repairs. In an earlier paper, LPQ⊃,F is presented with a sequent-style natural deduction proof system. In this paper, a sequent calculus proof system is presented instead because such proof systems are generally considered more suitable as the basis of proof search procedures than natural deduction proof systems and proof search procedures can serve as the core of algorithms for computing consistent answers to queries. (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)

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...

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)

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)

This impressive compilation of the material presented at the Second World Congress on Paraconsistency held in Juquehy-Sao Sebastião, São Paulo, Brazil, represents an integrated discussion of all major topics in the area of paraconsistent logic---highlighting philosophical and historical aspects, major developments and real-world applications.

Some philosophers have recently argued that contrary to the traditional view, good scientific theories can in fact be logically inconsistent. The literature is now full of case-studies that are taken to support this claim. I will argue however that as of yet no-one has managed to articulate a philosophically interesting view about the role of logically inconsistent theories in science that genuinely goes against tradition, is plausibly true, and is supported by any of the case studies usually given.

In this paper I present two new strategies for inconsistencyadaptive logics: the reliable sufficient information strategy of ACLuN3 andthe minimally abnormal sufficient information strategy of ACLuN4. I giveproof theory and semantics for both ACLuN3 and ACLuN4. I also compare them with the well-known inconsistency-adaptive logics ACLuN1 andACLuN2.

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)

1. In this special issue of the Journal of Applied Non-Classical Logics, we aim to celebrate the recent retirement of Philippe Besnard as directeur de recherche in the Centre National de Recherche...

The logics of formal inconsistency (LFIs, for short) are paraconsistent logics (that is, logics containing contradictory but non-trivial theories) having a consistency connective which allows to recover the ex falso quodlibet principle in a controlled way. The aim of this paper is considering a novel semantical approach to first-order LFIs based on Tarskian structures defined over swap structures, a special class of multialgebras. The proposed semantical framework generalizes previous aproaches to quantified LFIs presented in the literature. The case of (...) QmbC, the simpler quantified LFI expanding classical logic, will be analyzed in detail. An axiomatic extension of QmbC called QLFI1o is also studied, which is equivalent to the quantified version of da Costa and D'Ottaviano 3-valued logic J3. The semantical structures for this logic turn out to be Tarkian structures based on twist structures. The expansion of QmbC and QLFI1o with a standard equality predicate is also considered. (shrink)

One of the oldest systems of paraconsistent logic is the set of so-called C-systems of Newton da Costa, and this has been generalized into a family of systems now known as logics of formal inconsistencies by Walter Carnielli, Marcelo Coniglio and João Marcos. The characteristic notion in these systems is the so-called consistency operator which, roughly speaking, indicates how gluts are behaving. One natural question then is to ask if we can let not only gluts but also gaps be (...) around and generalize the notion of consistency into classicality. This is already considered by Andréa Loparić and da Costa in the style of C-systems. The aim of this paper is to develop a family of systems that generalizes the system of Loparić and da Costa which may be called logics of formal classicality. (shrink)

Moral conflicts are the situations which emerge as a response to deal with conflicting obligations or duties. An interesting case arises when an agent thinks that two obligations A and B are equally important, but yet fails to choose one obligation over the other. Despite the fact that the systematic study and the resolution of moral conflicts finds prominence in our linguistic discourse, standard deontic logic when used to represent moral conflicts, implies the impossibility of moral conflicts. This presents (...) a conundrum for appropriate logic to address these moral conflicts. We frequently believe that there is a close connection between tolerating inconsistencies and conflicting moral obligations. In paraconsistent logics, we tolerate inconsistencies by treating them to be both true and false. In this paper, we analyze Graham Priest’s paraconsistent logic LP, and extend our examination to the deontic extension of LP known as DLP. We illustrate our work, with a classic example from the famous Indian epic Mahabharata, where the protagonist Arjuna faces a moral conflict in the battlefield of Kurukshetra. The paper aims to avoid deontic explosion and allows to accommodate Arjuna’s moral conflict in paraconsistent deontic logics. Our analysis is expected to provide novel tools towards the logical representation of moral conflicts and to shed some light on the context-sensitive paraconsistent deontic logic. (shrink)

It is shown that all those theses of traditional logic which were rejected by Russell in terms of a preferred interpretation of 'all' and 'some', in fact lead to inconsistency in any formal system of traditional logic satisfying certain minimal conditions. Hence, Russell's refutation is ultimately independent of his interpretation. Further, the derivation of each of the refutable theses depends crucially on the Bochenski/Lukasiewicz postulate 'Some _A are _A'. If this postulate is removed, the theses which remain (...) are exactly those which translate into theses of quantification theory. (shrink)

I want to pull together some well-known facts which, when taken together, provide us with a plausible, and I think persuasive, argument that Aristotle's logic is inconsistent. We cannot, of course, hope to show that it is formally inconsistent since he does not present us with a fully worked-out formal system. On the other hand, we do have Lukasiewicz's formal version of Aristotelian logic which he proves consistent. (edited).

The early calculus is a popular example of an inconsistent but fruitful scientific theory. This paper is concerned with the formalisation of reasoning processes based on this inconsistent theory. First it is shown how a formal reconstruction in terms of a sub-classical negation leads to triviality. This is followed by the evaluation of the chunk and permeate mechanism proposed by Brown and Priest in, 379–388, 2004) to obtain a non-trivial formalisation of the early infinitesimal calculus. Different shortcomings of this application (...) of C&P as an explication of inconsistency tolerant reasoning are pointed out, both conceptual and technical. To remedy these shortcomings, an adaptive logic is proposed that allows for conditional permeations of formulas under the assumption of consistency preservation. First the adaptive logic is defined and explained and thereafter it is demonstrated how this adaptive logic remedies the defects C&P suffered from. (shrink)