What is modal logic

Answer Set Programming (ASP) is a declarative problem solving approach, initially tailored to modeling problems in the area of Knowledge Representation and Reasoning (KRR). More recently, its attractive combination of a rich yet simple modeling language with high-performance solving capacities has sparked interest in many other areas even beyond KRR. This book presents a practical introduction to ASP, aiming at using ASP languages and systems for solving application problems. Starting from the essential formal foundations, it introduces ASP's solving technology, modeling language and methodology, while illustrating the overall solving process by practical examples. Table of Contents: List of Figures / List of Tables / Motivation / Introduction / Basic modeling / Grounding / Characterizations / Solving / Systems / Advanced modeling / Conclusions

/pdf/answer-set-solving-in-practice-vtcfq8bjfw.pdf

Answer Set Solving in Practice

As a variation of fuzzy sets and intuitionistic fuzzy sets, neutrosophic sets have been developed to represent uncertain, imprecise, incomplete and inconsistent information that exists in the real world. Simplified neutrosophic sets SNSs have been proposed for the main purpose of addressing issues with a set of specific numbers. However, there are certain problems regarding the existing operations of SNSs, as well as their aggregation operators and the comparison methods. Therefore, this paper defines the novel operations of simplified neutrosophic numbers SNNs and develops a comparison method based on the related research of intuitionistic fuzzy numbers. On the basis of these operations and the comparison method, some SNN aggregation operators are proposed. Additionally, an approach for multi-criteria group decision-making MCGDM problems is explored by applying these aggregation operators. Finally, an example to illustrate the applicability of the proposed method is provided and a comparison with some other methods is made.

/pdf/simplified-neutrosophic-sets-and-their-applications-in-multi-2iisg5v09n.pdf

Simplified neutrosophic sets and their applications in multi-criteria group decision-making problems

The application of multi-attribute utility theory whose aggregation process is based on the Choquet integral requires the prior identification of a capacity. The main approaches to capacity identification proposed in the literature are reviewed and their advantages and inconveniences are discussed. All the reviewed methods have been implemented within the Kappalab R package. Their application is illustrated on a detailed example.

A review of methods for capacity identification in Choquet integral based multi-attribute utility theory: Applications of the Kappalab R package

A single-valued neutrosophic set is a special case of neutrosophic set. It has been proposed as a generalization of crisp sets, fuzzy sets, and intuitionistic fuzzy sets in order to deal with incomplete information. In this paper, a new approach for multi-attribute group decision making problems is.

Topsis Method for Multi-Attribute Group Decision Making Under Single-Valued Neutrosophic Environment

http://www.appliedlogictudelft.nl/wp-content/uploads/2014/02/U-Rivieccio_Neutrosophic-Logics-Prospect-and-Problems_Applied-Logic-TU-Delft.pdf

Neutrosophic logics: Prospects and problems

A curious feature of Belnap’s “useful four-valued logic”, also known as first-degree entailment (FDE), is that the overdetermined value B (both true and false) is treated as a designated value. Although there are good theoretical reasons for this, it seems prima facie more plausible to have only one of the four values designated, namely T (exactly true). This paper follows this route and investigates the resulting logic, which we call Exactly True Logic.

Nothing but the Truth

Bilattices, introduced by Ginsberg (1988, Comput. Intell., 265–316) as a uniform framework for inference in artificial intelligence, are algebraic structures that proved useful in many fields. In recent years, Arieli and Avron (1996, J. Logic Lang. Inform., 5, 25–63) developed a logical system based on a class of bilattice-based matrices, called logical bilattices, and provided a Gentzen-style calculus for it. This logic is essentially an expansion of the well-known Belnap–Dunn four-valued logic to the standard language of bilattices. Our aim is to study Arieli and Avron’s logic from the perspective of abstract algebraic logic (AAL). We introduce a Hilbert-style axiomatization in order to investigate the properties of the algebraic models of this logic, proving that every formula can be reduced to an equivalent normal form and that our axiomatization is complete w.r.t. Arieli and Avron’s semantics. In this way, we are able to classify this logic according to the criteria of AAL. We show, for instance, that it is non-protoalgebraic and non-self-extensional. We also characterize its Tarski congruence and the class of algebraic reducts of its reduced generalized models, which in the general theory of AAL is usually taken to be the algebraic counterpart of a sentential logic. This class turns out to be the variety generated by the smallest non-trivial bilattice, which is strictly contained in the class of algebraic reducts of logical bilattices. On the other hand, we prove that the class of algebraic reducts of reduced models of our logic is strictly included in the class of algebraic reducts of its reduced generalized models. Another interesting result obtained is that, as happens with some implicationless fragments of well-known logics, we can associate with our logic a Gentzen calculus which is algebraizable in the sense of

/pdf/the-logic-of-distributive-bilattices-4gzzpxmygy.pdf

The logic of distributive bilattices

The aim of this work is to develop a study from the perspective of Abstract Algebraic Logic of some bilattice-based logical systems introduced in the nineties by Ofer Arieli and Arnon Avron. The motivation for such an investigation has two main roots. On the one hand there is an interest in bilattices as an elegant formalism that gave rise in the last two decades to a variety of applications, especially in the field of Theoretical Computer Science and Artificial Intelligence. In this respect, the present study aims to be a contribution to a better understanding of the mathematical and logical framework that underlie these applications. On the other hand, our interest in bilattice-based logics comes from Abstract Algebraic Logic. In very general terms, algebraic logic can be described as the study of the connections between algebra and logic. One of the main reasons that motivate this study is the possibility to treat logical problems with algebraic methods and viceversa: this is accomplished by associating to a logical system a class of algebraic models that can be regarded as the algebraic counterpart of that logic. Starting from the work of Tarski and his collaborators, the method of algebraizing logics has been increasingly developed and generalized. In the last two decades, algebraic logicians have focused their attention on the process of algebraization itself: this kind of investigation forms now a subfield of algebraic logic known as Abstract Algebraic Logic (which we abbreviate AAL).

/pdf/an-algebraic-study-of-bilattice-based-logics-52s2x51jxf.pdf

An Algebraic Study of Bilattice-based Logics

The paper contains some algebraic results on several varieties of algebras having an (interlaced) bilattice reduct. Some of these algebras have already been studied in the literature (for instance bilattices with conflation, introduced by M. Fitting), while others arose from the algebraic study of O. Arieli and A. Avron’s bilattice logics developed in the third author’s PhD dissertation. We extend the representation theorem for bounded interlaced bilattices (proved, among others, by A. Avron) to unbounded bilattices and prove analogous representation theorems for the other classes of bilattices considered. We use these results to establish categorical equivalences between these structures and well-known varieties of lattices.

Umberto Rivieccio

Papers

Neutrosophic logics: Prospects and problems

Nothing but the Truth

The logic of distributive bilattices

An Algebraic Study of Bilattice-based Logics

Varieties of Interlaced Bilattices