Related papers: Negation in SPARQL
In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson's constructive logic N4. We do so by formalizing, in this logic, two principles that we call non-contradictory…
We propose a transition-based system to transpile Abstract Meaning Representation (AMR) into SPARQL for Knowledge Base Question Answering (KBQA). This allows us to delegate part of the semantic representation to a strongly pre-trained…
We discuss some types of congruences on Menger algebras of rank $n$, which are generalizations of the principal left and right congruences on semigroups. We also study congruences admitting various types of cancellations and describe their…
There exist two different languages, the ^sl(2) and N=2 ones, to describe similar structures; a dictionary is given translating the key representation-theoretic terms related to the two algebras. The main tool to describe the structure of…
Transformer language models are state of the art in a multitude of NLP tasks. Despite these successes, their opaqueness remains problematic. Recent methods aiming to provide interpretability and explainability to black-box models primarily…
A catalogue of explicit realizations of representations of (super) Lie algebras and quantum algebras in Fock space is presented.
The purpose of this paper is to introduce the notion of isoclinism and cover in a multiplicative Lie algebra which may be helpful to describe all multiplicative Lie algebra structures on a group. Consequently, we give the existence of the…
Proof-theoretic methods are developed for subsystems of Johansson's logic obtained by extending the positive fragment of intuitionistic logic with weak negations. These methods are exploited to establish properties of the logical systems.…
Embedding tensors in databases has recently gained in significance, due to the rapid proliferation of machine learning methods (including LLMs) which produce embeddings in the form of tensors. To support emerging use cases hybridizing…
There are normal sub-blocks of nilpotent blocks which are NOT nilpotent or, equivalently, nilpotent extensions of non-nilpotent blocks. In this paper we determine the source algebra structure of the non-nilpotent blocks involved in these…
Negation Scope Resolution is an extensively researched problem, which is used to locate the words affected by a negation cue in a sentence. Recent works have shown that simply finetuning transformer-based architectures yield…
Constraint Logic Programming (CLP) is a logic programming formalism used to solve problems requiring the consideration of constraints, like resource allocation and automated planning and scheduling. It has previously been extended in…
In this work, we consider Lie algebras L containing a subalgebra isomorphic to sl3 and such that L decomposes as a module for that sl3 subalgebra into copies of the adjoint module, the natural 3-dimensional module and its dual, and the…
We discuss some basic problems and conjectures in a program to construct general orbifold conformal field theories using the representation theory of vertex operator algebras. We first review a program to construct conformal field theories.…
Machine learning based decision making systems applied in safety critical areas require reliable high certainty predictions. For this purpose, the system can be extended by an reject option which allows the system to reject inputs where…
Convolutional neural networks have been successfully applied to various NLP tasks. However, it is not obvious whether they model different linguistic patterns such as negation, intensification, and clause compositionality to help the…
Set compositional and negated queries are crucial for expressing complex information needs and enable the discovery of niche items like Books about non-European monarchs. Despite the recent advances in LLMs, first-stage ranking remains…
In this paper, the abc conjecture is negated under certain conditions
Algebraic properties of $n$-place opening operations on a fixed set are described. Conditions under which a Menger algebra of rank $n$ can be represented by $n$-place opening operations are found.
We develop a method of constructing a kernel of Lie algebra weight system. A main tool we use in the analysis is Vogel's $\Lambda$ algebra and the surrounding framework. As an example of a developed technique we explicitly provide all…