Some Preliminary Steps Towards Metaverse Logic
- URL: http://arxiv.org/abs/2307.05574v1
- Date: Mon, 10 Jul 2023 09:13:22 GMT
- Title: Some Preliminary Steps Towards Metaverse Logic
- Authors: Antonio L. Furtado, Marco A. Casanova, Edirlei Soares de Lima
- Abstract summary: We look in the present work for a logic that would be powerful enough to handle the situations arising both in the real and in the fictional underlying application domains.
The discussion was kept at a rather informal level, always trying to convey the intuition behind the theoretical notions in natural language terms.
- Score: 0.8594140167290096
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Assuming that the term 'metaverse' could be understood as a computer-based
implementation of multiverse applications, we started to look in the present
work for a logic that would be powerful enough to handle the situations arising
both in the real and in the fictional underlying application domains. Realizing
that first-order logic fails to account for the unstable behavior of even the
most simpleminded information system domains, we resorted to non-conventional
extensions, in an attempt to sketch a minimal composite logic strategy. The
discussion was kept at a rather informal level, always trying to convey the
intuition behind the theoretical notions in natural language terms, and
appealing to an AI agent, namely ChatGPT, in the hope that algorithmic and
common-sense approaches can be usefully combined.
Related papers
- Language Models can be Logical Solvers [99.40649402395725]
We introduce LoGiPT, a novel language model that directly emulates the reasoning processes of logical solvers.
LoGiPT is fine-tuned on a newly constructed instruction-tuning dataset derived from revealing and refining the invisible reasoning process of deductive solvers.
arXiv Detail & Related papers (2023-11-10T16:23:50Z) - Towards Invertible Semantic-Preserving Embeddings of Logical Formulae [1.0152838128195467]
Learning and optimising logic requirements and rules has always been an important problem in Artificial Intelligence.
Current methods are able to construct effective semantic-preserving embeddings via kernel methods, but the map they define is not invertible.
In this work we address this problem, learning how to invert such an embedding leveraging deep architectures based on the Graph Variational Autoencoder framework.
arXiv Detail & Related papers (2023-05-03T10:49:01Z) - The Transformation Logics [58.35574640378678]
We introduce a new family of temporal logics designed to balance the trade-off between expressivity and complexity.
Key feature is the possibility of defining operators of a new kind that we call transformation operators.
We show them to yield logics capable of creating hierarchies of increasing expressivity and complexity.
arXiv Detail & Related papers (2023-04-19T13:24:04Z) - Discourse-Aware Graph Networks for Textual Logical Reasoning [142.0097357999134]
Passage-level logical relations represent entailment or contradiction between propositional units (e.g., a concluding sentence)
We propose logic structural-constraint modeling to solve the logical reasoning QA and introduce discourse-aware graph networks (DAGNs)
The networks first construct logic graphs leveraging in-line discourse connectives and generic logic theories, then learn logic representations by end-to-end evolving the logic relations with an edge-reasoning mechanism and updating the graph features.
arXiv Detail & Related papers (2022-07-04T14:38:49Z) - LogiGAN: Learning Logical Reasoning via Adversarial Pre-training [58.11043285534766]
We present LogiGAN, an unsupervised adversarial pre-training framework for improving logical reasoning abilities of language models.
Inspired by the facilitation effect of reflective thinking in human learning, we simulate the learning-thinking process with an adversarial Generator-Verifier architecture.
Both base and large size language models pre-trained with LogiGAN demonstrate obvious performance improvement on 12 datasets.
arXiv Detail & Related papers (2022-05-18T08:46:49Z) - Modeling and Automating Public Announcement Logic with Relativized
Common Knowledge as a Fragment of HOL in LogiKEy [0.0]
This article presents a semantical embedding for public announcement logic with relativized common knowledge.
It enables the first-time automation of this logic with off-the-shelf theorem provers for classical higher-order logic.
The work constitutes an important addition to the pluralist LogiKEy knowledge engineering methodology.
arXiv Detail & Related papers (2021-11-02T15:14:52Z) - Logic-Driven Context Extension and Data Augmentation for Logical
Reasoning of Text [65.24325614642223]
We propose to understand logical symbols and expressions in the text to arrive at the answer.
Based on such logical information, we put forward a context extension framework and a data augmentation algorithm.
Our method achieves the state-of-the-art performance, and both logic-driven context extension framework and data augmentation algorithm can help improve the accuracy.
arXiv Detail & Related papers (2021-05-08T10:09:36Z) - Multi-Agent Reinforcement Learning with Temporal Logic Specifications [65.79056365594654]
We study the problem of learning to satisfy temporal logic specifications with a group of agents in an unknown environment.
We develop the first multi-agent reinforcement learning technique for temporal logic specifications.
We provide correctness and convergence guarantees for our main algorithm.
arXiv Detail & Related papers (2021-02-01T01:13:03Z) - Public Announcement Logic in HOL [0.0]
shallow semantical embedding for public announcement logic with relativized common knowledge is presented.
This embedding enables the first-time automation of this logic with off-the-shelf theorem provers for classical higher-order logic.
arXiv Detail & Related papers (2020-10-02T06:46:02Z) - Extending Automated Deduction for Commonsense Reasoning [0.0]
The paper argues that the methods and algorithms used by automated reasoners for classical first-order logic can be extended towards commonsense reasoning.
The proposed extensions mostly rely on ordinary proof trees and are devised to handle commonsense knowledge bases containing inconsistencies, default rules, operating on topics, relevance, confidence and similarity measures.
We claim that machine learning is best suited for the construction of commonsense knowledge bases while the extended logic-based methods would be well-suited for actually answering queries from these knowledge bases.
arXiv Detail & Related papers (2020-03-29T23:17:16Z) - SMT + ILP [12.47276164048813]
We motivate a reconsideration of inductive declarative programming by leveraging satisfiability modulo theory technology.
In this position paper, we motivate a reconsideration of inductive declarative programming by leveraging satisfiability modulo theory technology.
arXiv Detail & Related papers (2020-01-15T10:09:21Z)
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.