We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Combining abstract, symbolic reasoning with continuous neural reasoning is a grand challenge of representation learning. As a step in this direction, we propose a new architecture, called neural equivalence networks, for the problem of learning continuous semantic representations of algebraic and logical expressions. These networks are trained to represent semantic equivalence, even of expressions that are syntactically very different. The challenge is that semantic representations must be computed in a syntax-directed manner, because semantics is compositional, but at the same time, small changes in syntax can lead to very large changes in semantics, which can be difficult for continuous neural architectures. We perform an exhaustive evaluation on the task of checking equivalence on a highly diverse class of symbolic algebraic and boolean expression types, showing that our model significantly outperforms existing architectures.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1611.01423")
get_code_for_paper("1611.01423")
have("1611.01423")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1611.01423.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1611.01423)
Connect an agent — have() is free.