In this article we review several paraconsistent logics from different authors to ‘close the gaps’ between them. Since paraconsistent logics is a broad area of research, it is possible that equivalent paraconsistent logics have different names. What we meant is that we provide connections between the logics studied comparing their different semantical approaches for a near future be able to obtain missing semantical characterization of different logics. We are introducing the term |$RC$|-|$type$| logics to denote a class of logics that extends |$C_\omega$| and satisfies the RC rule.

The eight contributions selected in this special issue represent a collection of extended papers presented at the eighth International Conference on Computational Intelligence in Security for Information Systems (CISIS 2015) held in Burgos, Spain, in June 2015, and organized by the BISITE (University of Salamanca) and the GICAP (University of Burgos) research groups, together with the Technological Institute of Castilla y León. CISIS aims to offer a meeting opportunity for academic- and industry-related researchers belonging to the various, vast communities of Computational Intelligence, Information Security and Data Mining. The need for intelligent, flexible behaviour by large, complex systems, especially in mission critical domains, is intended to be the catalyst and the aggregation stimulus for the overall event. In the first contribution, by Wójtowicz et al., an architecture and a protocol for secure and privacy-preserving smart space usage are proposed. It relies on a trusted party operating as a public service in the `security infrastructure as a service’ model. The proposed solution is designed to minimize the risk of users privacy violation from the side of service providers and attackers impersonating regular users, as well as the risk of violating privacy of users’ payment patterns from the side of payment authorities.

WoLLIC 2016 was held in Puebla, Mexico, August 16–19, 2016, in the campus of Benemerita Universidad Autonoma de Puebla (BUAP). WoLLIC (http://wollic.org) is a series of workshops which started in 1994 with the aim of fostering interdisciplinary research in pure and applied logic. The idea is to have a forum which is large enough in the number of possible interactions between logic and the sciences related to information and computation, and yet is small enough to allow for concrete and useful interaction among participants. Previous versions were held at: Recife (Pernambuco, Brazil) in 1994 and 1995; Salvador (Bahia, Brazil) in 1996; Fortaleza (Ceará, Brazil) in 1997; São Paulo (Brazil) in 1998; Itatiaia (Rio de Janeiro, Brazil) in 1999; Natal (RN, Brazil) in 2000; Brasılia (Distrito Federal, Brazil) in 2001; Rio de Janeiro (Brazil) in 2002; Ouro Preto (Minas Gerais, Brazil) in 2003; Fontainebleau (France) in 2004; Florianópolis (Santa Catarina, Brazil) in 2005; Stanford (California, USA) in 2006; Rio de Janeiro in 2007; Edinburgh in 2008; Tokyo in 2009; Brasılia in 2010; Philadelphia in 2011; Buenos Aires in 2012; Darmstadt in 2013; Valparaiso in 2014; Bloomington (IN) in 2015. It is planned that the meeting will take place in: 2017 in London, 2018 in Bogotá, 2019 in Utrecht, 2020 in Arequipa, 2021 in Chennai (tbc).

A system |${\sf WF}$| of subintuitionistic logic is introduced, weaker than Corsi’s basic subintuitionistic system |${\sf F}$|⁠. A derivation system with and without hypotheses is given in line with the authors’ derivation system for |${\sf F}$|⁠. A neighbourhood semantics is introduced with a somewhat more complex definition than the neighbourhood semantics for non-normal modal logics. Completeness is proved for |${\sf WF}$| with respect to this neighbourhood semantics, and similarly for some logics between |${\sf WF}$| and |${\sf F}$| which characterize nice frame classes. The study by the authors of the conservativity of |${\sf IPC}$| over |${\sf F}$| with respect to some classes of implications is extended to |${\sf WF}$|⁠, and shows clearly the difference in strength between the two logics. Study of translations of these weak subintuitionistic logics into non-normal modal logics turned out to be hard because of the difference between their respective neighbourhood structures and leaves us with some open problems.

A proof is presented showing that there is no paraconsistent logics with a standard implication (or even semi-implication) which have a three-valued characteristic matrix, and in which the replacement principle holds.

In this article, we present an encoding of the (recently proposed) denotational semantics for Answer Set Programming (ASP) and its monotonic basis into the input language of the theorem prover PVS. Using some libraries and features from PVS, we have obtained semi-automated proofs for several fundamental properties of ASP. In this way, to the best of our knowledge, we provide the first known application of formal verification to ASP.

The ten contributions selected in this special issue represent a collection of extended papers presented at the seventh International Conference on Computational Intelligence in Security for Information Systems (CISIS 2014). CISIS Conferences aim to offer a meeting opportunity for academic- and industry-related researchers belonging to the various, vast communities of Computational Intelligence, Information Security, and Data Mining. The need for intelligent, flexible behaviour by large, complex systems, especially in mission-critical domains, is intended to be the catalyst and the aggregation stimulus for the overall event. In the first contribution, García-Ferreira et al. discuss the techniques used today for the search of patterns and vulnerabilities within the software to know what are the possible solutions to this issue. They examine the problem from the point of view of their algorithms and their effectiveness in finding bugs. Although there are similar surveys, none of them addresses the comparison of best static analysis algorithms against the best mathematical logic languages for model checking, two fields that are becoming very important in the search for errors in software.

This article addresses and resolves some issues of relational, Kripke-style, semantics for the logics of bounded lattice expansions with operators of well-defined distribution types, focusing on the case where the underlying lattice is not assumed to be distributive. It therefore falls within the scope of the theory of Generalized Galois Logics (GGLs), introduced by Dunn, and it contributes to its extension. We introduce order-dual relational semantics and present a semantic analysis and completeness theorems for non-distributive lattice logic with $n$ -ary additive or multiplicative operators ( $n$ -ary boxes and diamonds), with negation operators modally interpreted as impossibility and unnecessity (falsifiability), as well as with implication connectives. Order-dual relational semantics shares with the generalized Kripke frames, or the bi-approximation semantics approach, the use of both a satisfaction and a co-satisfaction (refutation) relation, but it also responds to the recently voiced concerns of Craig, Haviar and Conradie about the relative non-intuitiveness of the 2-sorted semantics of the aforementioned approaches. In this article, we provide a standard (classical) interpretation (or dual interpretation) of modalities and natural interpretations of both negation and implication, despite the absence of distribution. Thereby, our results contribute in creating the necessary background for research in non-distributive logics with modalities variously interpreted as dynamic, temporal etc, by analogy to the classical case.

The error detection in software is a problem that causes the loss of large amount of money in updates and patches. Many programmers spend their time correcting code instead of programming new features for their applications. This makes early detection of software errors become essential. Both in the fields of static analysis and model checking, great advances are being made to find errors in the software before the products are released. Although model checking techniques are more dedicated to find malware, it can be adapted for errors in the software. In this article, we will discuss the techniques used today for the search of patterns and vulnerabilities within the software to know what are the possible solutions to this issue. We examine the problem from the point of view of their algorithms and their effectiveness in finding bugs. Although there are similar surveys, none of them addresses the comparison of best static analysis algorithms against the best mathematical logic languages for model checking, two fields that are becoming very important in the search for errors in software.

The use of covert-channel methods to bypass security policies or leak sensitive data has increased in the last years. Malicious users neutralize security restriction through protocol encapsulation, tunneling peer-to-peer, chat, or HTTP packets into allowed protocols such as DNS or HTTP. In this article, we propose an innovative profiling system for DNS tunnels that is based on Principal Component Analysis and Mutual Information. Results from experiments conducted on a live network show that one of the introduced metric is able to characterize anomalies on small DNS servers, while the other behaves better on medium sized servers. Concerning DNS tunneling attacks, the proposed approach reveals to be an efficient tool for traffic profiling in the presence of DNS tunneling.