Orthologics for Cones

• URL: http://arxiv.org/abs/2008.03172v1
• Date: Fri, 7 Aug 2020 13:28:27 GMT
• Title: Orthologics for Cones
• Authors: Mena Leemhuis and \"Ozg\"ur L. \"Oz\c{c}ep and Diedrich Wolter
• Abstract summary: In this paper we study logics for such geometric structures. We describe an extension of minimal orthologic with a partial modularity rule that holds for closed convex cones. This logic combines a feasible data structure (exploiting convexity/conicity) with sufficient expressivity, including full orthonegation.
• Score: 5.994412766684843
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In applications that use knowledge representation (KR) techniques, in particular those that combine data-driven and logic methods, the domain of objects is not an abstract unstructured domain, but it exhibits a dedicated, deep structure of geometric objects. One example is the class of convex sets used to model natural concepts in conceptual spaces, which also links via convex optimization techniques to machine learning. In this paper we study logics for such geometric structures. Using the machinery of lattice theory, we describe an extension of minimal orthologic with a partial modularity rule that holds for closed convex cones. This logic combines a feasible data structure (exploiting convexity/conicity) with sufficient expressivity, including full orthonegation (exploiting conicity).

Related papers

• SpaceMesh: A Continuous Representation for Learning Manifold Surface Meshes [61.110517195874074]
  We present a scheme to directly generate manifold, polygonal meshes of complex connectivity as the output of a neural network. Our key innovation is to define a continuous latent connectivity space at each mesh, which implies the discrete mesh. In applications, this approach not only yields high-quality outputs from generative models, but also enables directly learning challenging geometry processing tasks such as mesh repair.
  arXiv  Detail & Related papers  (2024-09-30T17:59:03Z)
• Geometric Relational Embeddings [19.383110247906256]
  We propose relational embeddings, a paradigm of embeddings that respect the underlying symbolic structures. Results obtained from benchmark real-world datasets demonstrate the efficacy of geometric relational embeddings.
  arXiv  Detail & Related papers  (2024-09-18T22:02:24Z)
• Disciplined Geodesically Convex Programming [0.9899763598214121]
  Testing convexity structure in nonlinear programs relies on verifying the convexity objectives and constraints. citetgrantdisciplined introduced a framework, Disciplined Convex Programming (DCP), which can verify basic convexatoms. Our paper is accompanied by a Julia package, which provides functionality for testing DGCP-compliant expressions.
  arXiv  Detail & Related papers  (2024-07-07T05:13:51Z)
• Enforcing 3D Topological Constraints in Composite Objects via Implicit Functions [60.56741715207466]
  Medical applications often require accurate 3D representations of complex organs with multiple parts, such as the heart and spine. This paper introduces a novel approach to enforce topological constraints in 3D object reconstruction using deep implicit signed distance functions. We propose a sampling-based technique that effectively checks and enforces topological constraints between 3D shapes by evaluating signed distances at randomly sampled points throughout the volume.
  arXiv  Detail & Related papers  (2023-07-16T10:07:15Z)
• Higher-order topological kernels via quantum computation [68.8204255655161]
  Topological data analysis (TDA) has emerged as a powerful tool for extracting meaningful insights from complex data. We propose a quantum approach to defining Betti kernels, which is based on constructing Betti curves with increasing order.
  arXiv  Detail & Related papers  (2023-07-14T14:48:52Z)
• Morpho-logic from a Topos Perspective: Application to symbolic AI [2.781492199939609]
  Modal logics have proved useful for many reasoning tasks in symbolic artificial intelligence (AI) We propose to further develop and generalize this link between mathematical morphology and modal logic from a topos perspective. We show that the modal logic is well adapted to define concrete and efficient operators for revision, merging, and abduction of new knowledge, or even spatial reasoning.
  arXiv  Detail & Related papers  (2023-03-08T21:24:25Z)
• Topologically Regularized Data Embeddings [15.001598256750619]
  We introduce a generic approach based on algebraic topology to incorporate topological prior knowledge into low-dimensional embeddings. We show that jointly optimizing an embedding loss with such a topological loss function as a regularizer yields embeddings that reflect not only local proximities but also the desired topological structure. We empirically evaluate the proposed approach on computational efficiency, robustness, and versatility in combination with linear and non-linear dimensionality reduction and graph embedding methods.
  arXiv  Detail & Related papers  (2023-01-09T13:49:47Z)
• Frame Averaging for Equivariant Shape Space Learning [85.42901997467754]
  A natural way to incorporate symmetries in shape space learning is to ask that the mapping to the shape space (encoder) and mapping from the shape space (decoder) are equivariant to the relevant symmetries. We present a framework for incorporating equivariance in encoders and decoders by introducing two contributions.
  arXiv  Detail & Related papers  (2021-12-03T06:41:19Z)
• Dist2Cycle: A Simplicial Neural Network for Homology Localization [66.15805004725809]
  Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations. We propose a graph convolutional model for learning functions parametrized by the $k$-homological features of simplicial complexes.
  arXiv  Detail & Related papers  (2021-10-28T14:59:41Z)
• ConE: Cone Embeddings for Multi-Hop Reasoning over Knowledge Graphs [73.86041481470261]
  Cone Embeddings (ConE) is the first geometry-based query embedding model that can handle conjunction, disjunction, and negation. ConE significantly outperforms existing state-of-the-art methods on benchmark datasets.
  arXiv  Detail & Related papers  (2021-10-26T14:04:02Z)
• Turing approximations, toric isometric embeddings & manifold convolutions [0.0]
  We define a convolution operator for a manifold of arbitrary topology and dimension. A result of Alan Turing from 1938 underscores the need for such a toric isometric embedding approach to achieve a global definition of convolution.
  arXiv  Detail & Related papers  (2021-10-05T18:36:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.