Logic

Article Mathematics, Applied

DIFFERENCE-MAKING CONDITIONALS AND THE RELEVANT RAMSEY TEST

Hans Rott

Summary: This article explores conditionals that express the impact of the antecedent on the consequent, presenting the 'relevantised' version of the Ramsey Test and the 'Dependent Ramsey Test.' These conditionals violate traditional principles of conditional logic, but offer an intriguing logic of their own, closely related to David Lewis's counterfactual analysis of causation.

REVIEW OF SYMBOLIC LOGIC (2022)

Article Mathematics, Applied

MATHEMATICAL RIGOR AND PROOF

Yacin Hamami

Summary: Mathematical proofs must be rigorous to be considered proper justification for mathematical knowledge. The standard view that mathematical proofs should be able to be translated into formal proofs is widely accepted by contemporary mathematicians, but has also been criticized in the philosophy of mathematics literature. Debate on this topic is currently blocked by a lack of precise formulation.

REVIEW OF SYMBOLIC LOGIC (2022)

Article Computer Science, Software Engineering

Analysis and Transformation of Constrained Horn Clauses for Program Verification

Emanuele De Angelis, Fabio Fioravanti, John P. Gallagher, Manuel Hermenegildo, Alberto Pettorossi, Maurizio Proietti

Summary: This paper surveys recent work on applying analysis and transformation techniques in constraint logic programming to the problem of verifying software systems. It presents specialization-based techniques for translating verification problems for different programming languages into satisfiability problems for constrained Horn clauses. The paper also describes static analysis techniques for CHCs that can be used to infer program properties and discusses future developments in applying these techniques.

THEORY AND PRACTICE OF LOGIC PROGRAMMING (2022)

Article Mathematics, Applied

THE LOGIC OF THE EVIDENTIAL CONDITIONAL

Eric Raidl, Andrea Iacona, Vincenzo Crupi

Summary: This paper presents a sound and complete system of conditional logic, which is based on Chrysippus' idea and accommodates the analysis proposed by Crupi and Iacona. The soundness and completeness proofs rely on a general method elaborated by Raidl, applicable to various systems of conditional logic.

REVIEW OF SYMBOLIC LOGIC (2022)

Article Computer Science, Theory & Methods

Declarative continuous reasoning in the cloud-IoT continuum

Stefano Forti, Giuseppe Bisicchia, Antonio Brogi

Summary: In this article, the authors propose a novel continuous reasoning methodology for the continuous QoS- and context-aware management of multiservice applications in Cloud-IoT scenarios. The methodology supports runtime decision on service placement by reacting to changes in the infrastructure and application requirements, and suggests migrations only for affected services. Experimental results show significant speed-up compared to exhaustive search.

JOURNAL OF LOGIC AND COMPUTATION (2022)

Article Mathematics, Applied

THE POWER OF NAIVE TRUTH

Hartry Field

Summary: Nonclassical theories of truth have advantages and disadvantages compared to classical theories. However, the proof-theoretic disadvantage of nonclassical theories can be eliminated by strengthening existing internal theories.

REVIEW OF SYMBOLIC LOGIC (2022)

Article Mathematics

Three Ways of Being Non-Material

Vincenzo Crupi, Andrea Iacona

Summary: This paper introduces a probabilistic analysis of conditionals based on a quantitative measure of evidential support. It compares the interpretation of 'if' with the suppositional and strict interpretations within a formal framework. Each interpretation has specific logical features that warrant separate consideration.

STUDIA LOGICA (2022)

Article Logic

Belnap-Dunn Semantics for the Variants of BN4 and E4 which Contain Routley and Meyer's Logic B

Sandra M. Lopez

Summary: This paper investigates the implicative variants of logics BN4 and E4, which are the 4-valued logics of relevant conditional and (relevant) entailment. These systems are based on Routley and Meyer's logic B and are endowed with a Belnap-Dunn type bivalent semantics.

LOGIC AND LOGICAL PHILOSOPHY (2022)

Article Computer Science, Theory & Methods

Being Correct Is Not Enough: Efficient Verification Using Robust Linear Temporal Logic

Tzanis Anevlavis, Matthew Philippe, Daniel Neider, Paulo Tabuada

Summary: This article presents and studies the logic rLTL, which allows for formal reasoning about both correctness and robustness in system design. The study identifies a large fragment of rLTL for which verification can be efficiently solved using an automaton. The findings demonstrate the practical significance of this fragment in terms of expressiveness, ability to describe robustness, and the fine-grained information it brings to system verification.

ACM TRANSACTIONS ON COMPUTATIONAL LOGIC (2022)

Article Mathematics, Applied

L-algebras and three main non-classical logics

Wolfgang Rump

Summary: The semantics of three main branches of non-classical logic, intuitionistic, many-valued, and quantum logic, is unified by the concept of L-algebra. The corresponding classes of algebras are associated with specializations of a bounded L-algebra, and three basic specializations lead to three more classes of algebras, including quantized Heyting algebras that have not been considered before. All these algebras are obtained from a new class of L-algebras that satisfy general versions of Glivenko's and Mundici's theorems simultaneously.

ANNALS OF PURE AND APPLIED LOGIC (2022)

Article Computer Science, Software Engineering

Probabilistic QoS-aware Placement of VNF Chains at the Edge

Stefano Forti, Federica Paganelli, Antonio Brogi

Summary: In this article, a declarative solution called EdgeUsher is presented for determining the optimal placement of VNF chains in Cloud-Edge infrastructures. EdgeUsher can identify all suitable deployment locations for a set of VNF chains in the infrastructure, taking into account hardware, IoT, security, bandwidth, and latency requirements. It utilizes probability distributions to model the dynamic variations in the infrastructure and evaluate the output placements against those variations.

THEORY AND PRACTICE OF LOGIC PROGRAMMING (2022)

Article Mathematics, Applied

CLASSICAL COUNTERPOSSIBLES

Rohan French, Patrick Girard, David Ripley

Summary: We present four classical theories that combine modalities and counterfactuals in the context of counterpossibles. These theories vary in their approach to restricting the interaction between modalities and counterfactuals. We provide a logical cartography that illustrates the extent to which nonvacuism about counterpossibles can be reconciled with classical logic.

REVIEW OF SYMBOLIC LOGIC (2022)

Article Mathematics, Applied

A hybrid genetic algorithm, list-based simulated annealing algorithm, and different heuristic algorithms for travelling salesman problem

Vladimir Ilin, Dragan Simic, Svetislav D. Simic, Svetlana Simic, Nenad Saulic, Jose Luis Calvo-Rolle

Summary: The article introduces a hybrid algorithm called GA-TCTIA-LBSA for solving the traveling salesman problem (TSP), which combines a genetic algorithm, tour construction and improvement algorithms, and a list-based simulated annealing algorithm. The proposed algorithm shows promising results, particularly for small-sized instances.

LOGIC JOURNAL OF THE IGPL (2023)

Article Mathematics

A Q-WADGE HIERARCHY IN QUASI-POLISH SPACES

Victor Selivanov

Summary: The Wadge hierarchy, originally defined and studied in the Baire space, has been extended to arbitrary topological spaces by providing a set-theoretical definition of all its levels. The extension behaves well in second countable spaces and especially in quasi-Polish spaces. The levels are preserved by continuous open surjections between second countable spaces, leading to several Hausdorff-Kuratowski-type theorems in quasi-Polish spaces.

JOURNAL OF SYMBOLIC LOGIC (2022)

Article Logic

A Pragmatic Account of Rephrase in Argumentation: Linguistic and Cognitive Evidence

Marcin Koszowy, Katarzyna Budzynska, Barbara Konat, Steve Oswald, Pascal Gygax

Summary: In this paper, we present a systematic pragmatic account of rephrasing based on the pragmatic account of quotation and reporting by Macagno and Walton. By combining annotation and crowd-sourced examination, we investigate the variety of uses of rephrase as a persuasive device and their effects. Our approach integrates Waltonian insights with empirical and experimental research to establish a novel theoretically-informed and data-driven pragmatic account of rephrase.

INFORMAL LOGIC (2022)

Article Computer Science, Theory & Methods

Simulating and model checking membrane systems using strategies in Maude

Ruben Rubio, Narciso Marti-Oliet, Isabel Pita, Alberto Verdejo

Summary: Membrane systems are a computational model inspired by biological cells, with complex control mechanisms, making encoding them into rewriting logic challenging. Various alternatives have been proposed in the literature and implemented in Maude specification language for easier specification and verification. The recent release of the Maude strategy language simplifies the process of specifying these systems, making them executable and verifiable.

JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING (2022)

Article Logic

On the Logical Form of Concessive Conditionals

Vincenzo Crupi, Andrea Iacona

Summary: This paper presents an explanation of concessive conditionals based on two main ideas: the logical form of a sentence is determined by its context, and there are distinct readings of "if" based on the relationship between the antecedent and consequent.

JOURNAL OF PHILOSOPHICAL LOGIC (2022)

Proceedings Paper Computer Science, Theory & Methods

Quantum Multiple Valued Kernel Circuits

Aviraj Sinha, Mitchell A. Thornton

Summary: In this study, we generalize recent findings in binary quantum kernels to multivalued logic by utilizing higher dimensional entanglement. Our method offers enhanced resolution and efficiency in kernel calculation, and is capable of concurrently computing multiple instances of quantum kernels. It is suitable for handling large datasets.

2022 IEEE 52ND INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC (ISMVL 2022) (2022)

Article Mathematics

Sequent-Calculi for Metainferential Logics

Bruno Da Re, Federico Pailos

Summary: In recent years, some theorists argue that logic is defined not only by inferences but also by meta-inferences. Different logics with the same inferences but different meta-inferences have led to the development of new meta-inferential logics at various levels. These logics, with mixed standards for premises and conclusions, are presented semantically based on Strong Kleene truth-tables.

STUDIA LOGICA (2022)

Article Logic

One Step is Enough

David Ripley

Summary: The recent exploration of mixed metainferential logics represents a breakthrough in understanding nontransitive and nonreflexive logics, posing a challenge to theorists who rely on similarities to classical logic in defending ST. Despite similarities, some mixed metainferential logics are even more akin to classical logic. The author argues that ST retains its value within the metainferential hierarchy, and further exploration may not be necessary.

JOURNAL OF PHILOSOPHICAL LOGIC (2022)