Add to ORKGThe inference capabilities of humans suggest that they might be using algorithms with high degrees of parallelism. This paper develops a completely parallel connectionist inference mechanism. The mechanism handles obvious inferences, where each clause is only used once, but may be extendable to harder cases. The main contribution of this paper is to show formally that some inference can be reduced to an energy minimization problem in a way that is potentially useful. 1
In this paper we present a general analysis of the parallelization of deduction strategies. We clas...
The goal of this article is to construct a connectionist inference engine that is capable of represe...
This thesis addresses the problem of efficiently representing large knowledge bases and performing a...
Although the connectionist approach has lead to elegant solutions to a number of problems in cogniti...
Massively parallel (connectionist) computational models are playing an increasingly important role i...
The chapter presents methods for efficiently representing logic formulas in connectionist networks t...
The performance of symbolic inference tasks has long been a challenge to connectionists.In this pape...
This chapter surveys the research in parallel or distributed strategies for mechanical theorem provi...
There are very few reasoners which combine natural deduction and subsumption reasoning, and there ar...
The parallel resolution procedures based on graph structures method are presented. OR-, AND- and DCD...
This paper considers the problem of expressing predicate calculus in connectionist networks that are...
Since their popularity began to rise in the mid-2000s there has been significant growth in the numbe...
Since their popularity began to rise in the mid-2000s there has been significant growth in the numbe...
This chapter considers the problems of expressing logic and constructing proofs in fault tolerant co...
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems ...
In this paper we present a general analysis of the parallelization of deduction strategies. We clas...
The goal of this article is to construct a connectionist inference engine that is capable of represe...
This thesis addresses the problem of efficiently representing large knowledge bases and performing a...
Although the connectionist approach has lead to elegant solutions to a number of problems in cogniti...
Massively parallel (connectionist) computational models are playing an increasingly important role i...
The chapter presents methods for efficiently representing logic formulas in connectionist networks t...
The performance of symbolic inference tasks has long been a challenge to connectionists.In this pape...
This chapter surveys the research in parallel or distributed strategies for mechanical theorem provi...
There are very few reasoners which combine natural deduction and subsumption reasoning, and there ar...
The parallel resolution procedures based on graph structures method are presented. OR-, AND- and DCD...
This paper considers the problem of expressing predicate calculus in connectionist networks that are...
Since their popularity began to rise in the mid-2000s there has been significant growth in the numbe...
Since their popularity began to rise in the mid-2000s there has been significant growth in the numbe...
This chapter considers the problems of expressing logic and constructing proofs in fault tolerant co...
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems ...
In this paper we present a general analysis of the parallelization of deduction strategies. We clas...
The goal of this article is to construct a connectionist inference engine that is capable of represe...
This thesis addresses the problem of efficiently representing large knowledge bases and performing a...