Published July 14, 2018
| Version v1
Conference paper
Open
Towards a Unified Ordering for Superposition-Based Automated Reasoning
Creators
- 1. Czech Technical University in Prague
- 2. University of Innsbruck
Description
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
a.pdf
Files
(389.1 kB)
Name | Size | Download all |
---|---|---|
md5:d1656844cf1c70f95b2fbc7848ba2f0e
|
389.1 kB | Preview Download |
Additional details
Funding
- AI4REASON – Artificial Intelligence for Large-Scale Computer-Assisted Reasoning 649043
- European Commission
- Interactive Proof: Proof Translation, Premise Selection, Rewriting P 26201
- FWF Austrian Science Fund
- SMART – Strong Modular proof Assistance: Reasoning across Theories 714034
- European Commission