Reasoning, nonmonotonicity and learning in connectionist networks that capture propositional knowledge

G Pinkas - Artificial Intelligence, 1995 - Elsevier
The paper presents a connectionist framework that is capable of representing and learning
propositional knowledge. An extended version of propositional calculus is developed and is …

Interpretation of trained neural networks by rule extraction

V Palade, DC Neagu, RJ Patton - … Days Dortmund, Germany, October 1–3 …, 2001 - Springer
The paper focuses on the problem of rule extraction from neural networks, with the aim of
transforming the knowledge captured in a trained neural network into a familiar form for …

Abductive reasoning with recurrent neural networks

AM Abdelbar, EAM Andrews, DC Wunsch II - Neural Networks, 2003 - Elsevier
Abduction is the process of proceeding from data describing a set of observations or events,
to a set of hypotheses which best explains or accounts for the data. Cost-based abduction …

[PDF][PDF] GSAT versus simulated annealing

A Beringer, G Aschemann, HH Hoos, M Metzger… - ECAI, 1994 - Citeseer
The question of satis ability for a given propositional formula arises in many areas of AI.
Especially nding a model for a satis able formula is very important though known to be NP …

Rule extraction from neural networks by interval propagation

V Palade, DC Neagu, G Puscasu - KES'2000. Fourth …, 2000 - ieeexplore.ieee.org
This paper proposes a method of rule extraction from ordinary backpropagation neural
networks, which do not have a structure that facilitates rule extraction. This method is based …

Artificial Bee Colony in the Hopfield Network for Maximum κ-Satisfiability Problem.

MS Mohd Kasihmuddin, MA Mansor… - … of Informatics & …, 2016 - search.ebscohost.com
Artificial bee colony (ABC) is a relatively new swarm intelligence method that solves the
various type of optimization problems. This algorithm utilized the behavior of the actual bees …

Massively parallel reasoning

Bornscheuer, Hölldobler, Kalinke… - Automated Deduction—A …, 1998 - Springer
From its beginning, research in the field of connectionist systems 1 has always been
concerned with the integration of symbolic and connectionist computation (McCulloch and …

Towards a hybrid model of first-order theory refinement

NA Hallack, G Zaverucha, VC Barbosa - International Workshop on Hybrid …, 1998 - Springer
The representation and learning of a first-order theory using neural networks is still an open
problem. We define a propositional theory refinement system which uses min and max as its …

Genetic algorithm optimization of knowledge extraction from neural networks

V Palade, G Negoita, V Ariton - ICONIP'99. ANZIIS'99 & ANNES' …, 1999 - ieeexplore.ieee.org
Neural networks have been criticized for their lack of human comprehensibility. First, this
paper proposes an extraction method of crisp if-then rules from ordinary backpropagation …

[PS][PS] Aussagenlogische SAT-Verfahren und ihre Anwendung bei der Lösung des HC-Problems in gerichteten Graphen

HH Hoos - Master's thesis, Technische Universit at Darmstadt …, 1996 - cs.ubc.ca
Ausgangspunkt der Uberlegungen war die Fragestellung, inwieweit spezielle
algorithmische Probleme aus dem Bereich der Molekularbiologie in geeignet kodierter Form …