Search Results for author:
Found 1 papers, 0 papers with code
Learning Axioms to Compute Verifiable Symbolic Expression Equivalence Proofs Using Graph-to-Sequence Networks
We target the problem of proving the semantic equivalence between two complex expressions represented as typed trees, and demonstrate our system on expressions from a rich multi-type symbolic language for linear algebra.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
