Conference paper Open Access

Towards a Unified Ordering for Superposition-Based Automated Reasoning

Jakubův, Jan; Kaliszyk, Cezary

We propose an extension of the automated theorem prover E by the weighted path ordering. Weighted path ordering is theoretically stronger than all the orderings used in E-prover, however its parametrization is more involved than those normally used in automated reasoning. In particular, it depends on a term algebra. We discuss how the parameters for the ordering can be proposed automatically for particular theorem proving problem strategies. We integrate the ordering in E-prover and perform an evaluation on the standard theorem proving benchmarks. The ordering is complementary to the ones used in E prover so far.

Files (389.1 kB)
Name Size
a.pdf
md5:d1656844cf1c70f95b2fbc7848ba2f0e
389.1 kB Download
29
90
views
downloads
Views 29
Downloads 90
Data volume 35.0 MB
Unique views 27
Unique downloads 87

Share

Cite as