SearcharxivSearch

arXiv subjects

Felipe Salvatore

Publications and source records attributed to Felipe Salvatore.

2 recordsLinked to original sources

A logical-based corpus for cross-lingual evaluation

At present, different deep learning models are presenting high accuracy on popular inference datasets such as SNLI, MNLI, and SciTail. However, there are different indicators that those datasets can be exploited by using some simple linguistic patterns. This fact poses difficulties to our understanding of the actual capacity of machine learning models to solve the complex task of textual inference. We propose a new set of syntactic tasks focused on contradiction detection that require specific capacities over linguistic logical forms such as: Boolean coordination, quantifiers, definite description, and counting operators. We evaluate two kinds of deep learning models that implicitly exploit language structure: recurrent models and the Transformer network BERT. We show that although BERT is clearly more efficient to generalize over most logical forms, there is space for improvement when dealing with counting operators. Since the syntactic tasks can be implemented in different languages, we show a successful case of cross-lingual transfer learning between English and Portuguese.

cs.CL

First-order justification logic with constant domain semantics

Justification logic is a term used to identify a relatively new family of modal-like logics. There is an established literature about propositional justification logic, but incursions on the first-order case are scarce. In this paper we present a constant domain semantics for the first-order logic of proofs with the Barcan Formula (FOLPb); then we prove Soundness and Completeness Theorems. A monotonic semantics for a version of this logic without the Barcan Formula is already in the literature, but constant domains requires substantial new machinery, which may prove useful in other contexts as well. Although we work mainly with one system, we also indicate how to generalize these results for the quantified version of JT45, the justification counterpart of the modal logic S5. We believe our methods are more generally applicable, but initially examining specific cases should make the work easier to follow.

cs.LO