English
Related papers

Related papers: Quantification and Aggregation over Concepts of th…

200 papers

It is well known that dependence logic captures the complexity class NP, and it has recently been shown that inclusion logic captures P on ordered models. These results demonstrate that team semantics offers interesting new possibilities…

Logic · Mathematics 2014-08-19 Antti Kuusisto

We show that first order logic (FO) and first order logic extended with modulo counting quantifiers (FOMOD) over purely functional vocabularies which extend addition, satisfy the Crane beach property (CBP) if the logic satisfies a normal…

Logic in Computer Science · Computer Science 2025-02-04 A. Baskar , A. V. Sreejith , R. S. Thinniyam

We study the expressive power of fragments of inclusion and independence logic defined by restricting the number k of universal quantifiers in formulas. Assuming the so-called strict semantics for these logics, we relate these fragments of…

Logic · Mathematics 2014-01-15 Miika Hannula , Juha Kontinen

Claim verification plays a crucial role in combating misinformation. While existing works on claim verification have shown promising results, a crucial piece of the puzzle that remains unsolved is to understand how to verify claims without…

Computation and Language · Computer Science 2023-10-23 Haoran Wang , Kai Shu

The current state-of-the-art in many natural language processing and automated knowledge base completion tasks is held by representation learning methods which learn distributed vector representations of symbols via gradient-based…

Neural and Evolutionary Computing · Computer Science 2017-12-29 Tim Rocktäschel

We study the separation of positive and negative data examples in terms of description logic concepts in the presence of an ontology. In contrast to previous work, we add a signature that specifies a subset of the symbols that can be used…

Logic in Computer Science · Computer Science 2021-07-13 Jean Christoph Jung , Carsten Lutz , Hadrien Pulcini , Frank Wolter

Reasoning with quantifier expressions in natural language combines logical and arithmetical features, transcending strict divides between qualitative and quantitative. Our topic is this cooperation of styles as it occurs in common…

Logic · Mathematics 2025-07-08 Johan van Benthem , Thomas Icard

This paper continues the discussion of the representation and interpretation of ontologies in the first-order logical environment {\ttfamily FOLE} (Kent). Ontologies are represented and interpreted in (many-sorted) first-order logic. Five…

Databases · Computer Science 2023-04-25 Robert E. Kent

We investigate the quantifier alternation hierarchy in first-order logic on finite words. Levels in this hierarchy are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a…

Formal Languages and Automata Theory · Computer Science 2014-04-29 Thomas Place , Marc Zeitoun

Among the various forms of reasoning studied in the context of artificial intelligence, qualitative reasoning makes it possible to infer new knowledge in the context of imprecise, incomplete information without numerical values. In this…

Artificial Intelligence · Computer Science 2026-02-10 Quentin Cohen-Solal , Alexandre Niveau , Maroua Bouzid

Taking advantage of the widespread use of ontologies to organise and harmonize knowledge across several distinct domains, this paper proposes a novel approach to improve an embedding-Large Language Model (embedding-LLM) of interest by…

Computation and Language · Computer Science 2024-06-03 Francesco Ronzano , Jay Nanavati

The paper provides a survey of semantic methods for solution of fundamental tasks in mathematical knowledge management. Ontological models and formalisms are discussed. We propose an ontology of mathematical knowledge, covering a wide range…

Artificial Intelligence · Computer Science 2014-09-01 Alexander Elizarov , Alexander Kirillovich , Evgeny Lipachev , Olga Nevzorova , Valery Solovyev , Nikita Zhiltsov

Cause-effect relations are an important part of human knowledge. In real life, humans often reason about complex causes linked to complex effects. By comparison, existing formalisms for representing knowledge about causal relations are…

Logic in Computer Science · Computer Science 2014-05-12 Bart Bogaerts , Joost Vennekens , Marc Denecker , Jan Van den Bussche

The relationship between Lexical-Functional Grammar (LFG) functional structures (f-structures) for sentences and their semantic interpretations can be expressed directly in a fragment of linear logic in a way that explains correctly the…

cmp-lg · Computer Science 2008-02-03 Mary Dalrymple , John Lamping , Fernando Pereira , Vijay Saraswat

The semantic web has received many contributions of researchers as ontologies which, in this context, i.e. within RDF linked data, are formalized conceptualizations that might use different protocols, such as RDFS, OWL DL and OWL FULL. In…

Artificial Intelligence · Computer Science 2017-10-30 Renato Fabbri

The large size and complex decision mechanisms of state-of-the-art text classifiers make it difficult for humans to understand their predictions, leading to a potential lack of trust by the users. These issues have led to the adoption of…

Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard…

Logic in Computer Science · Computer Science 2017-03-08 Lidia Tendera

Pre-trained language models (LMs) have shown remarkable reasoning performance using explanations or chain-of-thoughts (CoT)) for in-context learning. On the other hand, these reasoning tasks are usually presumed to be more approachable for…

Computation and Language · Computer Science 2024-03-29 Yi-Fan Zhang , Hanlin Zhang , Li Erran Li , Eric Xing

This paper discusses the representation of ontologies in the first-order logical environment {\ttfamily FOLE}. An ontology defines the primitives with which to model the knowledge resources for a community of discourse. These primitives…

Databases · Computer Science 2023-04-25 Robert E. Kent

Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…

Logic in Computer Science · Computer Science 2021-01-26 Michał R. Przybyłek