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

DOI10.1016/0004-3702(94)00032-VzbMath1013.68505MaRDI QIDQ1855237

Gadi Pinkas

Publication date: 4 February 2003

Published in: Artificial Intelligence (Search for Journal in Brave)

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Logic in artificial intelligence (68T27) Logic in computer science (03B70)

Related Items

How to decide what to do?, Nonmonotonic inferences and neural networks, Logic tensor networks, Improved training of physics-informed neural networks for parabolic differential equations with sharply perturbed initial conditions, Sequential inference with reliable observations: Learning to construct force-dynamic models, Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations, Artificial nonmonotonic neural networks, Weighted defeasible knowledge bases and a multipreference semantics for a deep neural network model, Recurrent neural networks with backtrack-points and negative reinforcement applied to cost-based abduction, Logic and Complexity in Cognitive Science, \(\text{DA}^2\) merging operators, Compiling propositional weighted bases

Cites Work

• A mathematical treatment of defeasible reasoning and its implementation.
• ``Neural computation of decisions in optimization problems
• On the stability of the travelling salesman problem algorithm of Hopfield and Tank
• A logical framework for default reasoning
• A logic for default reasoning
• Circumscription - a form of non-monotonic reasoning
• Erratum to: ``What does a conditional knowledge base entail?
• Some results on the computational complexity of symmetric connectionist networks.
• On inference from inconsistent premisses
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• A theory of the learnable
• Neural networks and physical systems with emergent collective computational abilities.
• Neurons with graded response have collective computational properties like those of two-state neurons.
• A Machine-Oriented Logic Based on the Resolution Principle
• A Computing Procedure for Quantification Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item