Epistemic Ensembles in Semantic and Symbolic Environments (Extended Version with Proofs)

• URL: http://arxiv.org/abs/2408.01115v1
• Date: Fri, 2 Aug 2024 08:52:05 GMT
• Title: Epistemic Ensembles in Semantic and Symbolic Environments (Extended Version with Proofs)
• Authors: Rolf Hennicker, Alexander Knapp, Martin Wirsing,
• Abstract summary: A knowledge-based ensemble is composed of knowledge-based agents capable of retrieving and sharing knowledge about themselves and their peers. We study two types of mathematical semantics for epistemic ensembles based on a common syntactic operational ensemble semantics.
• Score: 45.085830389820956
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: An epistemic ensemble is composed of knowledge-based agents capable of retrieving and sharing knowledge and beliefs about themselves and their peers. These agents access a global knowledge state and use actions to communicate and cooperate, altering the collective knowledge state. We study two types of mathematical semantics for epistemic ensembles based on a common syntactic operational ensemble semantics: a semantic environment defined by a class of global epistemic states, and a symbolic environment consisting of a set of epistemic formul{\ae}. For relating these environments, we use the concept of {\Phi}-equivalence, where a class of epistemic states and a knowledge base are {\Phi}-equivalent, if any formula of {\Phi} holds in the class of epistemic states if, and only if, it is an element of the knowledge base. Our main theorem shows that {\Phi}-equivalent configurations simulate each other and satisfy the same dynamic epistemic ensemble formulae.

Related papers

• Theoretical Foundations for Semantic Cognition in Artificial Intelligence [0.0]
  monograph presents a modular cognitive architecture for artificial intelligence grounded in the formal modeling of belief as structured semantic state. Belief states are defined as dynamic ensembles of linguistic expressions embedded within a navigable manifold, where operators enable assimilation, abstraction, nullification, memory, and introspection.
  arXiv  Detail & Related papers  (2025-04-29T23:10:07Z)
• 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)
• Abstract Dialectical Frameworks are Boolean Networks (full version) [7.324459578044214]
  We study the relation between these two formalisms revealing their communalities as well as their differences, and introduce a correspondence that allows to establish novel results for the individual formalisms.
  arXiv  Detail & Related papers  (2024-07-02T08:37:05Z)
• Domain Embeddings for Generating Complex Descriptions of Concepts in Italian Language [65.268245109828]
  We propose a Distributional Semantic resource enriched with linguistic and lexical information extracted from electronic dictionaries. The resource comprises 21 domain-specific matrices, one comprehensive matrix, and a Graphical User Interface. Our model facilitates the generation of reasoned semantic descriptions of concepts by selecting matrices directly associated with concrete conceptual knowledge.
  arXiv  Detail & Related papers  (2024-02-26T15:04:35Z)
• Epistemic Logic Programs: a study of some properties [4.459996749171579]
  Epistemic Logic Programs (ELPs) extend Answer Set Programming (ASP) with epistemic operators. Recent work has introduced semantic properties that should be met by any semantics for ELPs. We analyze the possibility of changing the perspective, shifting from a bottom-up to a top-down approach to splitting.
  arXiv  Detail & Related papers  (2023-09-28T11:08:37Z)
• A Semantic Approach to Decidability in Epistemic Planning (Extended Version) [72.77805489645604]
  We use a novel semantic approach to achieve decidability. Specifically, we augment the logic of knowledge S5$_n$ and with an interaction axiom called (knowledge) commutativity. We prove that our framework admits a finitary non-fixpoint characterization of common knowledge, which is of independent interest.
  arXiv  Detail & Related papers  (2023-07-28T11:26:26Z)
• Epistemic Syllogistic: First Steps [0.0]
  Aristotle's discussions on modal syllogistic have often been viewed as error-prone and have garnered significant attention in the literature. We propose and examine several variants of modal syllogistic within the epistemic context. Our main contributions include several axiomatizations of these logics, with completeness proofs that may be of independent interest.
  arXiv  Detail & Related papers  (2023-07-11T06:50:49Z)
• Intrinsic Physical Concepts Discovery with Object-Centric Predictive Models [86.25460882547581]
  We introduce the PHYsical Concepts Inference NEtwork (PHYCINE), a system that infers physical concepts in different abstract levels without supervision. We show that object representations containing the discovered physical concepts variables could help achieve better performance in causal reasoning tasks.
  arXiv  Detail & Related papers  (2023-03-03T11:52:21Z)
• Unifying different notions of quantum incompatibility into a strict hierarchy of resource theories of communication [60.18814584837969]
  We introduce the notion of q-compatibility, which unifies different notions of POVMs, channels, and instruments incompatibility. We are able to pinpoint exactly what each notion of incompatibility consists of, in terms of information-theoretic resources.
  arXiv  Detail & Related papers  (2022-11-16T21:33:31Z)
• BioLORD: Learning Ontological Representations from Definitions (for Biomedical Concepts and their Textual Descriptions) [17.981285086380147]
  BioLORD is a new pre-training strategy for producing meaningful representations for clinical sentences and biomedical concepts. Because biomedical names are not always self-explanatory, it sometimes results in non-semantic representations. BioLORD overcomes this issue by grounding its concept representations using definitions, as well as short descriptions derived from a multi-relational knowledge graph.
  arXiv  Detail & Related papers  (2022-10-21T11:43:59Z)
• A calculus for epistemic interactions [0.5156484100374059]
  E-calculus is a concept framework to model agent's interactions with its environment. This paper presents the e-calculus, which provides a concept framework to model agent's interactions with its environment. The behaviour theory of the e-calculus is developed in two different viewpoints.
  arXiv  Detail & Related papers  (2022-06-29T09:54:58Z)

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.