Related papers: Negation in SPARQL
We review the basic properties of paired operators and their adjoints, the transposed paired operators, with particular reference to commutation relations, and we study the properties of their kernels, bringing out their similarities and…
We consider the structure of algebra of operators, acting in $n-$fold tensor product space, which are partially transposed on the last term. Using purely algebraical methods we show that this algebra is semi-simple and then, considering its…
Negation is a common and important semantic feature in natural language, yet Large Language Models (LLMs) struggle when negation is involved in natural language understanding tasks. Commonsense knowledge, on the other hand, despite being a…
The $P$ versus $NP$ problem is still unsolved. But there are several oracles with $P$ unequal $NP$ relative to them. Here we will prove, that $P\not=NP$ relative to a $P$-complete oracle. In this paper, we use padding arguments as the proof…
Skew braces are one of the main algebraic tools controlling the structure of a non-degenerate bijective set-theoretic solution of the Yang-Baxter equation. The aim of this paper is to study model-theoretically tame skew braces, with…
We review the known results about characteristically nilpotent complex Lie algebras, as well as we comment recent developements in the theory.
This paper defines an argumentation semantics for extended logic programming and shows its equivalence to the well-founded semantics with explicit negation. We set up a general framework in which we extensively compare this semantics to…
We study relations between different notions of nilpotency in the context of skew braces and applications to the structure of solutions to the Yang-Baxter equation. In particular, we consider annihilator nilpotent skew braces, an important…
Negation is a common everyday phenomena and has been a consistent area of weakness for language models (LMs). Although the Information Retrieval (IR) community has adopted LMs as the backbone of modern IR architectures, there has been…
In this paper, we evaluate the translation of negation both automatically and manually, in English--German (EN--DE) and English--Chinese (EN--ZH). We show that the ability of neural machine translation (NMT) models to translate negation has…
Cumulative logics are studied in an abstract setting, i.e., without connectives, very much in the spirit of Makinson's early work. A powerful representation theorem characterizes those logics by choice functions that satisfy a weakening of…
We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…
This paper deals with well-known higher-order generalizations of Hankel operators. We show that higher-order Hankel operators can be written explicitly as linear differential operators, and give the exact form of these differential…
Dunkl operators for complex reflection groups are defined in this paper. These commuting operators give rise to a parametrized family of deformations of the polynomial De Rham complex. This leads to the study of the polynomial ring as a…
Computability logic (CL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a semantical platform and research program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth which it has more…
Natural language explanations in visual question answering (VQA-NLE) aim to make black-box models more transparent by elucidating their decision-making processes. However, we find that existing VQA-NLE systems can produce inconsistent…
Semantic parsing that translates natural language queries to SPARQL is of great importance for Knowledge Graph Question Answering (KGQA) systems. Although pre-trained language models like T5 have achieved significant success in the…
SPARQL query rewriting is a fundamental mechanism for uniformly querying heterogeneous ontologies in the Linked Data Web. However, the complexity of ontology alignments, particularly rich correspondences (c : c), makes this process…
Work on knowledge graphs and graph-based data management often focus either on declarative graph query languages or on frameworks for graph analytics, where there has been little work in trying to combine both approaches. However, many…
Termination of logic programs with negated body atoms (here called general logic programs) is an important topic. One reason is that many computational mechanisms used to process negated atoms, like Clark's negation as failure and Chan's…