Logic Negation with Spiking Neural P Systems

Nowadays, the success of neural networks as reasoning systems is doubtless. Nonetheless, one of the drawbacks of such reasoning systems is that they work as black-boxes and the acquired knowledge is not human readable. In this paper, we present a new step in order to close the gap between connectionist and logic based reasoning systems. We show that two of the most used inference rules for obtaining negative information in rule based reasoning systems, the so-called Closed World Assumption and Negation as Finite Failure can be characterized by means of spiking neural P systems, a formal model of the third generation of neural networks born in the framework of membrane computing.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/04/2022

Neuro-symbolic computing with spiking neural networks

Knowledge graphs are an expressive and widely used data structure due to...
research
10/15/2020

Ensembles of Spiking Neural Networks

This paper demonstrates that ensembles of spiking neural networks can be...
research
04/30/2023

Sparsifying Spiking Networks through Local Rhythms

It has been well-established that within conventional neural networks, m...
research
12/11/2012

On The Delays In Spiking Neural P Systems

In this work we extend and improve the results done in a previous work o...
research
11/02/2020

Controlled Perturbation-Induced Switching in Pulse-Coupled Oscillator Networks

Pulse-coupled systems such as spiking neural networks exhibit nontrivial...
research
06/06/2022

Symbolic Knowledge Structures and Intuitive Knowledge Structures

This paper proposes that two distinct types of structures are present in...
research
03/15/2021

iWarded: A System for Benchmarking Datalog+/- Reasoning (technical report)

Recent years have seen increasing popularity of logic-based reasoning sy...

Please sign up or login with your details

Forgot password? Click here to reset