The theory of concept lattices is approached from the point of view of fuzzy logic. The notions of partial order, lattice order, and formal concept are generalized for fuzzy setting. Presented is a theorem characterizing the hierarchical structure of formal fuzzy concepts arising in a given formal fuzzy context. Also, as an application of the present approach, Dedekind–MacNeille completion of a partial fuzzy order is described. The approach and results provide foundations for formal concept analysis of vague data—the propositions “object (...) x has attribute y”, which form the input data to formal concept analysis, are now allowed to have also intermediate truth values, meeting reality better. (shrink)

This paper argues for the theoretical and practical validity of similarity as a useful epistemological tool in scientific knowledge generation, specifically in chemistry. Classical analyses of similarity in philosophy of science do not account for the concept’s practical significance in scientific activities. We recur to examples from chemistry to counter the claim of authors like Quine or Goodman to the effect that similarity must be excluded from scientific practices . In conclusion we argue that more recent conceptualizations of the notion (...) of similarity, particularly Giere’s one, are appropriate for a philosophical analysis that considers scientific practices on equal terms with scientific theory. (shrink)

This paper is an introduction to a virtual special issue of AI and Law exploring the legacy of the influential HYPO system of Rissland and Ashley. The papers included are: Arguments and cases: An inevitable intertwining, BankXX: Supporting legal arguments through heuristic retrieval, Modelling reasoning with precedents in a formal dialogue Game, A note on dimensions and factors, An empirical investigation of reasoning with legal cases through theory construction and application, Automatically classifying case texts and predicting outcomes, A factor-based definition (...) of precedential constraint and An improved factor based approach to precedential constraint. After describing HYPO, in this introduction to the special issue I look at various aspects of its influence on AI and Law: the developments led by Rissland at Amherst; the developments led by Ashley in Pittsburgh; the expression of these ideas in terms of rule based systems, and their subsequent formalisation; value based theories, which were inspired by a critique of HYPO; and contemporary approaches which revive the idea of dimensions. (shrink)

There are several ways to extend the classic logical connectives for fuzzy truth degrees in such a way that their behavior for the values 0 and 1 work exactly as in the classical one. For each fuzzy semantics the formulas which are always true can change. But these sets are always a subset of the classical tautologies. The fuzzy semantics whose tautologies are identical to the classical tautologies are called here by “classic-like fuzzy semantics”. In this paper we will prove (...) that there are uncountable classes of classic-like fuzzy semantics and we will provide a characterization of them, i.e. we will determine a necessary and sufficient condition for a fuzzy semantic be classic-like. We also define a generic consequence semantic relation for fuzzy semantics and we will prove that for the classic-like fuzzy semantics, this notion coincides with the classical one. (shrink)

The method of approximate reasoning using a fuzzy logic introduced by Baldwin (1978 a,b,c), is used to model human reasoning in the resolution of two well known paradoxes. It is shown how classical propositional logic fails to resolve the paradoxes, how multiple valued logic partially succeeds and that a satisfactory resolution is obtained with fuzzy logic. The problem of precise representation of vague concepts is considered in the light of the results obtained.

The combination of Fuzzy Logics and Description Logics has been investigated for at least two decades because such fuzzy DLs can be used to formalize imprecise concepts. In particular, tableau algorithms for crisp Description Logics have been extended to reason also with their fuzzy counterparts. It has turned out, however, that in the presence of general concept inclusion axioms this extension is less straightforward than thought. In fact, a number of tableau algorithms claimed to deal correctly with fuzzy DLs with (...) GCIs have recently been shown to be incorrect. In this paper, we concentrate on fuzzy \, the fuzzy extension of the well-known DL \. We present a terminating, sound, and complete tableau algorithm for fuzzy \ with arbitrary continuous t-norms. Unfortunately, in the presence of GCIs, this algorithm does not yield a decision procedure for consistency of fuzzy \ ontologies since it uses as a sub-procedure a solvability test for a finitely represented, but possibly infinite, system of inequations over the real interval [0,1], which are built using the t-norm. In general, it is not clear whether this solvability problem is decidable for such infinite systems of inequations. This may depend on the specific t-norm used. In fact, we also show in this paper that consistency of fuzzy \ ontologies with GCIs is undecidable for the product t-norm. This implies, of course, that for the infinite systems of inequations produced by the tableau algorithm for fuzzy \ with product t-norm, solvability is in general undecidable. We also give a brief overview of recently obtained decidability results for fuzzy \ w.r.t. other t-norms. (shrink)

In this paper, we introduce the plithogenic set (as generalization of crisp, fuzzy, intuitionistic fuzzy, and neutrosophic sets), which is a set whose elements are characterized by many attributes (parameters)’ values. An attribute value v has a corresponding (fuzzy, intuitionistic fuzzy, or neutrosophic) degree of appurtenance d(x,v) of the element x, to the set P, with respect to some given criteria. In order to obtain a better accuracy for the plithogenic aggregation operators in the plithogenic set, and for a more (...) exact inclusion (partial order), a (fuzzy, intuitionistic fuzzy, or neutrosophic) contradiction (dissimilarity) degree is defined be-tween each attribute value and the dominant (most important) attribute value. The plithogenic intersection and union are linear combinations of the fuzzy operators tnorm and tconorm, while the plithogenic complement, inclusion (inequality), equality are influenced by the attribute values contradiction (dissimilarity) degrees. This article offers some examples and applications of these new concepts in our everyday life. (shrink)

This study focuses on implementing electric vehicles (EVs) in developing countries where energy production is mainly based on fossil fuels. Although for these countries the environmental short-run benefits of the EVs cannot offset the short-run costs, it may still be the best option to implement the EVs as soon as possible. Hence, it is necessary to evaluate the alternatives to introducing EVs to the market due to the environmental concerns that created an opportunity for some developing countries to catch up (...) with the international competition. Therefore, we develop a case scenario to explore the decision-making process in implementing the EVs with three alter natives and twelve criteria. We solve the decision-making problem by using Type-2 neutrosophic numbers (T2NNs) based on the RAFSI (Ranking of Alternatives through Functional mapping of criterion sub-intervals into a Single Interval) method. The proposed model combines the advantages of the RAFSI technique, and it applies T2NNs to address the uncertainties. The results show that the alternatives that may suspend the implementation of the EVs are inferior. Direct implementation of EVs is prioritized. The policy implications of the results are discussed in the study. (shrink)

This paper investigates the influence that social ties can have on behavior. After defining the concept of social ties that we consider, we introduce an original model of social ties. The impact of such ties on social preferences is studied in a coordination game with outside option. We provide a detailed game theoretical analysis of this game while considering various types of players, i.e., self-interest maximizing, inequity averse, and fair agents. In addition to these approaches that require strategic reasoning in (...) order to reach some equilibrium, we also present an alternative hypothesis that relies on the concept of team reasoning. After having discussed the differences between the latter and our model of social ties, we show how an experiment can be designed so as to discriminate among the models presented in the paper. (shrink)

In our current era, a new rapidly spreading pandemic disease called coronavirus disease, caused by a virus identified as a novel coronavirus, is becoming a crucial threat for the whole world. Currently, the number of patients infected by the virus is expanding exponentially, but there is no commercially available COVID-19 medication for this pandemic. However, numerous antiviral drugs are utilized for the treatment of the COVID-19 disease. Identification of the appropriate antivirus medicine to treat the infection of COVID-19 is still (...) a complicated and uncertain decision. This study’s key objective is to develop a novel approach called _q_-rung orthopair probabilistic hesitant fuzzy rough set, which incorporates the _q_-rung orthopair fuzzy set, probabilistic hesitant fuzzy set, and rough set structures. New _q_-ROPHFR aggregation operators have been established: the _q_-ROPHFR Einstein weighted averaging operator and the _q_-ROPHFR Einstein weighted geometric operator. In this study, we explored some basic features of the developed operators. Afterward, to demonstrate the viability and feasibility of the established decision-making approach in real-world applications, a case study related to selecting drugs for COVID-19 pandemic is addressed. Furthermore, a comprehensive comparison with the _q_-rung orthopair probabilistic hesitant fuzzy rough TOPSIS technique is also presented to illustrate the benefits of the new framework. The obtained results confirm the reliability and effectiveness of the proposed approach for finding uncertainty in real-world decision-making. (shrink)

To optimize the weak robustness of traditional face recognition algorithms, the classification accuracy rate is not high, the operation speed is slower, so a face recognition algorithm based on local binary pattern and stacked autoencoder is proposed. The advantage of LBP texture structure feature of the face image as the initial feature of sparse autoencoder learning, use the unified mode LBP operator to extract the histogram of the blocked face image, connect to form the LBP features of the entire image. (...) It is used as input of the stacked AE, feature extraction is done, realize the recognition and classification of face images. Experimental results show that the recognition rate of the algorithm LBP-SAE on the Yale database has achieved 99.05%, and it further shows that the algorithm has a higher recognition rate than the classic face recognition algorithm; it has strong robustness to light changes. Experimental results on the Olivetti Research Laboratory library shows that the developed method is more robust to light changes and has better recognition effects compared to traditional face recognition algorithms and standard stack AEs. (shrink)

A relatively new and exciting area of collaboration has begun between philosophy of mind and ethics. This paper attempts to explore aspects of this collaboration and how they bear upon traditional ethics. It is the author's contention that much of Western moral philosophy has been guided by largely unrecognized assumptions regarding reason, knowledge and conceptualization, and that when examined against empirical research in cognitive science, these assumptions turn out to be false -- or at the very least, unrealistic for creatures (...) with our cognitive structures. The fundamental tension between the Western idea of morality (as basically rule-following) and the way in which people actually confront and experience moral dilemmas is a result of our failure to take the insights of cognitive psychology seriously. This failure has had a dramatic impact on not only how we teach ethics, but how we attempt to live out lives. (shrink)

This essay shows that truth cannot be divorced from human experience and an individual’s world view, his or her weltanschauung. There exist different weltanschauungen that favour alternative truths. Thus, loosely speaking, truth is determined by context. It may be socially acceptable to prefer one among the alternative truths as truly true, but this goal necessarily involves taking an ideological perspective on what is perceived and accepted as the sole truth. In other words, it is prejudiced. The truth value assigned to (...) the proposition God exists starkly illustrates this claim, but in the course of this essay I demonstrate that alternative truths are widespread and that conflicting truths can co-exist within a community even when they create dissension. A hegemonic group will assert a preference for one truth over its alternatives, but that does not eliminate the existence of alternative truths. Alternative weltanschauungen need to be managed somehow, and the recognition that alternative truths exist is one step in their management. (shrink)

This paper offers the Boolean many-valued solution to the Sorites Paradox. According to the precisification-based Boolean many-valued theory, from which this solution arises, sentences have not only two truth values, truth (or 1) and falsity (or 0), but many Boolean values between 0 and 1. The Boolean value of a sentence is identified with the set of precisifications in which the sentence is true. Unlike degrees fuzzy logic assigns to sentences, Boolean many values are not linearly but only partially ordered; (...) so there are values that are incomparable. Despite this fact, the sentences in a sorites series can be taken as having values in a linear order, and losing (or gaining) value as we move from sentence to sentence in the series. So there is no sharp borderline between 0 and 1. Assigning Boolean many values instead of the two truth values to sentences for their vagueness values is analogous to assigning propositions instead of the truth values to sentences for their semantic values, as propositions are, from our viewpoint, also Boolean many values. (shrink)

The Boolean many-valued approach to vagueness is similar to the infinite-valued approach embraced by fuzzy logic in the respect in which both approaches seek to solve the problems of vagueness by assigning to the relevant sentences many values between falsity and truth, but while the fuzzy-logic approach postulates linearly-ordered values between 0 and 1, the Boolean approach assigns to sentences values in a many-element complete Boolean algebra. On the modal-precisificational approach represented by Kit Fine, if a sentence is indeterminate in (...) truth value in some world, it is taken to be true in one precisified world accessible from that world and false in another. This paper points to a way to unify these two approaches to vagueness by showing that Fine’s version of the modal-precisificational approach can be combined with the Boolean many-valued approach instead of supervaluationism, one of the most popular approaches to vagueness. (shrink)

We prove several interpolation theorems for many-valued infinitary logic with quantifiers by studying expansions of MV-algebras in the spirit of polyadic and cylindric algebras. We prove for various reducts of polyadic MV-algebras of infinite dimensions that if is the free algebra in the given signature,, is in the subalgebra of generated by, is in the subalgebra of generated by and, then there exists an interpolant in the subalgebra generated by and such that. We call this a varying interpolation property because (...) the integer depends on the inequality. We also address cases where this interpolation property fails, but other weaker ones hold. One such interpolation theorem says that though an interpolant may not be found as above, an interpolant can always be found if finitely many universal quantifiers are applied to making it smaller and the same number of existential quantifiers are applied to making it bigger. This number of quantifiers also varies; it depends on the inequality. Se.. (shrink)

In this paper, we define the regular and totally regular bipolar single valued neutrosophic hypergraphs, and discuss the order and size along with properties of regular and totally regular bipolar single valued neutrosophic hypergraphs. We extend work on completeness of bipolar single valued neutrosophic hypergraphs.

In this paper we recall, improve, and extend several definitions, properties and applications of our previous 2019 research referred to NeutroAlgebras and AntiAlgebras (also called NeutroAlgebraic Structures and respectively AntiAlgebraic Structures). Let <A> be an item (concept, attribute, idea, proposition, theory, etc.). Through the process of neutrosphication, we split the nonempty space we work on into three regions {two opposite ones corresponding to <A> and <antiA>, and one corresponding to neutral (indeterminate) <neutA> (also denoted <neutroA>) between the opposites}, which may (...) or may not be disjoint – depending on the application, but they are exhaustive (their union equals the whole space). A NeutroAlgebra is an algebra which has at least one NeutroOperation or one NeutroAxiom (axiom that is true for some elements, indeterminate for other elements, and false for the other elements). A Partial Algebra is an algebra that has at least one Partial Operation, and all its Axioms are classical (i.e. axioms true for all elements). Through a theorem we prove that NeutroAlgebra is a generalization of Partial Algebra, and we give examples of NeutroAlgebras that are not Partial Algebras. We also introduce the NeutroFunction (and NeutroOperation). (shrink)

In graph theory, the concept of domination is essential in a variety of domains. It has broad applications in diverse fields such as coding theory, computer net work models, and school bus routing and facility lo cation problems. If a fuzzy graph fails to obtain acceptable results, neutrosophic sets and neutrosophic graphs can be used to model uncertainty correlated with indeterminate and inconsistent information in arbitrary real-world scenario. In this study, we consider the concept of domination as it relates to (...) single-valued neutrosophic incidence graphs (SVNIGs). Given the importance of domination and its utilization in numerous fields, we propose the application of dominating sets in SVNIG with valid edges. We present some relevant definitions such as those of valid edges, cardinality, and isolated vertices in SVNIG along with some examples. Furthermore, we also show a few significant sets connected to the dominating set in an SVNIG such as independent and irredundant sets. We also investigate a relationship between the concepts of dominating sets and domination numbers as well as irredundant and independence sets in SVNIGs. Finally, a real-life deployment of domination in SVNIGsis investigated in relation to COVID-19 vaccination locations as a practical application. (shrink)

This fifth volume on Advances and Applications of DSmT for Information Fusion collects theoretical and applied contributions of researchers working in different fields of applications and in mathematics, and is available in open-access. The collected contributions of this volume have either been published or presented after disseminating the fourth volume in 2015 in international conferences, seminars, workshops and journals, or they are new. The contributions of each part of this volume are chronologically ordered. First Part of this book presents some (...) theoretical advances on DSmT, dealing mainly with modified Proportional Conflict Redistribution Rules (PCR) of combination with degree of intersection, coarsening techniques, interval calculus for PCR thanks to set inversion via interval analysis (SIVIA), rough set classifiers, canonical decomposition of dichotomous belief functions, fast PCR fusion, fast inter-criteria analysis with PCR, and improved PCR5 and PCR6 rules preserving the (quasi-)neutrality of (quasi-)vacuous belief assignment in the fusion of sources of evidence with their Matlab codes. Because more applications of DSmT have emerged in the past years since the apparition of the fourth book of DSmT in 2015, the second part of this volume is about selected applications of DSmT mainly in building change detection, object recognition, quality of data association in tracking, perception in robotics, risk assessment for torrent protection and multi-criteria decision-making, multi-modal image fusion, coarsening techniques, recommender system, levee characterization and assessment, human heading perception, trust assessment, robotics, biometrics, failure detection, GPS systems, inter-criteria analysis, group decision, human activity recognition, storm prediction, data association for autonomous vehicles, identification of maritime vessels, fusion of support vector machines (SVM), Silx-Furtif RUST code library for information fusion including PCR rules, and network for ship classification. Finally, the third part presents interesting contributions related to belief functions in general published or presented along the years since 2015. These contributions are related with decision-making under uncertainty, belief approximations, probability transformations, new distances between belief functions, non-classical multi-criteria decision-making problems with belief functions, generalization of Bayes theorem, image processing, data association, entropy and cross-entropy measures, fuzzy evidence numbers, negator of belief mass, human activity recognition, information fusion for breast cancer therapy, imbalanced data classification, and hybrid techniques mixing deep learning with belief functions as well. (shrink)

On the opposition between de re and de dicto conceptions of vagueness, with special reference to their bearing on the tasks of ontology.

We defend a set of acceptance rules that avoids the lottery paradox, that is closed under classical entailment, and that accepts uncertain propositions without ad hoc restrictions. We show that the rules we recommend provide a semantics that validates exactly Adams’ conditional logic and are exactly the rules that preserve a natural, logical structure over probabilistic credal states that we call probalogic. To motivate probalogic, we first expand classical logic to geo-logic, which fills the entire unit cube, and then we (...) project the upper surfaces of the geo-logical cube onto the plane of probabilistic credal states by means of standard, linear perspective, which may be interpreted as an extension of the classical principle of indifference. Finally, we apply the geometrical/logical methods developed in the paper to prove a series of trivialization theorems against question-invariance as a constraint on acceptance rules and against rational monotonicity as an axiom of conditional logic in situations of uncertainty. (shrink)

On two standard views of vagueness, vagueness as to whether Harry is bald entails that nobody knows whether Harry is bald—either because vagueness is a type of missing truth, and so there is nothing to know, or because vagueness is a type of ignorance, and so even though there is a truth of the matter, nobody can know what that truth is. Vagueness as to whether Harry is bald does entail that nobody clearly knows that Harry is bald and that (...) nobody clearly knows that Harry is not bald. But it does not entail that nobody knows that Harry is bald or that nobody knows that Harry is not bald. Hence, the two standard views of vagueness are mistaken. (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)

Can identity itself be vague? Can there be vague objects? Does a positive answer to either question entail a positive answer to the other? In this paper we answer these questions as follows: No, No, and Yes. First, we discuss Evans’s famous 1978 argument and argue that the main lesson that it imparts is that identity itself cannot be vague. We defend the argument from objections and endorse this conclusion. We acknowledge, however, that the argument does not by itself establish (...) either that there cannot be vague objects or that there cannot be identity statements that are indeterminate for ontic reasons. And we further acknowledge that it does not by itself establish that there cannot be identity statements that are indeterminate in virtue of the existence of vague objects. We then go on to argue that, despite this, one who believes in vague objects cannot endorse Evans’s argument. To establish this we offer supplementary arguments that show that if vague objects exist then identity is vague, and that if identity is vague then vague objects exist. Finally we draw attention to an argument parallel to that of Evans’s, but safer, which can be employed against the putative ontic indeterminacy in identity of vague objects which can be differentiated by identity-free properties. (shrink)

“Freedom” is a phenomenon in the natural world. This phenomenon—and indirectly the question of free will—is explored using a variety of systems-theoretic ideas. It is argued that freedom can emerge only in systems that are partially determined and partially random, and that freedom is a matter of degree. The paper considers types of freedom and their conditions of possibility in simple living systems and in complex living systems that have modeling subsystems. In simple living systems, types of freedom include independence (...) from fixed materiality, internal rather than external determination, activeness that is unblocked and holistic, and the capacity to choose or alter environmental constraint. In complex living systems, there is freedom in satisfaction of lower level needs that allows higher potentials to be realized. Several types of freedom also manifest in the modeling subsystems of these complex systems: in the transcending of automatism in subjective experience, in reason as instrument for passion yet also in reason ruling over passion, in independence from informational colonization by the environment, and in mobility of attention. Considering the wide range of freedoms in simple and complex living systems allows a panoramic view of this diverse and important natural phenomenon. (shrink)

The book presents a thoroughly elaborated logical theory of generalized truth-values understood as subsets of some established set of truth values. After elucidating the importance of the very notion of a truth value in logic and philosophy, we examine some possible ways of generalizing this notion. The useful four-valued logic of first-degree entailment by Nuel Belnap and the notion of a bilattice constitute the basis for further generalizations. By doing so we elaborate the idea of a multilattice, and most notably, (...) a trilattice of truth values – a specific algebraic structure with information ordering and two distinct logical orderings, one for truth and another for falsity. Each logical order not only induces its own logical vocabulary, but determines also its own entailment relation. We consider both semantic and syntactic ways of formalizing these relations and construct various logical calculi. (shrink)

Fuzzy logics are many-valued logics that are well suited to reasoning in the context of vagueness. They provide the basis for the wider field of Fuzzy Logic, encompassing diverse areas such as fuzzy control, fuzzy databases, and fuzzy mathematics. This book provides an accessible and up-to-date introduction to this fast-growing and increasingly popular area. It focuses in particular on the development and applications of "proof-theoretic" presentations of fuzzy logics; the result of more than ten years of intensive work by researchers (...) in the area, including the authors. In addition to providing alternative elegant presentations of fuzzy logics, proof-theoretic methods are useful for addressing theoretical problems and developing efficient deduction and decision algorithms. Proof-theoretic presentations also place fuzzy logics in the broader landscape of non-classical logics, revealing deep relations with other logics studied in Computer Science, Mathematics, and Philosophy. The book builds methodically from the semantic origins of fuzzy logics to proof-theoretic presentations such as Hilbert and Gentzen systems, introducing both theoretical and practical applications of these presentations. (shrink)

This book, provides a critical approach to all major logical paradoxes: from ancient to contemporary ones. There are four key aims of the book: 1. Providing systematic and historical survey of different approaches – solutions of the most prominent paradoxes discussed in the logical and philosophical literature. 2. Introducing original solutions of major paradoxes like: Liar paradox, Protagoras paradox, an unexpected examination paradox, stone paradox, crocodile, Newcomb paradox. 3. Explaining the far-reaching significance of paradoxes of vagueness and change for philosophy (...) and ontology. 4. Proposing a novel, well justified and, as it seems, natural classification of paradoxes. (shrink)

Edited in collaboration with FoLLI, the Association of Logic, Language and Information, this book constitutes the 4th volume of the FoLLI LNAI subline; containing the refereed proceedings of the 15th International Workshop on Logic, Language, Information and Computation, WoLLIC 2008, held in Edinburgh, UK, in July 2008. The 21 revised full papers presented together with the abstracts of 7 tutorials and invited lectures were carefully reviewed and selected from numerous submissions. The papers cover all pertinent subjects in computer science with (...) particular interest in cross-disciplinary topics. Typical areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection. (shrink)