Arbitrarily Applicable Same/Opposite Relational Responding with NARS

• URL: http://arxiv.org/abs/2505.07079v2
• Date: Mon, 16 Jun 2025 19:46:44 GMT
• Title: Arbitrarily Applicable Same/Opposite Relational Responding with NARS
• Authors: Robert Johansson, Patrick Hammer, Tony Lofthouse,
• Abstract summary: We show the emergence of textitarbitrarily applicable same/opposite relational responding within the Non-Axiomatic Reasoning System.<n>Our findings underscore the potential for integrating relational learning mechanisms inspired by learning psychology into artificial general intelligence frameworks.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Same/opposite relational responding, a fundamental aspect of human symbolic cognition, allows the flexible generalization of stimulus relationships based on minimal experience. In this study, we demonstrate the emergence of \textit{arbitrarily applicable} same/opposite relational responding within the Non-Axiomatic Reasoning System (NARS), a computational cognitive architecture designed for adaptive reasoning under uncertainty. Specifically, we extend NARS with an implementation of \textit{acquired relations}, enabling the system to explicitly derive both symmetric (mutual entailment) and novel relational combinations (combinatorial entailment) from minimal explicit training in a contextually controlled matching-to-sample (MTS) procedure. Experimental results show that NARS rapidly internalizes explicitly trained relational rules and robustly demonstrates derived relational generalizations based on arbitrary contextual cues. Importantly, derived relational responding in critical test phases inherently combines both mutual and combinatorial entailments, such as deriving same-relations from multiple explicitly trained opposite-relations. Internal confidence metrics illustrate strong internalization of these relational principles, closely paralleling phenomena observed in human relational learning experiments. Our findings underscore the potential for integrating nuanced relational learning mechanisms inspired by learning psychology into artificial general intelligence frameworks, explicitly highlighting the arbitrary and context-sensitive relational capabilities modeled within NARS.

Related papers

• Modeling Arbitrarily Applicable Relational Responding with the Non-Axiomatic Reasoning System: A Machine Psychology Approach [0.0]
  We present a novel theoretical approach for modeling AARR within an artificial intelligence framework using the Non-Axiomatic Reasoning System (NARS)<n>We show how key properties of AARR can emerge from the inference rules and memory structures of NARS.<n>Results suggest that AARR can be conceptually captured by suitably designed AI systems.
  arXiv  Detail & Related papers  (2025-03-01T20:37:11Z)
• Learning Complete Topology-Aware Correlations Between Relations for Inductive Link Prediction [121.65152276851619]
  We show that semantic correlations between relations are inherently edge-level and entity-independent. We propose a novel subgraph-based method, namely TACO, to model Topology-Aware COrrelations between relations. To further exploit the potential of RCN, we propose Complete Common Neighbor induced subgraph.
  arXiv  Detail & Related papers  (2023-09-20T08:11:58Z)
• Open Set Relation Extraction via Unknown-Aware Training [72.10462476890784]
  We propose an unknown-aware training method, regularizing the model by dynamically synthesizing negative instances. Inspired by text adversarial attacks, we adaptively apply small but critical perturbations to original training instances. Experimental results show that this method achieves SOTA unknown relation detection without compromising the classification of known relations.
  arXiv  Detail & Related papers  (2023-06-08T05:45:25Z)
• Relation-dependent Contrastive Learning with Cluster Sampling for Inductive Relation Prediction [30.404149577013595]
  We introduce Relation-dependent Contrastive Learning (ReCoLe) for inductive relation prediction. GNN-based encoder is optimized by contrastive learning, which ensures satisfactory performance on long-tail relations. Experimental results suggest that ReCoLe outperforms state-of-the-art methods on commonly used inductive datasets.
  arXiv  Detail & Related papers  (2022-11-22T13:30:49Z)
• On Neural Architecture Inductive Biases for Relational Tasks [76.18938462270503]
  We introduce a simple architecture based on similarity-distribution scores which we name Compositional Network generalization (CoRelNet) We find that simple architectural choices can outperform existing models in out-of-distribution generalizations.
  arXiv  Detail & Related papers  (2022-06-09T16:24:01Z)
• HiURE: Hierarchical Exemplar Contrastive Learning for Unsupervised Relation Extraction [60.80849503639896]
  Unsupervised relation extraction aims to extract the relationship between entities from natural language sentences without prior information on relational scope or distribution. We propose a novel contrastive learning framework named HiURE, which has the capability to derive hierarchical signals from relational feature space using cross hierarchy attention. Experimental results on two public datasets demonstrate the advanced effectiveness and robustness of HiURE on unsupervised relation extraction when compared with state-of-the-art models.
  arXiv  Detail & Related papers  (2022-05-04T17:56:48Z)
• Complementary Structure-Learning Neural Networks for Relational Reasoning [3.528645587678267]
  We show that pattern separation in the hippocampus allows rapid learning in novel environments. slower learning in neocortex accumulates small weight changes to extract systematic structure from well-learned environments.
  arXiv  Detail & Related papers  (2021-05-19T06:25:21Z)
• SelfORE: Self-supervised Relational Feature Learning for Open Relation Extraction [60.08464995629325]
  Open-domain relation extraction is the task of extracting open-domain relation facts from natural language sentences. We proposed a self-supervised framework named SelfORE, which exploits weak, self-supervised signals. Experimental results on three datasets show the effectiveness and robustness of SelfORE.
  arXiv  Detail & Related papers  (2020-04-06T07:23:17Z)
• Explainable Deep Relational Networks for Predicting Compound-Protein Affinities and Contacts [80.69440684790925]
  DeepRelations is a physics-inspired deep relational network with intrinsically explainable architecture. It shows superior interpretability to the state-of-the-art. It boosts the AUPRC of contact prediction 9.5, 16.9, 19.3 and 5.7-fold for the test, compound-unique, protein-unique, and both-unique sets.
  arXiv  Detail & Related papers  (2019-12-29T00:14:07Z)

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.