Gadi Pinkus

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This paper considers the problem of expressing predicate calculus in connectionist networks that are based on energy minimization. Given a firstorder-logic knowledge base and a bound k, a symmetric network is constructed (like a Boltzman machine or a Hopfield network) that searches for a proof for a given query. If a resolution-based proof of length no(More)
  • 1