468,162 research outputs found
Aristotle’s assertoric syllogistic and modern relevance logic
This paper sets out to evaluate the claim that Aristotle’s Assertoric Syllogistic is a relevance logic or shows significant similarities with it. I prepare the grounds for a meaningful comparison by extracting the notion of relevance employed in the most influential work on modern relevance logic, Anderson and Belnap’s Entailment. This notion is characterized by two conditions imposed on the concept of validity: first, that some meaning content is shared between the premises and the conclusion, and second, that the premises of a proof are actually used to derive the conclusion. Turning to Aristotle’s Prior Analytics, I argue that there is evidence that Aristotle’s Assertoric Syllogistic satisfies both conditions. Moreover, Aristotle at one point explicitly addresses the potential harmfulness of syllogisms with unused premises. Here, I argue that Aristotle’s analysis allows for a rejection of such syllogisms on formal grounds established in the foregoing parts of the Prior Analytics. In a final section I consider the view that Aristotle distinguished between validity on the one hand and syllogistic validity on the other. Following this line of reasoning, Aristotle’s logic might not be a relevance logic, since relevance is part of syllogistic validity and not, as modern relevance logic demands, of general validity. I argue that the reasons to reject this view are more compelling than the reasons to accept it and that we can, cautiously, uphold the result that Aristotle’s logic is a relevance logic
Restall\u27s Proof-Theoretic Pluralism and Relevance Logic
Restall (Erkenntnis 79(2):279–291, 2014) proposes a new, proof-theoretic, logical pluralism. This is in contrast to the model-theoretic pluralism he and Beall proposed in Beall and Restall (Aust J Philos 78(4):475–493, 2000) and in Beall and Restall (Logical pluralism, Oxford University Press, Oxford, 2006). What I will show is that Restall has not described the conditions on being admissible to the proof-theoretic logical pluralism in such a way that relevance logic is one of the admissible logics. Though relevance logic is not hard to add formally, one critical component of Restall’s pluralism is that the relevance logic that gets added must have connectives which mean the same thing as the connectives in the already admitted logic. This is what I will show is not possible
Improving Text Matching in E-Commerce Search with A Rationalizable, Intervenable and Fast Entity-Based Relevance Model
Discovering the intended items of user queries from a massive repository of
items is one of the main goals of an e-commerce search system. Relevance
prediction is essential to the search system since it helps improve
performance. When online serving a relevance model, the model is required to
perform fast and accurate inference. Currently, the widely used models such as
Bi-encoder and Cross-encoder have their limitations in accuracy or inference
speed respectively. In this work, we propose a novel model called the
Entity-Based Relevance Model (EBRM). We identify the entities contained in an
item and decompose the QI (query-item) relevance problem into multiple QE
(query-entity) relevance problems; we then aggregate their results to form the
QI prediction using a soft logic formulation. The decomposition allows us to
use a Cross-encoder QE relevance module for high accuracy as well as cache QE
predictions for fast online inference. Utilizing soft logic makes the
prediction procedure interpretable and intervenable. We also show that
pretraining the QE module with auto-generated QE data from user logs can
further improve the overall performance. The proposed method is evaluated on
labeled data from e-commerce websites. Empirical results show that it achieves
promising improvements with computation efficiency
Constructive interval temporal logic in Alf
This paper gives an implementation of an interval temporal logic in a constructive type theory, using the Alf proof system. After explaining the constructive approach, its relevance to interval temporal logic and potential applications of our work, we explain the fundamentals of the Alf system. We then present the implementation of the logic and give a number of examples of its use. We conclude by exploring how the work can be extended in the future
Minimal Negation in the Ternary Relational Semantics
Minimal Negation is defined within the basic positive relevance logic in the relational ternary semantics: B+. Thus, by defining a number of subminimal negations in the B+ context, principles of weak negation are shown to be isolable. Complete ternary semantics are offered for minimal negation in B+. Certain forms of reductio are conjectured to be undefinable (in ternary frames) without extending the positive logic. Complete semantics for such kinds of reductio in a properly extended positive logic are offered
- …