The ERA of FOLE: Foundation
- URL: http://arxiv.org/abs/1512.07430v4
- Date: Fri, 21 Apr 2023 18:13:22 GMT
- Title: The ERA of FOLE: Foundation
- Authors: Robert E. Kent
- Abstract summary: This paper continues the discussion of the representation and interpretation of the first-order logical environment ttfamily FOLE.
The formalism and semantics of (many-sorted) first-order logic can be developed in both a emphclassification form and an emphinterpretation form.
In general, the ttfamily FOLE representation uses a conceptual approach, that is completely compatible with the theory of institutions, formal concept analysis and information flow.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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 consist of classes, relationships and properties. An ontology uses
formal axioms to constrain the interpretation of these primitives. In short, an
ontology specifies a logical theory. This paper continues the discussion of the
representation and interpretation of ontologies in the first-order logical
environment {\ttfamily FOLE}. The formalism and semantics of (many-sorted)
first-order logic can be developed in both a \emph{classification form} and an
\emph{interpretation form}. Two papers, the current paper, defining the concept
of a structure, and ``The {\ttfamily ERA} of {\ttfamily FOLE}:
Superstructure'', defining the concept of a sound logic, represent the
\emph{classification form}, corresponding to ideas discussed in the
``Information Flow Framework''. Two papers, ``The {\ttfamily FOLE} Table'',
defining the concept of a relational table, and ``The {\ttfamily FOLE}
Database'', defining the concept of a relational database, represent the
\emph{interpretation form}, expanding on material found in the paper ``Database
Semantics''. Although the classification form follows the
entity-relationship-attribute data model of Chen, the interpretation form
incorporates the relational data model of Codd. A fifth paper ``{\ttfamily
FOLE} Equivalence'' proves that the classification form is equivalent to the
interpretation form. In general, the {\ttfamily FOLE} representation uses a
conceptual structures approach, that is completely compatible with the theory
of institutions, formal concept analysis and information flow.
Related papers
- The quasi-semantic competence of LLMs: a case study on the part-whole relation [53.37191762146552]
We investigate knowledge of the emphpart-whole relation, a.k.a. emphmeronymy.
We show that emphquasi-semantic'' models have just a emphquasi-semantic'' competence and still fall short of capturing deep inferential properties.
arXiv Detail & Related papers (2025-04-03T08:41:26Z) - A Complexity-Based Theory of Compositionality [53.025566128892066]
In AI, compositional representations can enable a powerful form of out-of-distribution generalization.
Here, we propose a formal definition of compositionality that accounts for and extends our intuitions about compositionality.
The definition is conceptually simple, quantitative, grounded in algorithmic information theory, and applicable to any representation.
arXiv Detail & Related papers (2024-10-18T18:37:27Z) - Explainable Moral Values: a neuro-symbolic approach to value classification [1.4186974630564675]
This work explores the integration of ontology-based reasoning and Machine Learning techniques for explainable value classification.
By relying on an ontological formalization of moral values as in the Moral Foundations Theory, the textitsandra neuro-symbolic reasoner is used to infer values that are emphsatisfied by a certain sentence.
We show that only relying on the reasoner's inference results in explainable classification comparable to other more complex approaches.
arXiv Detail & Related papers (2024-10-16T14:53:13Z) - Non-monotonic Extensions to Formal Concept Analysis via Object Preferences [3.4873708563238277]
We introduce a non-monotonic conditional between sets of attributes, which assumes a preference over the set of objects.
We show that this conditional gives rise to a consequence relation consistent with the postulates for non-monotonicty.
This notion of typical concepts is a further introduction of KLM-style typicality into Formal Concept Analysis.
arXiv Detail & Related papers (2024-10-05T15:01:00Z) - The Geometry of Categorical and Hierarchical Concepts in Large Language Models [15.126806053878855]
We show how to extend the formalization of the linear representation hypothesis to represent features (e.g., is_animal) as vectors.
We use the formalization to prove a relationship between the hierarchical structure of concepts and the geometry of their representations.
We validate these theoretical results on the Gemma and LLaMA-3 large language models, estimating representations for 900+ hierarchically related concepts using data from WordNet.
arXiv Detail & Related papers (2024-06-03T16:34:01Z) - A Note on an Inferentialist Approach to Resource Semantics [48.65926948745294]
'Inferentialism' is the view that meaning is given in terms of inferential behaviour.
This paper shows how 'inferentialism' enables a versatile and expressive framework for resource semantics.
arXiv Detail & Related papers (2024-05-10T14:13:21Z) - Inferentialist Resource Semantics [48.65926948745294]
This paper shows how inferentialism enables a versatile and expressive framework for resource semantics.
How inferentialism seamlessly incorporates the assertion-based approach of the logic of Bunched Implications.
This integration enables reasoning about shared and separated resources in intuitive and familiar ways.
arXiv Detail & Related papers (2024-02-14T14:54:36Z) - An Encoding of Abstract Dialectical Frameworks into Higher-Order Logic [57.24311218570012]
This approach allows for the computer-assisted analysis of abstract dialectical frameworks.
Exemplary applications include the formal analysis and verification of meta-theoretical properties.
arXiv Detail & Related papers (2023-12-08T09:32:26Z) - Lattice-preserving $\mathcal{ALC}$ ontology embeddings with saturation [50.05281461410368]
An order-preserving embedding method is proposed to generate embeddings of OWL representations.
We show that our method outperforms state-the-art theory-of-the-art embedding methods in several knowledge base completion tasks.
arXiv Detail & Related papers (2023-05-11T22:27:51Z) - Semantic Role Labeling Meets Definition Modeling: Using Natural Language
to Describe Predicate-Argument Structures [104.32063681736349]
We present an approach to describe predicate-argument structures using natural language definitions instead of discrete labels.
Our experiments and analyses on PropBank-style and FrameNet-style, dependency-based and span-based SRL also demonstrate that a flexible model with an interpretable output does not necessarily come at the expense of performance.
arXiv Detail & Related papers (2022-12-02T11:19:16Z) - Topos and Stacks of Deep Neural Networks [12.300163392308807]
Every known artificial deep neural network (DNN) corresponds to an object in a canonical Grothendieck's topos.
Invariance structures in the layers (like CNNs or LSTMs) correspond to Giraud's stacks.
Semantic functioning of a network is its ability to express theories in such a language for answering questions in output about input data.
arXiv Detail & Related papers (2021-06-28T11:50:06Z) - Context-theoretic Semantics for Natural Language: an Algebraic Framework [0.0]
We present a framework for natural language semantics in which words, phrases and sentences are all represented as vectors.
We show that the vector representations of words can be considered as elements of an algebra over a field.
arXiv Detail & Related papers (2020-09-22T13:31:37Z)
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.