English
Related papers

Related papers: Graded Galois Lattices and Closed Itemsets

200 papers

This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure.…

Logic in Computer Science · Computer Science 2018-07-23 Kevin H. Knuth

This paper develops geographic-style maps containing 2D lattices in all known crystals parameterised by recent complete invariants. Motivated by rigid crystal structures, lattices are considered up to rigid motion and uniform scaling. The…

Computational Geometry · Computer Science 2022-05-24 Matthew Bright , Andrew I Cooper , Vitaliy Kurlin

Previous work combines word-level and character-level representations using concatenation or scalar weighting, which is suboptimal for high-level tasks like reading comprehension. We present a fine-grained gating mechanism to dynamically…

Computation and Language · Computer Science 2017-09-13 Zhilin Yang , Bhuwan Dhingra , Ye Yuan , Junjie Hu , William W. Cohen , Ruslan Salakhutdinov

Applying geometric methods of $2$-dimensional cell complex theory, we construct a Galois covering of a bimodule problem satisfying some structure, triangularity and finiteness conditions in order to describe the objects of finite…

Representation Theory · Mathematics 2020-10-27 Vyacheslav Babych , Nataliya Golovashchuk

We present new language-based dynamic analysis techniques for linking visualisations and other structured outputs to data in a fine-grained way, allowing a user to interactively explore how data attributes map to visual or other output…

Programming Languages · Computer Science 2021-09-02 Roly Perera , Minh Nguyen , Tomas Petricek , Meng Wang

The ability to automatically generalise (interactive) proofs and use such generalisations to discharge related conjectures is a very hard problem which remains unsolved. Here, we develop a notion of goal types to capture key properties of…

Logic in Computer Science · Computer Science 2013-06-11 Gudmund Grov , Ewen Maclean

Taking an algebraic perspective on the basic structures of Rough Concept Analysis as the starting point, in this paper we introduce some varieties of lattices expanded with normal modal operators which can be regarded as the natural rough…

Motivated by the application problem of sensor fusion the author introduced the concept of graded set. It is reasoned that in classification problem arising in an information system (represented by information table), a novel set called…

Artificial Intelligence · Computer Science 2014-06-18 Garimella Rama Murthy

We describe a class calculus that is expressive enough to describe and improve its own learning process. It can design and debug programs that satisfy given input/output constraints, based on its ontology of previously learned programs. It…

Artificial Intelligence · Computer Science 2018-04-11 Daniel J. Buehrer

We present theoretical and practical results on the order theory of lattices of functions, focusing on Galois connections that abstract (sets of) functions - a topic known as higher-order abstract interpretation. We are motivated by the…

Programming Languages · Computer Science 2025-08-01 Louis Rustenholz , Pedro Lopez-Garcia , Manuel V. Hermenegildo

A residuated lattice is defined to be integrally closed if it satisfies the equations x\x = e and x/x = e. Every integral, cancellative, or divisible residuated lattice is integrally closed, and, conversely, every bounded integrally closed…

Logic · Mathematics 2019-11-18 José Gil-Férez , Frederik Lauridsen , George Metcalfe

In this paper we extend our previous results on sets of graded attribute implications with witnessed non-redundancy. We assume finite residuated lattices as structures of truth degrees and use arbitrary idempotent truth-stressing linguistic…

Artificial Intelligence · Computer Science 2016-06-22 Vilem Vychodil

Modular categories are important algebraic structures in a variety of subjects in mathematics and physics. We provide an explicit, motivated and elementary definition of a modular category over a field of characteristic 0 as an equivalence…

Quantum Algebra · Mathematics 2013-05-13 Orit Davidovich , Tobias Hagge , Zhenghan Wang

Concept lattice drawings are an important tool to visualize complex relations in data in a simple manner to human readers. Many attempts were made to transfer classical graph drawing approaches to order diagrams. Although those methods are…

Computational Geometry · Computer Science 2019-03-05 Dominik Dürrschnabel , Tom Hanika , Gerd Stumme

A graphical model is a statistical model that is associated to a graph whose nodes correspond to variables of interest. The edges of the graph reflect allowed conditional dependencies among the variables. Graphical models admit…

Methodology · Statistics 2016-06-09 Mathias Drton , Marloes H. Maathuis

An algebraic technique is presented that does not use results of model theory and makes it possible to construct a general Galois theory of arbitrary nonlinear systems of partial differential equations. The algebraic technique is based on…

Commutative Algebra · Mathematics 2010-12-30 Dima Trushin

We describe a project to formalize Galois theory using the Lean theorem prover, which is part of a larger effort to formalize all of the standard undergraduate mathematics curriculum in Lean. We discuss some of the challenges we faced and…

Logic in Computer Science · Computer Science 2021-07-26 Thomas Browning , Patrick Lutz

Lattice models or structures are geometrical objects with mathematical forms, that are used to represent physical systems. They have been used widely in diverse fields, namely, in condensed matter physics, to study degrees of freedom of…

Quantum Physics · Physics 2024-06-04 Kalyan Dasgupta

There is increasing focus on analyzing data represented as hypergraphs, which are better able to express complex relationships amongst entities than are graphs. Much of the critical information about hypergraph structure is available only…

Data Structures and Algorithms · Computer Science 2023-07-24 Michael G. Rawson , Audun Myers , Robert Green , Michael Robinson , Cliff Joslyn

Generalizing the $\omega$-categorical context, we introduce a notion, which we call the Lascar Property, that allows for a fine analysis of the topological isomorphisms between automorphism groups of countable structures satisfying this…

Logic · Mathematics 2025-07-01 Gianluca Paolini , Federico Pisciotta