English
Related papers

Related papers: An Abstract Approach to Consequence Relations

200 papers

Generating a huge number of association rules reduces their utility in the decision making process, done by domain experts. In this context, based on the theory of Formal Concept Analysis, we propose to extend the notion of Formal Concept…

Databases · Computer Science 2012-09-19 Wafa Tebourski Ourida Ben Boubaker Saidi

In this note, we present a conjecture on intersections of set families, and a rephrasing of the conjecture in terms of principal downsets of Boolean lattices. The conjecture informally states that, whenever we can express the measure of a…

Combinatorics · Mathematics 2024-01-30 Antoine Amarilli , Mikaël Monet , Dan Suciu

The identification of semantic relations between terms within texts is a fundamental task in Natural Language Processing which can support applications requiring a lightweight semantic interpretation model. Currently, semantic relation…

Computation and Language · Computer Science 2018-06-21 Vivian S. Silva , Manuela Hürliman , Brian Davis , Siegfried Handschuh , André Freitas

We introduce and investigate a category-theoretic abstraction of the standard "system-solution" adjunction in affine algebraic geometry. We then look further into these geometric adjunctions at different levels of generality, from syntactic…

Category Theory · Mathematics 2018-03-14 Olivia Caramello , Vincenzo Marra , Luca Spada

Large language models have recently shown promising progress in mathematical reasoning when fine-tuned with human-generated sequences walking through a sequence of solution steps. However, the solution sequences are not formally structured…

Machine Learning · Computer Science 2022-12-07 Andrew J. Nam , Mengye Ren , Chelsea Finn , James L. McClelland

This article describes a purely analytic approach to urn models of the generalized or extended P\'olya-Eggenberger type, in the case of two types of balls and constant ``balance,'' that is, constant row sum. The treatment starts from a…

Probability · Mathematics 2007-05-23 Philippe Flajolet , Joaquim Gabarro , Helmut Pekari

We present several philosophical ideas emerging from the studies of complex systems. We make a brief introduction to the basic concepts of complex systems, for then defining "abstraction levels". These are useful for representing…

Adaptation and Self-Organizing Systems · Physics 2007-05-23 Carlos Gershenson

We present a systematic approach to logical predicates based on universal coalgebra and higher-order abstract GSOS, thus making a first step towards a unifying theory of logical relations. We first observe that logical predicates are…

Logic in Computer Science · Computer Science 2024-01-15 Sergey Goncharov , Alessio Santamaria , Lutz Schröder , Stelios Tsampas , Henning Urbat

We introduce a new semantics for justification logic based on subset relations. Instead of using the established and more symbolic interpretation of justifications, we model justifications as sets of possible worlds. We introduce a new…

Logic · Mathematics 2020-08-19 Eveline Lehmann , Thomas Studer

Understanding realistic complex systems requires confronting significant conceptual, theoretical and experimental limitations rooted in the persistence of views that originated in the mechanics of simple moving bodies. We define the…

Physics and Society · Physics 2024-03-06 Santiago Núñez-Corrales , Eric Jakobsson

We consider a simple modal logic whose non-modal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of…

Logic in Computer Science · Computer Science 2009-03-23 Mehrnoosh Sadrzadeh , Roy Dyckhoff

Recently, Gavazzo has developed a relational theory of symbolic manipulation, that allows to study syntax-based rewriting systems without relying on specific notions of syntax. This theory was obtained by extending the algebra of relations…

Logic in Computer Science · Computer Science 2023-12-07 Lorenzo Pace

Abductive reasoning aims to find plausible explanations for an event. This style of reasoning is critical for commonsense tasks where there are often multiple plausible explanations. Existing approaches for abductive reasoning in natural…

Computation and Language · Computer Science 2023-05-25 Wenting Zhao , Justin T. Chiu , Claire Cardie , Alexander M. Rush

The paper addresses aggregation issues for composite (modular) solutions. A systemic view point is suggested for various aggregation problems. Several solution structures are considered: sets, set morphologies, trees, etc. Mainly, the…

Software Engineering · Computer Science 2011-12-01 Mark Sh. Levin

A little general abstract combinatorial nonsense delivered in this note is a presentation of some old and basic concepts, central to discrete mathematics, in terms of new words. The treatment is from a structural and systematic point of…

Category Theory · Mathematics 2007-06-14 Sheng Bau

Additive relations are defined over additive monoids and additive operation is introduced over these new relations then we build algebraic system of equations. We can generate profuse equations by additive relations of two variables. To…

General Mathematics · Mathematics 2012-03-06 Ziqian Wu

We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…

Logic · Mathematics 2025-05-06 Martina Iannella , Alberto Marcone , Luca Motto Ros , Vadim Weinstein

Algebraic theories, sometimes called equational theories, are syntactic notions given by finitary operations and equations, such as monoids, groups, and rings. There is a well-known category-theoretic treatment of them that algebraic…

Category Theory · Mathematics 2026-03-31 Yuto Kawase

This paper studies axioms for nonmonotonic consequences from a semantics-based point of view, focusing on a class of mathematical structures for reasoning about partial information without a predefined syntax/logic. This structure is called…

Logic in Computer Science · Computer Science 2007-05-23 Guo-Qiang Zhang

We introduce a relational semantics based on poset products, and provide sufficient conditions guaranteeing its soundness and completeness for various substructural logics. We also demonstrate that our relational semantics unifies and…

Logic · Mathematics 2023-07-24 Wesley Fussner
‹ Prev 1 3 4 5 6 7 10 Next ›